Metraipolis › archive › dc_5234acd69fa3
The Robust Thompson's Conjecture for Alternating Groups — arXiv:2609.31453
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.31453
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T02:59:26.903Z
- SHA-256 of the archived text
d96c8cecdb0bb4ef11125b985bd7ede96f15f4e4554ef5c821b4c31804934a7f- Stable URL of this page
https://metraipolis.com/documento/dc_5234acd69fa3
How to cite
The Robust Thompson's Conjecture for Alternating Groups — arXiv:2609.31453 — arXiv (en), https://arxiv.org/abs/2609.31453 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5234acd69fa3 (Metraipolis archive dc_5234acd69fa3, sha256 d96c8cecdb0bb4ef11125b985bd7ede96f15f4e4554ef5c821b4c31804934a7f)
BibTeX
@misc{dc5234acd69fa3,
title = {The Robust Thompson's Conjecture for Alternating Groups — arXiv:2609.31453},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.31453},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5234acd69fa3; sha256 d96c8cecdb0bb4ef11125b985bd7ede96f15f4e4554ef5c821b4c31804934a7f},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.31453. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We show that there exists a constant $\epsilon > 0$ such that if $C$ is a conjugacy class in $A_n$ of size at least $|A_n|^{1-\epsilon}$, then $A_n \setminus \{1\} \subseteq C^2$. This proves the robust version of Thompson's conjecture for the alternating group, conjectured by Shalev (Annals of Math., 2009). Our proof combines character bounds and combinatorial cancellation techniques with the recent theory of hypercontractivity for functions over symmetric groups.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-28 in math.CO).
Categorie arXiv: Group Theory (math.GR) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.31453 — 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-08T02:28:17.957Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).