ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GammaGamma be a finite group, and let textnormalirr(Gamma)textnormal{irr}(Gamma) and textnormalcl(Gamma)textnormal{cl}(Gamma) denote its irreducible characters and conjugacy classes, respectively. Two irreducible characters chi1,chi2chi_1,chi_2 are table-equivalent if a bijection betabeta of textnormalcl(Gamma)textnormal{cl}(Gamma) satisfies chi1(C)=chi2(beta(C))chi_1(C)=chi_2(beta(C)) for every conjugacy class CC. 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 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.