Cell Classification of Gelfand $S_n$-Graphs
Yifeng Zhang
TL;DR
The paper addresses the classification of cells for Gelfand $S_n$-graphs arising from the Iwahori–Hecke algebra by introducing RS-like insertions. It constructs two RS-like frameworks, row Beissinger insertions for $\\Gamma^{\mathsf{row}}$ and column Beissinger insertions for $\\Gamma^{\mathsf{col}}$, and proves that every molecule in these graphs coincides with a cell. This result completes the cell classification for type $A$ Gelfand $S_n$-graphs and solidifies the connection between canonical-basis actions, insertion combinatorics, and the cell/molecule structure of $W$-graphs. The work leverages the quasiparabolic setup, dual module constructions, and canonical bases to derive explicit edge-structures and dominance relations that underpin the cell conjecture proofs. The findings have significance for understanding the representation-theoretic filtration induced by $W$-graphs and for combinatorial models of Hecke-algebra actions in type $A$.
Abstract
Kazhdan and Lusztig introduced the $W$-graphs, which represent the multiplication action of the standard basis on the canonical bais in the Iwahori-Hecke algebra. In the Hecke algebra module, Marberg defined two generalied $W$-graphs, called the Gelfand $W$-graphs. The classification of the molecules of the type $A$ Gelfand $S_n$-graphs are determined by two RSK-like insertion algorithms. We finish the classification of cells by proving that every molecule in the $S_n$-graphs is indeed a cell.
