ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n∈Nn\in\mathbb N and let λ⊢n\lambda\vdash n. 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 S2([λ])S^2([\lambda]) or the alternating part A2([λ])A^2([\lambda]) 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 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.