ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Z(N)Z(N) be the number of zero entries in the character table of the symmetric group SNS_N, and let p(N)p(N) be the number of partitions of NN. Miller–Scheinerman's conjecture. As N→∞N\to\infty, the density of zero entries satisfies

Z(N)p(N)2∼2log⁡N.\frac{Z(N)}{p(N)^2}\sim\frac{2}{\log N}.

This conjecture gives an asymptotic estimate for the proportion of zero character values in the character table of SNS_N, a problem motivated by the rapid growth of the partition number and large-scale Monte Carlo simulations. Its resolution would determine the asymptotic behavior of the number of zeros in the character table.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.