Metraipolis › archive › dc_92af75384db2

Zero-free columns in character tables of symmetric groups — arXiv:2608.27718

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.27718
License (as archived)
CC0-1.0
Archived
2026-10-17T11:22:59.313Z
SHA-256 of the archived text
3a4eb8fd0af0f02c3a18bf8609e60c2ba182345d7fed72294b15054696b56e8f
Stable URL of this page
https://metraipolis.com/documento/dc_92af75384db2

How to cite

Zero-free columns in character tables of symmetric groups — arXiv:2608.27718 — arXiv (en), https://arxiv.org/abs/2608.27718 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_92af75384db2 (Metraipolis archive dc_92af75384db2, sha256 3a4eb8fd0af0f02c3a18bf8609e60c2ba182345d7fed72294b15054696b56e8f)
BibTeX
@misc{dc92af75384db2,
  title = {Zero-free columns in character tables of symmetric groups — arXiv:2608.27718},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.27718},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_92af75384db2; sha256 3a4eb8fd0af0f02c3a18bf8609e60c2ba182345d7fed72294b15054696b56e8f},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.27718. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The rows and columns of the character table of the symmetric group $S_n$ are both naturally indexed by partitions of $n$. Let $D(n)$ denote the number of conjugacy classes of $S_n$ whose column contains no zero entry. The identity column is always zero-free, so $D(n)\geq 1$. It is known that $D(n)\ll n^2$. We prove that $D(n)\ll n^{3/4}$. Second, we prove for almost all positive integers $n$ that $D(n)\ll_B n^{1/2}(\log n)^B$ for every $B>5/6$, with a quantitative bound for the exceptional set, using work of Matomäki and Radziwill. Finally, we offer a heuristic supporting our conjecture that $D(n)\ll_{\varepsilon} n^{\varepsilon}$. AxiomProver formalized the results in this paper in Lean assuming preexisting literature.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-31 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Number Theory (math.NT); Representation Theory (math.RT).
Pagina del lavoro: https://arxiv.org/abs/2608.27718 — 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-17T11:06:51.760Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-31?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).