Multiplicity-free classification conjecture for symmetric and alternating Kronecker squares
Statement
Let and let . A character is multiplicity-free when every irreducible constituent occurs with multiplicity at most one. The partitions listed in parts (1) and (3) of Proposition~ are the partitions identified there. Multiplicity-free classification conjecture. These are all partitions for which either the symmetric part or the alternating part is multiplicity-free. The proposition gives the currently known families, while computational data motivate this stronger classification; the conjecture 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.