OpenFrontiers
← Back to the index
OP-9605Status unassessedCombinatorics

Tableaux problem 46

Tableaux problem 46

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

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

Problem statement

46.[Gaetz2018a]*Conj. 1.6 Let G:{e}=G0⊂G1⊂G2⊂⋯\mathfrak{G}:\{e\}=G_{0}\subset G_{1}\subset G_{2}\subset\cdots be a tower of groups and let r∈Z>0r\in\mathbb{Z}_{>0}. Define PP to be the splitting diagram of the representations of the tower of groups, with weights that are the multiplicities of the splittings. The tower is rr-dual if PP is a self-dual graded graph with differential degree rr. The tower is rr-differential if the tower is rr-dual and the weights of PP are all 1, it is a differential poset. Show that: (a) If G\mathfrak{G} is rr-differential then P(G)≅Y⊗rP(\mathfrak{G})\cong\mathbb{Y}^{\otimes r} and there exists an abelian group AA of order rr, not depending on nn, such that Gn≅A≀SnG_{n}\cong A\wr S_{n} for all n≥0n\geq 0. (b) If G\mathfrak{G} is rr-dual then P(G)≅(d1Y)×⋯×(dkY)P(\mathfrak{G})\cong(d_{1}\mathbb{Y})\times\cdots\times(d_{k}\mathbb{Y}) for some d1,…,dkd_{1},\ldots,d_{k} and there exists a group HH of order rr, not depending on nn, such that Gn≅H≀SnG_{n}\cong H\wr S_{n} for all n≥0n\geq 0.

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 46 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.