OpenFrontiers
← Back to the index
OP-9588Status unassessedCombinatorics

Tableaux problem 28

Tableaux problem 28

Inferred from the community field; finer classification has not been reviewed.

Specialist source · status unassessedAs of 2026-09-10Source & evidence ↓

Problem statement

28.[Stan1999a]*Ch. 7 Exer. 68(b) Let GG be a finite group of order gg. Given w∈Gw\in G, let f(w)f(w) be the number of pairs (u,v)∈G×G(u,v)\in G\times G satisfying w=uvu−1v−1w=uvu^{-1}v^{-1} (the commutator of uu and vv). Thus ff is a class function on GG and hence a linear combination ∑cχχ\sum c_{\chi}\chi of irreducible characters χ\chi of GG. The multiplicity cχc_{\chi} of χ\chi in ff is equal to g/χ(1)g/\chi(1). Since χ(1)∣g\chi(1)|g, it follows that ff is a character of GG. Find an explicit GG-module MM whose character is ff, which directly proves that ff is a real character. Since in the equation f=∑gχ(1)χf=\sum\frac{g}{\chi(1)}\chi all the χ\chi’s are linearly independent, this would provide a new proof of the basic result that χ(1)\chi(1) divides the order of GG.

Lean 4

Not yet attached

No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.

Background

Source snapshot inspected on 10 September 2026. Subsequent research status and the accuracy of source formalizations have not been independently certified.

Dale R. Worley, version 3 (5 April 2026). Source citation keys are retained even where the arXiv HTML does not resolve its bibliography.

CC BY 4.0; Dale R. Worley. HTML converted to Markdown with attribution and source links.

References
  1. [1]Tableaux — A notebook of open problems — Tableaux problem 28 link
  2. [2]Creative Commons Attribution 4.0 International link

Recorded progress

Add yours →

Nothing recorded yet. A pointer to a paper the entry is missing counts.

Machine attempts

0 recorded

Attempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.

No machine attempts recorded.

Sign in to run an attempt. New accounts start with enough credits for ten.

Discussion

0 notes

Notes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.

No notes yet.

Sign in to add a note.