Strong table-equivalence conjecture for irreducible characters
Statement
Let be a finite group, and let and denote its irreducible characters and conjugacy classes, respectively. Two irreducible characters are table-equivalent if a bijection of satisfies for every conjugacy class . They are strongly table-equivalent if this bijection also preserves class sizes. Strong table-equivalence conjecture. Table-equivalent irreducible representations are strongly table-equivalent. The claim asks whether an arbitrary matching of character-table rows can always be chosen to preserve conjugacy-class sizes; no resolution is supplied in the text.
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.