OSOhad Sheinfeld
Ohad Sheinfeld
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ohad Sheinfeld has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Nathan Keller
Department of Mathematics, Bar Ilan University, Ramat Gan, Israel
4 shared publications - Noam Lifshitz
Hebrew University of Jerusalem, Israel
4 shared publications Alon Gurny
1 shared publicationDaniel Golan
1 shared publication- Dolev Mutzari1 shared publication
- Dor Minzer
Massachusetts Institute of Technology, Cambridge, USA
1 shared publication
Latest Publications
- Open Access
The Forbidden Cross Intersection Problem for Permutations
We prove the following, for a universal constant $c>0$. Let $n \in \mathbb{N}$ and $1 \leq t0$, the statement fails for $t=(1+ε)\frac{n}{\log_2 n}$ and all $n>n_0(ε)$. This solves the cross-intersection variant of the Erdős-Sós forbidden intersection problem for permutations. The best previously known result, by Kupavskii and Zakharov (Adv.~Math., 2024), obtained the same assertion for $t \leq \tilde{O}(n^{1/3})$. We obtain our result by combining two recently introduced techniques: hypercontractivity of global functions and spreadness.Open AccessThe Forbidden Cross Intersection Problem for Permutations
We prove the following, for a universal constant $c>0$. Let $n \in \mathbb{N}$ and $1 \leq t0$, the statement fails for $t=(1+ε)\frac{n}{\log_2 n}$ and all $n>n_0(ε)$. This solves the cross-intersection variant of the Erdős-Sós forbidden intersection problem for permutations. The best previously known result, by Kupavskii and Zakharov (Adv.~Math., 2024), obtained the same assertion for $t \leq \tilde{O}(n^{1/3})$. We obtain our result by combining two recently introduced techniques: hypercontractivity of global functions and spreadness. - Open Access
- 21 October 2024
- Published by Cambridge University Press (CUP) in Forum of Mathematics, Sigma
- Vol. 12, e85
Improved covering results for conjugacy classes of symmetric groups via hypercontractivity
We study covering numbers of subsets of the symmetric group $S_n$ that exhibit closure under conjugation, known as normal sets. We show that for any $\epsilon>0$ , there exists $n_0$ such that if $n>n_0$ and A is a normal subset of the symmetric group $S_n$ of density $\ge e^{-n^{2/5 - \epsilon }}$ , then $A^2 \supseteq A_n$ . This improves upon a seminal result of Larsen and Shalev (Inventiones Math., 2008), with our $2/5$ in the double exponent replacing their $1/4$ . Our proof strategy combines two types of techniques. The first is ‘traditional’ techniques rooted in character bounds and asymptotics for the Witten zeta function, drawing from the foundational works of Liebeck–Shalev, Larsen–Shalev, and more recently, Larsen–Tiep. The second is a sharp hypercontractivity theorem in the symmetric group, which was recently obtained by Keevash and Lifshitz. This synthesis of algebraic and analytic methodologies not only allows us to attain our improved bounds but also provides new insights into the behavior of general independent sets in normal Cayley graphs over symmetric groups.- 21 October 2024
- Published by Cambridge University Press (CUP) in Forum of Mathematics, Sigma
- Vol. 12, e85
Open AccessImproved covering results for conjugacy classes of symmetric groups via hypercontractivity
We study covering numbers of subsets of the symmetric group $S_n$ that exhibit closure under conjugation, known as normal sets. We show that for any $\epsilon>0$ , there exists $n_0$ such that if $n>n_0$ and A is a normal subset of the symmetric group $S_n$ of density $\ge e^{-n^{2/5 - \epsilon }}$ , then $A^2 \supseteq A_n$ . This improves upon a seminal result of Larsen and Shalev (Inventiones Math., 2008), with our $2/5$ in the double exponent replacing their $1/4$ . Our proof strategy combines two types of techniques. The first is ‘traditional’ techniques rooted in character bounds and asymptotics for the Witten zeta function, drawing from the foundational works of Liebeck–Shalev, Larsen–Shalev, and more recently, Larsen–Tiep. The second is a sharp hypercontractivity theorem in the symmetric group, which was recently obtained by Keevash and Lifshitz. This synthesis of algebraic and analytic methodologies not only allows us to attain our improved bounds but also provides new insights into the behavior of general independent sets in normal Cayley graphs over symmetric groups. - Open Access
Improved covering results for conjugacy classes of symmetric groups via hypercontractivity
We study covering numbers of subsets of the symmetric group $S_n$ that exhibit closure under conjugation, known as \emph{normal} sets. We show that for any $ε>0$, there exists $n_0$ such that if $n>n_0$ and $A$ is a normal subset of the symmetric group $S_n$ of density $\ge e^{-n^{2/5 - ε}}$, then $A^2 \supseteq A_n$. This improves upon a seminal result of Larsen and Shalev (Inventiones Math., 2008), with our $2/5$ in the double exponent replacing their $1/4$. Our proof strategy combines two types of techniques. The first is `traditional' techniques rooted in character bounds and asymptotics for the Witten zeta function, drawing from the foundational works of Liebeck--Shalev, Larsen--Shalev, and more recently, Larsen--Tiep. The second is a sharp hypercontractivity theorem in the symmetric group, which was recently obtained by Keevash and Lifshitz. This synthesis of algebraic and analytic methodologies not only allows us to attain our improved bounds but also provides new insights into the behavior of general independent sets in normal Cayley graphs over symmetric groups.Open AccessImproved covering results for conjugacy classes of symmetric groups via hypercontractivity
We study covering numbers of subsets of the symmetric group $S_n$ that exhibit closure under conjugation, known as \emph{normal} sets. We show that for any $ε>0$, there exists $n_0$ such that if $n>n_0$ and $A$ is a normal subset of the symmetric group $S_n$ of density $\ge e^{-n^{2/5 - ε}}$, then $A^2 \supseteq A_n$. This improves upon a seminal result of Larsen and Shalev (Inventiones Math., 2008), with our $2/5$ in the double exponent replacing their $1/4$. Our proof strategy combines two types of techniques. The first is `traditional' techniques rooted in character bounds and asymptotics for the Witten zeta function, drawing from the foundational works of Liebeck--Shalev, Larsen--Shalev, and more recently, Larsen--Tiep. The second is a sharp hypercontractivity theorem in the symmetric group, which was recently obtained by Keevash and Lifshitz. This synthesis of algebraic and analytic methodologies not only allows us to attain our improved bounds but also provides new insights into the behavior of general independent sets in normal Cayley graphs over symmetric groups. - Open Access
On $t$-Intersecting Families of Permutations
We prove that there exists a constant $c_0$ such that for any $t \in \mathbb{N}$ and any $n\geq c_0 t$, if $A \subset S_n$ is a $t$-intersecting family of permutations then$|A|\leq (n-t)!$. Furthermore, if $|A|\ge 0.75(n-t)!$ then there exist $i_1,\ldots,i_t$ and $j_1,\ldots,j_t$ such that $σ(i_1)=j_1,\ldots,σ(i_t)=j_t$ holds for any $σ\in A$. This shows that the conjectures of Deza and Frankl (1977) and of Cameron (1988) on $t$-intersecting families of permutations hold for all $t \leq c_0 n$. Our proof method, based on hypercontractivity for global functions, does not use the specific structure of permutations, and applies in general to $t$-intersecting sub-families of `pseudorandom' families in $\{1,2,\ldots,n\}^n$, like $S_n$.Open AccessOn $t$-Intersecting Families of Permutations
We prove that there exists a constant $c_0$ such that for any $t \in \mathbb{N}$ and any $n\geq c_0 t$, if $A \subset S_n$ is a $t$-intersecting family of permutations then$|A|\leq (n-t)!$. Furthermore, if $|A|\ge 0.75(n-t)!$ then there exist $i_1,\ldots,i_t$ and $j_1,\ldots,j_t$ such that $σ(i_1)=j_1,\ldots,σ(i_t)=j_t$ holds for any $σ\in A$. This shows that the conjectures of Deza and Frankl (1977) and of Cameron (1988) on $t$-intersecting families of permutations hold for all $t \leq c_0 n$. Our proof method, based on hypercontractivity for global functions, does not use the specific structure of permutations, and applies in general to $t$-intersecting sub-families of `pseudorandom' families in $\{1,2,\ldots,n\}^n$, like $S_n$.