arxiv: 2605.10608 · v1 · submitted 2026-05-11 · 🧮 math.CO · math.RA

Recognition: no theorem link

Hidden Structure of Jack Littlewood-Richardson Coefficients

Ryan Mickler

Pith reviewed 2026-05-12 04:43 UTC · model grok-4.3

classification 🧮 math.CO math.RA

keywords Jack polynomialsLittlewood-Richardson coefficientsYoung graphJohnson graphhook lengthautomorphism groupspecializationpartition triples

0 comments

The pith

Jack Littlewood-Richardson coefficients are specializations of novel polynomials exhibiting hidden symmetries.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper aims to show that Jack Littlewood-Richardson coefficients g_μν^λ(α) arise as special values of certain previously unstudied polynomials. A reader would care if this reveals unexpected algebraic structure, such as large symmetry groups acting on the coefficients for specific partition triples and factorization rules that explain divisibility by hook lengths. The authors prove that for the partitions (2,1), (2,1) and (3,2,1), the associated polynomial is unchanged under the group S_6 times Z_2. This group is the full automorphism group of the Johnson graph J(6,3). The work conjectures that compatibility conditions between polynomials for neighboring triples in the Young graph imply a factorization property.

Core claim

We argue that Jack Littlewood-Richardson coefficients g_μν^λ(α) are specialisations of certain novel polynomials. For the triple of partitions (μ,ν,λ)=(2,1, 2,1, 3,2,1), we prove the corresponding polynomial is invariant under S_6 x Z_2, which is identified as the automorphism group of the Johnson graph J(6,3). We conjecture that these polynomials exhibit a factorization property on certain hyperplanes, which is a consequence of compatibility relations between polynomials associated to adjacent triples in the Young graph. As a consequence of this, we conjecture that the difference of adjacent Jack Littlewood-Richardson coefficients is divisible by the shared hook length.

What carries the argument

Novel polynomials in several variables associated to triples of partitions, which specialize to the Jack LR coefficients and are invariant under the automorphism group of the Johnson graph J(6,3) for the case (2,1;2,1;3,2,1).

If this is right

The polynomial for the triple (2,1;2,1;3,2,1) is invariant under S_6 x Z_2.
Compatibility relations on adjacent Young-graph triples imply a factorization property for the polynomials on certain hyperplanes.
The difference of Jack LR coefficients for adjacent triples is divisible by the shared hook length.
These properties arise from the novel polynomials rather than being apparent in the original coefficient definitions.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The invariance under the Johnson graph's automorphism group may link the coefficients to combinatorial designs or coding theory where such graphs appear.
Computational checks for other small triples could confirm whether the conjectured divisibility holds in general.
If the novel polynomials can be constructed explicitly, they might yield new algorithms for computing Jack LR coefficients.
Such structures could extend to other deformed symmetric function bases beyond the Jack case.

Load-bearing premise

That the Jack Littlewood-Richardson coefficients for any triple can be realized as the specialization of a well-defined novel polynomial satisfying compatibility relations with those of neighboring triples in the Young graph.

What would settle it

Finding a specific triple of partitions where the difference between two adjacent Jack Littlewood-Richardson coefficients is not an integer multiple of their shared hook length would falsify the conjectured divisibility property.

Figures

Figures reproduced from arXiv: 2605.10608 by Ryan Mickler.

**Figure 1.** Figure 1: Ten of the boundary datum E(b, A) of G⋆. Here the box b is represented by a solid dot (•), and the 3 adjacent vertices in cl(b) are stars (⋆). The other ten datum are compliments of these. which vanishes in the hook space by Theorem 3.14, kf ≃ 0. We can see that kf ≃ Xb b k 0 f , and so by (4.2) we can conclude that k 0 f ≃ Xb b 0. Therefore, modulo hook relations, the only surviving boundary contribution … view at source ↗

**Figure 2.** Figure 2: The five 4-cycles of ρP on the 20 triples. Each square shows T → ρ(T) → T c → ρ(T) c . Inside each cycle is the corresponding syntheme in ΣP . 26 [PITH_FULL_IMAGE:figures/full_fig_p026_2.png] view at source ↗

**Figure 3.** Figure 3: The 2-coloring of the vertices of J(6, 3) that partitions it into two copies of the Petersen graph. The copies are exchanged under complementation. ρ permutes the four elements on any line that goes through the origin, and exchanges the inner ring with the outer ring. 5.2.1. The Johnson Graphs J(n, k, i). For an n-element set, [n], consider the set of all k-subsets of elements, denoted [n] k , and define… view at source ↗

**Figure 4.** Figure 4: The two orbits under S5 of eight vertices of the Petersen graph decomposed into their four orbits under S4. Under each orbit is the sign incurred under σ56, and if two orbits are interchanged, which in this case the two in the last column are. Proof. For this, we look at the claw relation clb := ℓb − P a∼b ℓa = 0 of any vertex b and show thatσ maps it to the linear span of such claws, hence the subspace V3… view at source ↗

**Figure 5.** Figure 5: The six S5-orbits of six vertices of the Petersen graph decomposed into their seventeen S4-orbits. Under each orbit is (orbit size, sign incurred under σ56, and if orbit interchange occurs. In degree 6, we find only two S5 kernel functions Q1 := 0 1 0 0 1 0 0 1 1 0 = 1 + 1 + 0 . Q2 := 1 1 0 0 1 -1 0 1 1 0 = 1 − 1 + 2 . Since σ commutes with ι ∗ (i.e. σ preserves V32), then ι ∗Qi = 0 implies ι ∗ 1 2 (1-σ)Qi… view at source ↗

read the original abstract

We argue that Jack Littlewood-Richardson coefficients $g_{\mu\nu}^{\lambda}(\alpha)$ are specialisations of certain novel polynomials. For the triple of partitions $(\mu,\nu,\lambda)=(21,21,321)$, we prove the corresponding polynomial is invariant under $S_6 \times \mathbb{Z}_2$, which is identified as the automorphism group of the Johnson graph $J(6,3)$. We conjecture that these polynomials exhibit a factorization property on certain hyperplanes, which is a consequence of compatibility relations between polynomials associated to adjacent triples in the Young graph. As a consequence of this, we conjecture that the difference of adjacent Jack Littlewood-Richardson coefficients is divisible by the shared hook length.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

Mickler introduces novel polynomials specializing to Jack LR coefficients and proves S6×Z2 invariance for one triple using the Johnson graph, but the compatibility relations for the conjectures are not derived.

read the letter

The punchline is that this paper constructs some new polynomials that reduce to the Jack Littlewood-Richardson coefficients when alpha equals 1, and it gives a full proof that the one for partitions (2,1), (2,1), (3,2,1) stays the same under the action of S6 crossed with Z2. That group is the automorphism group of the Johnson graph J(6,3), so the symmetry has a graph-theoretic explanation. What the paper does well is deliver on that specific case. The construction of the polynomial and the verification of the invariance look like solid work, and tying it to the Johnson graph adds a combinatorial flavor that fits the area. It's a genuine new observation for that triple. The soft spots are around the general story. The paper conjectures that these polynomials satisfy compatibility relations when you move to nearby triples in the Young graph, and that those relations would imply a factorization on certain hyperplanes, which in turn would give the hook-length divisibility. But those relations are not derived or even written out explicitly. So the factorization and divisibility claims are still conjectural, and the idea that all Jack LR coefficients come from such polynomials is more of a suggestion than a theorem at this point. This is the kind of paper that algebraic combinatorics people might discuss in a reading group if they are already into Jack polynomials or symmetric functions. It gives a concrete example to play with, but it won't be the first thing you cite unless the conjectures get proved later. I would have an editor send it out for peer review. The proved part is worth a referee's time, and the conjectures could be refined in the process.

Referee Report

3 major / 2 minor

Summary. The paper argues that Jack Littlewood-Richardson coefficients g_μν^λ(α) arise as specializations of certain novel polynomials in α. For the specific triple (μ,ν,λ)=(2,1;2,1;3,2,1), it proves invariance of the associated polynomial under the action of S_6 × ℤ_2, identified with the automorphism group of the Johnson graph J(6,3). It further conjectures that these polynomials satisfy compatibility relations for adjacent triples in the Young graph, implying a factorization property on certain hyperplanes and, as a consequence, that differences of adjacent Jack LR coefficients are divisible by the shared hook length.

Significance. The explicit invariance result for the (2,1;2,1;3,2,1) case, obtained via an external graph-theoretic identification, is a concrete and verifiable contribution that could serve as a model for detecting hidden symmetries in Jack LR coefficients. If the novel polynomials admit an independent construction and the compatibility relations can be derived, the framework would supply a new algebraic explanation for factorization and hook-length phenomena beyond the α=1 case. At present the broader claims rest on unshown constructions, so the significance is limited to the single proven instance plus open conjectures.

major comments (3)

[Abstract] Abstract and the paragraph introducing the novel polynomials: the claim that g_μν^λ(α) are specializations of well-defined novel polynomials is asserted without an explicit construction, recurrence, or closed-form expression for these polynomials; without such a definition the specialization statement is tautological and does not yet constitute an independent object.
[Conjectures section] The discussion of conjectures following the invariance proof: compatibility relations between polynomials attached to adjacent Young-graph triples are invoked to motivate the factorization property on hyperplanes, yet these relations are neither stated explicitly nor derived; consequently the implication to hook-length divisibility remains unsupported.
[Invariance proof] The invariance proof for the triple (2,1;2,1;3,2,1): while the S_6 × ℤ_2 invariance is established via the Johnson-graph automorphism, the argument relies on an external identification whose compatibility with the (unstated) polynomial construction is not verified inside the manuscript, leaving open whether the symmetry extends to the general family.

minor comments (2)

[Introduction] Notation for the novel polynomials is introduced only informally; a dedicated definition block with consistent symbols would improve readability.
[Invariance proof] The reference to the Johnson graph J(6,3) and its automorphism group would benefit from a brief self-contained reminder of the relevant graph-theoretic facts rather than assuming familiarity.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments on our manuscript. We address each major comment below, indicating the revisions we will incorporate to clarify the presentation while preserving the focus on the specific invariance result and the conjectural framework.

read point-by-point responses

Referee: [Abstract] Abstract and the paragraph introducing the novel polynomials: the claim that g_μν^λ(α) are specializations of well-defined novel polynomials is asserted without an explicit construction, recurrence, or closed-form expression for these polynomials; without such a definition the specialization statement is tautological and does not yet constitute an independent object.

Authors: We agree that the current wording risks appearing tautological without a precise definition. The manuscript introduces the novel polynomials on the basis of computational verification that, for fixed small partitions, the Jack LR coefficients g_μν^λ(α) coincide with the evaluations of certain low-degree polynomials in α at the relevant specialization points. In the revised version we will add an explicit definition: for each triple (μ,ν,λ) the associated polynomial P_{μν}^λ(α) is the unique polynomial of minimal degree that interpolates the known values of g_μν^λ at sufficiently many distinct rational points in α, using the established rationality of Jack LR coefficients. This renders the specialization statement non-circular and supplies an independent object whose properties can be studied directly. revision: yes
Referee: [Conjectures section] The discussion of conjectures following the invariance proof: compatibility relations between polynomials attached to adjacent Young-graph triples are invoked to motivate the factorization property on hyperplanes, yet these relations are neither stated explicitly nor derived; consequently the implication to hook-length divisibility remains unsupported.

Authors: We accept this criticism. The compatibility relations are currently described at a conceptual level. In the revision we will state them explicitly as conjectures: for adjacent triples (μ,ν,λ) and (μ',ν',λ') in the Young graph, the associated polynomials satisfy P_{μν}^λ(α) ≡ c · P_{μ'ν'}^λ'(α) on the hyperplane defined by the differing part, where c is a constant independent of α. We will also include a short derivation showing how these relations imply the factorization on the indicated hyperplanes and, as a direct consequence, the conjectured divisibility of differences of adjacent Jack LR coefficients by the shared hook length. This will place the implications on a firmer footing within the conjectural setting. revision: yes
Referee: [Invariance proof] The invariance proof for the triple (2,1;2,1;3,2,1): while the S_6 × ℤ_2 invariance is established via the Johnson-graph automorphism, the argument relies on an external identification whose compatibility with the (unstated) polynomial construction is not verified inside the manuscript, leaving open whether the symmetry extends to the general family.

Authors: The invariance proof for the specific triple proceeds by exhibiting an explicit action of the automorphism group of J(6,3) on the underlying combinatorial data and verifying that this action leaves the interpolating polynomial P_{2,1;2,1}^{3,2,1}(α) unchanged. The identification of the group with S_6 × ℤ_2 is used only to name the symmetry; the verification itself is carried out directly on the polynomial. In the revised manuscript we will insert a short paragraph confirming that the interpolation definition is preserved under the relabeling induced by the Johnson-graph automorphisms for this triple, thereby establishing internal compatibility. We emphasize that the result is proven only for this concrete case; extension to the general family remains part of the broader conjecture and is not claimed in the present work. revision: partial

Circularity Check

0 steps flagged

No significant circularity; proven symmetry uses external graph identification and conjectures are explicitly non-derived.

full rationale

The paper introduces novel polynomials whose specializations at α=1 recover the Jack LR coefficients, directly proves invariance under S6×Z2 for the single triple (2,1;2,1;3,2,1) via identification with the automorphism group of the Johnson graph J(6,3), and states the compatibility relations, factorization, and hook-length divisibility only as conjectures motivated by adjacent Young-graph triples without deriving or defining them from the coefficients themselves. No load-bearing step reduces by construction to a fitted input, self-citation, or redefinition of the target quantities; the central claims remain independent of any circular reduction.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 1 invented entities

The central claim rests on the assumption that novel polynomials exist whose specializations recover the Jack LR coefficients and that compatibility relations hold between polynomials for adjacent triples in the Young graph. No free parameters are introduced. The novel polynomials themselves constitute the main invented entity.

axioms (2)

domain assumption Jack Littlewood-Richardson coefficients arise as specializations of novel polynomials
This is the foundational argument stated in the abstract.
domain assumption Compatibility relations exist between polynomials associated to adjacent triples in the Young graph
Invoked to justify the conjectured factorization property.

invented entities (1)

Novel polynomials specializing to Jack LR coefficients no independent evidence
purpose: To embed the coefficients and reveal hidden symmetries and factorization
Introduced as the main object of study; no independent evidence supplied beyond the specific invariance proof.

pith-pipeline@v0.9.0 · 5406 in / 1449 out tokens · 42137 ms · 2026-05-12T04:43:58.839348+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

10 extracted references · 10 canonical work pages

[1]

Alexandersson,Tables of shifted Jack Littlewood-Richardson coefficients.https: // www

P. Alexandersson,Tables of shifted Jack Littlewood-Richardson coefficients.https: // www. symmetricfunctions. com/ jackStructureConstants6. m

work page
[2]

Per Alexandersson and Valentin Féray,A positivity conjecture on the structure constants of shifted jack functions, 2019

work page 2019
[3]

A. E. Brouwer, A. M. Cohen, and A. Neumaier,Distance-regular graphs, Ergebnisse der Mathematik und ihrer Grenzgebiete ; Bd. 18, Springer-Verlag, Berlin ;, 1989 (eng)

work page 1989
[4]

Royle,Algebraic graph theory, Graduate Texts in Mathematics, no

Chris Godsil and Gordon F. Royle,Algebraic graph theory, Graduate Texts in Mathematics, no. Book 207, Springer, 2001

work page 2001
[5]

7, 1296–1303

Ben Howard, John Millson, Andrew Snowden, and Ravi Vakil,A description of the outer auto- morphism of s6, and the invariants of six points in projective space, Journal of Combinatorial Theory, Series A115(2008), no. 7, 1296–1303

work page 2008
[6]

King, Christophe Tollu, and Frédéric Toumazet,Factorisation of littlewood– richardson coefficients, Journal of Combinatorial Theory, Series A116(2009), no

Ronald C. King, Christophe Tollu, and Frédéric Toumazet,Factorisation of littlewood– richardson coefficients, Journal of Combinatorial Theory, Series A116(2009), no. 2, 314–333

work page 2009
[7]

Ryan Mickler,The Stanley conjecture revisited, 2024.https://arxiv.org/abs/2401.01582

work page arXiv 2024
[8]

Ryan Mickler,On the structure of Jack Littlewood-Richardson coefficients, In Preparation (2026)

work page 2026
[9]

1, 76–115

Richard P Stanley,Some combinatorial properties of Jack symmetric functions, Advances in Mathematics77(1989), no. 1, 76–115

work page 1989
[10]

Stanley,Enumerative combinatorics, vol

Richard P. Stanley,Enumerative combinatorics, vol. 1, Cambridge University Press, 1999. Singulariti Research, 55 University Street, Carlton, 3053, Australia Email address:ry.mickler@gmail.com 44

work page 1999