ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let b1(n)b_1(n) be the largest irreducible character degree of the symmetric group SnS_n, and for each m≥2m\geq 2 let bm(n)b_m(n) be the mm-th largest irreducible character degree of SnS_n. Submaximal character degree ratio conjecture. For any fixed integer m≥2m\geq 2,

bm(n)b1(n)→1as n→∞.\frac{b_m(n)}{b_1(n)}\to 1\quad\text{as }n\to\infty.

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 mm.

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.