Refinement of the Heide–Saxl–Tiep–Zalesski conjecture for split squares
Statement
For , let be the set of partitions of , and let denote the irreducible character of indexed by . Refinement of the HSTZ conjecture. There exists such that contains every irreducible character of except possibly . There exists such that contains all irreducible characters except , , , and possibly . Moreover, for every there is a symmetric partition optimal for both split parts in this sense; and if a symmetric partition is optimal for , missing only the three or four stated constituents, then 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.