Ohad Sheinfeld

activity

20232026

most citedImproved covering results for conjugacy classes of symmetric groups via hypercontractivity

1 citations · 1 across the 6 of their papers we have counts for

collaborators

7 papers

math.GR2026

The Robust Thompson's Conjecture for Alternating Groups

Nathan Keller, Noam Lifshitz, Avichai Marmor +1

We show that there exists a constant $ε > 0$ such that if $C$ is a conjugacy class in $A_{n}$ of size at least $∣ A_{n} ∣^{1 - ε}$ , then $A_{n} ∖ {1} \subseteq C^{2}$ . This proves the…

math.GR2026

On Shalev's Quantitative Version of Thompson's Conjecture

Ohad Sheinfeld

The classical Thompson's conjecture asserts that in any finite nonabelian simple group $G$ , there exists a conjugacy class $S$ whose square is equal to the entire group. Shalev (An…

math.CO2026

A Complete Intersection Theorem for Large Permutation Groups

Nathan Keller, Andrey Kupavskii, Noam Lifshitz +1

A family of permutations is called $t$ -intersecting if any two permutations in the family agree on at least $t$ elements. We prove that there exists $n_{0} \in N$ such that…

math.CO2026

Forbidden Intersection Theorems for Matrix Spaces

Esty Kelman, Nathan Lindzey, Ohad Sheinfeld

A family of $m \times n$ matrices $F \subseteq F_{q}^{m \times n}$ is { $(t - 1)$ -intersection-free} if $dim ker (A - B) \neq = t - 1$ for all $A, B \in F$ . A \em…

math.CO2025

The Forbidden Cross Intersection Problem for Permutations

Nathan Keller, Noam Lifshitz, Ohad Sheinfeld

We prove the following, for a universal constant $c > 0$ . Let $n \in N$ and $1 \leq t < c \frac{n}{l o g n}$ . Let $F, G \subset S_{n}$ be families of permutations such that no $σ\i…

math.GR2023★ 1 cited

Improved covering results for conjugacy classes of symmetric groups via hypercontractivity

Nathan Keller, Noam Lifshitz, Ohad Sheinfeld

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…

math.CO2023

On $t$ -Intersecting Families of Permutations

Nathan Keller, Noam Lifshitz, Dor Minzer +1

We prove that there exists a constant $c_{0}$ such that for any $t \in N$ and any $n \geq c_{0} t$ , if $A \subset S_{n}$ is a $t$ -intersecting family of permutations then$|A|\leq…