ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For n≥10n\ge10, let P(n)P(n) be the set of partitions of nn, and let [λ][\lambda] denote the irreducible character of SnS_n indexed by λ\lambda. Refinement of the HSTZ conjecture. There exists λ∈P(n)\lambda\in P(n) such that S2([λ])S^2([\lambda]) contains every irreducible character of SnS_n except possibly [1n][1^n]. There exists μ∈P(n)\mu\in P(n) such that A2([μ])A^2([\mu]) contains all irreducible characters except [n][n], [n−1,1][n-1,1], [n−2,2][n-2,2], and possibly [1n][1^n]. Moreover, for every n≥10n\ge10 there is a symmetric partition λ\lambda optimal for both split parts in this sense; and if a symmetric partition is optimal for A2([λ])A^2([\lambda]), missing only the three or four stated constituents, then [λ]2[\lambda]^2 contains all irreducible characters. This is presented as a computationally motivated strengthening of the HSTZ conjecture and remains open.

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.