Recursive structures of molecules and cells in Gelfand $S_n$-graphs

Yifeng Zhang; Zhiqiang Dai

arxiv: 2605.17844 · v1 · pith:D45PHYM7new · submitted 2026-05-18 · 🧮 math.CO · math.RT

Recursive structures of molecules and cells in Gelfand S_n-graphs

Zhiqiang Dai , Yifeng Zhang This is my paper

Pith reviewed 2026-05-20 09:52 UTC · model grok-4.3

classification 🧮 math.CO math.RT

keywords Gelfand S_n-graphsmoleculescellsrecursive structureIwahori-Hecke algebraKazhdan-Lusztig W-graphssymmetric group S_n

0 comments

The pith

A recursive structure of S_n shows that a specific molecule in the Gelfand S_n-graph is a cell.

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

The paper introduces a recursive structure on the symmetric group S_n to analyze Gelfand S_n-graphs, which generalize Kazhdan-Lusztig W-graphs to modules over the Iwahori-Hecke algebra. The authors study how this structure acts on the molecules of the graph and show that the action maps molecules to molecules. They apply the construction to prove that one chosen molecule meets the definition of a cell. A reader would care because the result offers a concrete method for identifying cells within these graphs that encode multiplication actions in algebraic modules.

Core claim

The central claim is that a recursive structure of S_n acts on the molecules of the Gelfand S_n-graph in a manner compatible with the defining multiplication action, and this action is used to establish that a specific molecule is a cell.

What carries the argument

The recursive structure of S_n, which acts on molecules while preserving the relations needed for the cell property.

If this is right

The recursive construction supplies a verification procedure for the cell property on additional molecules in the same Gelfand S_n-graph.
The same structure can be applied to organize the full set of molecules and cells in Gelfand S_n-graphs.
Compatibility between the recursion and the graph's multiplication action yields a systematic tool for checking cell conditions in these objects.

Where Pith is reading between the lines

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

The recursive method could extend to Gelfand graphs attached to other finite Coxeter groups.
It may clarify how cells partition the underlying Hecke module into indecomposable pieces.
Further examples could be tested by applying the recursion to different starting molecules.

Load-bearing premise

The recursive structure of S_n is compatible with the multiplication action defining the Gelfand graph and maps molecules to molecules in a manner that preserves the cell property for the chosen example.

What would settle it

An explicit computation of the Gelfand S_n-graph for small n that shows the chosen molecule fails to satisfy the cell axioms, or that the recursive mapping sends it outside the expected molecule class.

Figures

Figures reproduced from arXiv: 2605.17844 by Yifeng Zhang, Zhiqiang Dai.

**Figure 1.** Figure 1: The staircase line for ϕpFn´4q Through drawing lines between νkpxq and νk´1pxq where k ě 3, we can obtain a staircase line as shown in [PITH_FULL_IMAGE:figures/full_fig_p010_1.png] view at source ↗

**Figure 2.** Figure 2: The staircase line for 1 ď j ‰ n ´ 3 Yn´1 Yn´2 Yn´3 Yn´4 ¨ ¨ ¨ ¨ ¨ ¨ Y3 Y2 Y1 λn´3ϕpZn´5q . . . λn´3ϕpZn´j q . . . λn´3ϕpZ1q [PITH_FULL_IMAGE:figures/full_fig_p011_2.png] view at source ↗

**Figure 3.** Figure 3: The staircase line for j “ n ´ 3 11 [PITH_FULL_IMAGE:figures/full_fig_p011_3.png] view at source ↗

**Figure 4.** Figure 4: The example for n “ 8 and n “ 6 Proof. We prove by induction on n, the result is clear if n ď 4. Assume n ą 4 and x P λlϕpZiq for 1 ď l ď n ´ 4. We prove that there does not exist a path with all bidirected edges from νipxq to νkpxq. (1) If sxs P λlϕpZiq, then by Proposition 5.3 we have the path diagram: νkpxq νk´1pxq νkpsxsq νk´1psxsq x. sxs ¨ ¨ ¨ ¨ ¨ ¨ The lines without arrow means we don’t care about wh… view at source ↗

read the original abstract

$W$-graphs, representing the multiplication action of the standard basis on the canonical basis in the Iwahori-Hecke algebra are introduced by Kazhdan and Lusztig. Marberg defined a generalized $W$-graph, the Gelfand W-graph, corresponding to the Hecke algebra modules instead of Hecke algebras. To classify the molecules and cells of the Gelfand $S_n$-graphs, in this paper, we introduce a recursive structure of $S_n$ and then discuss the action of the recursive structure on the molecules. Using this struction, we show that a specific molecule is indeed a cell.

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

The paper defines a recursive structure on S_n and uses it to show one specific molecule is a cell in the Gelfand S_n-graph.

read the letter

The key point is that the authors introduce a recursive structure on S_n and apply it to the molecules of the Gelfand S_n-graph, concluding that one chosen molecule is in fact a cell. They build directly on the W-graph setup from Kazhdan-Lusztig and the Gelfand generalization from Marberg, adding this recursion as a way to track how molecules behave under the structure. The concrete example they work through gives a clear illustration of the method, which is the main new piece here. That kind of explicit construction can be helpful for people trying to classify cells in these graphs, even if it stays within the S_n case for now. The paper appears self-contained once the definitions are in place, and the abstract frames the recursion as newly introduced rather than pulled from earlier citations. On the soft side, the central step is showing that the recursive map respects the multiplication action that defines the Gelfand graph and preserves the equivalence relation for cells. The abstract says they discuss the action and reach the cell conclusion, but without the full details it is not possible to see exactly how they handle the compatibility. If that part is handled cleanly in the manuscript, the example stands; if it is only sketched, then the result is more limited than it first appears. Minor gaps in exposition would be easy to fix in revision. This is for readers already working in combinatorial representation theory who know the basics of W-graphs and want a new handle on molecules and cells for symmetric groups. Someone in that niche would get practical value from the construction and the worked example. It is worth sending to peer review so that referees can check the technical interface between the recursion and the graph action.

Referee Report

1 major / 1 minor

Summary. The paper introduces a recursive structure on the symmetric group S_n and applies it to the molecules of the Gelfand S_n-graph (a generalized W-graph arising from Hecke algebra modules). It discusses the action of this recursive structure on molecules and concludes that a specific chosen molecule is in fact a cell.

Significance. If the recursive construction is shown to commute appropriately with the generators of the Hecke-module action and to preserve the equivalence relation that defines cells, the method could supply a concrete tool for identifying cells in Gelfand S_n-graphs, which are tied to the representation theory of Iwahori-Hecke algebras. The explicit verification for one molecule would constitute a modest but useful step toward classification.

major comments (1)

[Main construction and action discussion (section following the definition of the recursive structure)] The load-bearing step is the claim that the recursive map on S_n preserves the cell equivalence relation under the multiplication action. The abstract states that the structure is used to show a specific molecule is a cell, but no explicit verification is supplied that the recursion commutes with the Hecke-algebra generators or that it maps cell-equivalent elements to cell-equivalent elements while preserving support of the multiplication operators. This compatibility must be established before the example can be regarded as evidence for the general classification claim.

minor comments (1)

[Abstract] The abstract contains the typographical error 'struction' for 'structure'.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their detailed reading of the manuscript and for highlighting the need for explicit verification of key compatibility properties. We address the major comment below and will revise the paper to strengthen the presentation.

read point-by-point responses

Referee: [Main construction and action discussion (section following the definition of the recursive structure)] The load-bearing step is the claim that the recursive map on S_n preserves the cell equivalence relation under the multiplication action. The abstract states that the structure is used to show a specific molecule is a cell, but no explicit verification is supplied that the recursion commutes with the Hecke-algebra generators or that it maps cell-equivalent elements to cell-equivalent elements while preserving support of the multiplication operators. This compatibility must be established before the example can be regarded as evidence for the general classification claim.

Authors: We agree that an explicit general verification of compatibility is required to support the broader classification claim. The current manuscript introduces the recursive structure on S_n, describes its action on molecules of the Gelfand S_n-graph, and applies the construction to establish that one chosen molecule is in fact a cell. However, the general statement that the recursive map preserves the cell equivalence relation (and commutes with the Hecke-module generators while respecting supports) is not proved in full detail. In the revised version we will add a dedicated subsection immediately after the definition of the recursive structure that proves the required commutation relations with the Hecke generators and shows that cell-equivalent elements are mapped to cell-equivalent elements. This will make the argument for the specific molecule a concrete instance of the general compatibility rather than a standalone verification. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation relies on newly introduced recursive structure

full rationale

The paper introduces a recursive structure of S_n as an original construction, then applies it to discuss the action on molecules of the Gelfand S_n-graph and concludes that a specific molecule is a cell. The abstract frames this recursive structure as newly introduced for the purpose of classification, with no indication that the cell property or the compatibility with the multiplication action is presupposed by definition or reduced to a prior self-citation. Without any quoted equations or steps in the provided text that equate the output directly to fitted inputs or self-referential assumptions, the central claim does not reduce by construction to its own inputs. The argument is therefore self-contained once the definitions of the recursive structure and the Gelfand graph are given.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on the newly introduced recursive structure of S_n and its compatibility with the Gelfand-graph action; no free parameters or invented entities are visible in the abstract.

axioms (1)

domain assumption The recursive structure of S_n is well-defined and its action on molecules preserves the necessary combinatorial properties to identify cells.
Invoked when the paper discusses the action of the recursive structure on molecules and concludes a specific molecule is a cell.

pith-pipeline@v0.9.0 · 5628 in / 1189 out tokens · 52540 ms · 2026-05-20T09:52:57.901179+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/ArithmeticFromLogic.lean LogicNat recovery and orbit embedding unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

we introduce a recursive structure of S_n and then discuss the action of the recursive structure on the molecules. Using this struction, we show that a specific molecule is indeed a cell.
IndisputableMonolith/Foundation/AlexanderDuality.lean SphereAdmitsCircleLinking D ↔ D = 3 unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Define σ_i := s_i s_{i-1} ⋯ s_2 s_1 … Y_i = σ_i Y_1 σ_i^{-1}

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

18 extracted references · 18 canonical work pages · 1 internal anchor

[1]

Bj¨ orner A and Brenti F,Combinatorics of Coxeter groups, Springer, New York, 2005

work page 2005
[2]

J. S. Beissinger, Similar constructions for Young tableaux and involutions, and their application to shiftable tableaux,Discrete Math.67(1987), 149–163

work page 1987
[3]

Bj¨ orner and F

A. Bj¨ orner and F. Brenti,Combinatorics of Coxeter groups, Graduate Texts in Maths. 231. Springer, New York, 2005

work page 2005
[4]

Du, IC Bases and Quantum Linear Groups,Proc

J. Du, IC Bases and Quantum Linear Groups,Proc. Sympos. Pure Math.56(1994), 135–148

work page 1994
[5]

Elias and G

B. Elias and G. Williamson, The Hodge theory of Soergel bimodules,Ann. Math.180(2014), no. 3, 1089–1136

work page 2014
[6]

J. E. Humphreys,Reflection groups and Coxeter groups, Cambridge University Press, Cam- bridge, 1990

work page 1990
[7]

Kazhdan and G

D. Kazhdan and G. Lusztig, Representations of Coxeter groups and Hecke algebras,Invent. Math.53(1979), 165–184

work page 1979
[8]

Lusztig,Hecke algebras with unequal parameters, CRM Monograph Ser

G. Lusztig,Hecke algebras with unequal parameters, CRM Monograph Ser. 18, Amer. Math. Soc., 2003. 21

work page 2003
[9]

Marberg, Bar operators for quasiparabolic conjugacy classes in a Coxeter group,J

E. Marberg, Bar operators for quasiparabolic conjugacy classes in a Coxeter group,J. Algebra 453(2016), 325–363

work page 2016
[10]

Marberg and B

E. Marberg and B. Pawlowski, Gr¨ obner geometry for skew-symmetric matrix Schubert vari- eties,Adv. Math.405(2022), 108–488

work page 2022
[11]

Marberg and Y

E. Marberg and Y. Zhang, GelfandW-graphs for classical Weyl groups,J. Algebra609(2022), 292–336

work page 2022
[12]

Marberg and Y

E. Marberg and Y. Zhang, Perfect models for finite Coxeter groups,J. Pure Appl. Algebra 227(2023), 107303

work page 2023
[13]

Marberg and Y

E. Marberg and Y. Zhang, Insertion algorithms for GelfandS n-graphs,Ann. Comb.28(2024), 1199–1242

work page 2024
[14]

V. M. Nguyen, TypeAadmissible cells are Kazhdan–Lusztig,Algebraic Combinatorics3 (2020) no. 1, 55–105

work page 2020
[15]

E. M. Rains and M. J. Vazirani, Deformations of permutation representations of Coxeter groups,J. Algebr. Comb.37(2013), 455–502

work page 2013
[16]

J. R. Stembridge, AdmissibleW-graphs,Represent. Theory,12(2008) 346–368

work page 2008
[17]

J. R. Stembridge, AdmissibleW-graphs and commuting Cartan matrices,Adv. in Appl. Math., 44(2010) 203–224

work page 2010
[18]

Cell Classification of Gelfand $S_n$-Graphs

Y. Zhang, Cell Classification of GelfandS n-graphs, preprint (2025),arXiv:2503.21215. 22

work page internal anchor Pith review Pith/arXiv arXiv 2025

[1] [1]

Bj¨ orner A and Brenti F,Combinatorics of Coxeter groups, Springer, New York, 2005

work page 2005

[2] [2]

J. S. Beissinger, Similar constructions for Young tableaux and involutions, and their application to shiftable tableaux,Discrete Math.67(1987), 149–163

work page 1987

[3] [3]

Bj¨ orner and F

A. Bj¨ orner and F. Brenti,Combinatorics of Coxeter groups, Graduate Texts in Maths. 231. Springer, New York, 2005

work page 2005

[4] [4]

Du, IC Bases and Quantum Linear Groups,Proc

J. Du, IC Bases and Quantum Linear Groups,Proc. Sympos. Pure Math.56(1994), 135–148

work page 1994

[5] [5]

Elias and G

B. Elias and G. Williamson, The Hodge theory of Soergel bimodules,Ann. Math.180(2014), no. 3, 1089–1136

work page 2014

[6] [6]

J. E. Humphreys,Reflection groups and Coxeter groups, Cambridge University Press, Cam- bridge, 1990

work page 1990

[7] [7]

Kazhdan and G

D. Kazhdan and G. Lusztig, Representations of Coxeter groups and Hecke algebras,Invent. Math.53(1979), 165–184

work page 1979

[8] [8]

Lusztig,Hecke algebras with unequal parameters, CRM Monograph Ser

G. Lusztig,Hecke algebras with unequal parameters, CRM Monograph Ser. 18, Amer. Math. Soc., 2003. 21

work page 2003

[9] [9]

Marberg, Bar operators for quasiparabolic conjugacy classes in a Coxeter group,J

E. Marberg, Bar operators for quasiparabolic conjugacy classes in a Coxeter group,J. Algebra 453(2016), 325–363

work page 2016

[10] [10]

Marberg and B

E. Marberg and B. Pawlowski, Gr¨ obner geometry for skew-symmetric matrix Schubert vari- eties,Adv. Math.405(2022), 108–488

work page 2022

[11] [11]

Marberg and Y

E. Marberg and Y. Zhang, GelfandW-graphs for classical Weyl groups,J. Algebra609(2022), 292–336

work page 2022

[12] [12]

Marberg and Y

E. Marberg and Y. Zhang, Perfect models for finite Coxeter groups,J. Pure Appl. Algebra 227(2023), 107303

work page 2023

[13] [13]

Marberg and Y

E. Marberg and Y. Zhang, Insertion algorithms for GelfandS n-graphs,Ann. Comb.28(2024), 1199–1242

work page 2024

[14] [14]

V. M. Nguyen, TypeAadmissible cells are Kazhdan–Lusztig,Algebraic Combinatorics3 (2020) no. 1, 55–105

work page 2020

[15] [15]

E. M. Rains and M. J. Vazirani, Deformations of permutation representations of Coxeter groups,J. Algebr. Comb.37(2013), 455–502

work page 2013

[16] [16]

J. R. Stembridge, AdmissibleW-graphs,Represent. Theory,12(2008) 346–368

work page 2008

[17] [17]

J. R. Stembridge, AdmissibleW-graphs and commuting Cartan matrices,Adv. in Appl. Math., 44(2010) 203–224

work page 2010

[18] [18]

Cell Classification of Gelfand $S_n$-Graphs

Y. Zhang, Cell Classification of GelfandS n-graphs, preprint (2025),arXiv:2503.21215. 22

work page internal anchor Pith review Pith/arXiv arXiv 2025