Prime-divisibility conjecture for symmetric-group character tables
Statement
Let be the symmetric group, and let its character table have entries given by the values of irreducible characters on conjugacy classes. For a fixed prime number , choose an entry uniformly from the character table. Prime-divisibility conjecture. The proportion of entries divisible by tends to as . This generalizes the even-entry phenomenon from divisibility by to every fixed prime. The paper gives numerical tables supporting the proposed general phenomenon, but no proof or resolution is supplied.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.