Almost all entries in the character table of the symmetric group are multiples of any given prime

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

Sarah Peluse , Kannan Soundararajan This is my paper · ORCID

classification math.COmath.NTmath.RT

keywords almostcharacterprimetableconjecturedivisibleentriesentry

verification ladder T0 review T1 audit T2 compute T3 formal

No signed human review yet.

0 comments

abstract

We show that almost every entry in the character table of $S_N$ is divisible by any fixed prime as $N\to\infty$. This proves a conjecture of Miller.

Forward citations

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Congruences in character tables of symmetric groups
math.CO 2019-08 accept novelty 7.0 of 10

For partitions λ and μ of the same integer, replacing each square by d^2 squares makes the character value χ_{λ̲}(μ̲) divisible by d!.
Single Frequency CMB Foreground Removal with Inter-scale Machine Learning
astro-ph.CO 2026-07 conditional novelty 6.0 of 10

A hybrid CNN using both inter-scale and multi-frequency dust correlations achieves residual B-mode foreground power 3.62e-4 in DustFilaments simulations, about 7x lower than spatial ILC.