Moore–Russell conjecture on symmetric-group characters
For every positive integer , every partition , and every permutation , let be the irreducible character of indexed by , let , let denote the first part of the conjugate partition, and let . Then ; equivalently, .
References
- River ribbon tableaux and symmetric group characters — arXiv — Lucas Teyssier
Source: arXiv
Progress summary
A new unrefereed preprint claims to prove the conjectured character bound and a related tableau-counting conjecture, but the claim has not been independently verified.
The Moore–Russell conjecture predicts uniform bounds for symmetric-group characters for every support size and is linked to a skew-tableau enumeration conjecture. The latest preprint claims both conjectures are resolved through a new tableau model.
Known results
- A 2025 preprint proves strong uniform character bounds for all and nonidentity using thick-hook decompositions, but matches the Moore–Russell bound only when .
- The same work proves new skew-tableau and elementary character estimates, without claiming the full conjecture for every support size.
October 2026 claimed resolution
Lucas Teyssier’s new preprint presents a river-ribbon-tableau model that allegedly proves the Moore–Russell character bound uniformly and establishes the linked skew-tableau enumeration conjecture. The result is presented as an unrefereed preprint, so the claimed resolution remains unverified.
Current status (as of October 2026): The full conjecture is claimed solved by Teyssier’s preprint, while the claim remains unverified; earlier published evidence settles only partial regimes and bounds.
Solutions 0
No solutions have been posted yet.