Ohad Sheinfeld

collaborators

3 papers

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 $Ï\…