Submaximal character degree ratio conjecture for symmetric groups
Statement
Let be the largest irreducible character degree of the symmetric group , and for each let be the -th largest irreducible character degree of . Submaximal character degree ratio conjecture. For any fixed integer ,
This conjecture asserts that symmetric groups have no single character degree that remains asymptotically separated from the other largest degrees; the paper presents experimental evidence for the analogous behavior of the second and third largest degrees, but does not provide a proof for arbitrary fixed .
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.