Metraipolis › archive › dc_360d3d177af2
Sharp stability for cross $t$-intersecting families of permutations in the linear range — arXiv:2609.14409
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.14409
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T01:25:19.940Z
- SHA-256 of the archived text
c8f523b6d7a50d44860e577992419f92e10e69c1336b665cd60c5bff09ecc0c8- Stable URL of this page
https://metraipolis.com/documento/dc_360d3d177af2
How to cite
Sharp stability for cross $t$-intersecting families of permutations in the linear range — arXiv:2609.14409 — arXiv (en), https://arxiv.org/abs/2609.14409 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_360d3d177af2 (Metraipolis archive dc_360d3d177af2, sha256 c8f523b6d7a50d44860e577992419f92e10e69c1336b665cd60c5bff09ecc0c8)
BibTeX
@misc{dc360d3d177af2,
title = {Sharp stability for cross $t$-intersecting families of permutations in the linear range — arXiv:2609.14409},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.14409},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_360d3d177af2; sha256 c8f523b6d7a50d44860e577992419f92e10e69c1336b665cd60c5bff09ecc0c8},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.14409. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Two families $\mathcal{F},\mathcal{G}\subseteq S_n$ are cross $t$-intersecting if every $\sigma\in\mathcal{F}$ and $\tau\in\mathcal{G}$ agree on at least $t$ points. A $t$-coset is a coset of the stabilizer of $t$ points. A subset of $S_n$ is non-trivial if it is not contained in any $t$-coset. Let $d_m$ denote the $m$-th derangement number. We prove that, for all $t\geq1$ and $n\geq400t$, every pair of cross $t$-intersecting families $\mathcal{F},\mathcal{G}\subseteq S_n$ satisfies the following: (i) $|\mathcal{F}||\mathcal{G}|\leq((n-t)!-d_{n-t}-d_{n-t-1})((n-t)!+t)$ if $\mathcal{F}\cup\mathcal{G}$ is non-trivial. (ii) $|\mathcal{F}||\mathcal{G}|\leq((n-t)!-d_{n-t}-d_{n-t-1}+t)^2$ if both $\mathcal{F}$ and $\mathcal{G}$ are non-trivial. (iii) $\min\{|\mathcal{F}\setminus\mathcal{C}|,|\mathcal{G}\setminus\mathcal{C}|\}\leq t((n-t-1)!-(n-t-2)!)$ for some $t$-coset $\mathcal{C}$ if $t\geq2$. We also characterize all extremal configurations. The first result extends a theorem of Ellis (2011) to an exponentially wider range and sharpens the stability theorem of Keller, Lifshitz, Minzer and Sheinfeld (2024); the second gives a product version of the classical Hilton--Milner--Frankl theorem for permutations; and the third settles the remaining cases $t\geq2$ of a conjecture of Ellis (2011) in a stronger form. In all three results, the linear dependence on $t$ is essentially optimal. Our proofs are based on the spread approximation method introduced by Kupavskii and Zakharov and on an approach to cross $t$-intersection problems developed by the present authors, with several essential refinements. As an application of our approach, we prove a product version of the Hilton--Milner--Frankl theorem for the alternating group.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.14409 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T00:39:30.214Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).