Molecules of an affine FPF W-graph and a labelled row-Beissinger reconstruction
Yifeng Zhang
Abstract
Kazhdan--Lusztig W-graphs encode the cell structure of Hecke algebras, while their bidirected connected components are called molecules. In finite type~A, the Robinson--Schensted correspondence describes cells and molecules, and Beissinger's row insertion constructs the common tableau associated with an involution. In affine type~A, the affine matrix-ball construction (AMBC) assigns an affine permutation a pair of tabloids together with a dominant weight, and Marberg introduced affine fixed-point-free (FPF) W-graphs indexed by affine FPF involutions. We classify and enumerate the molecules of Marberg's -type affine FPF W-graph Γn and show that molecules with the same AMBC shape have isomorphic underlying simple bidirected graphs. We also prove that labelled complete-cycle row-Beissinger truncations recover the full AMBC datum of an affine FPF involution.
Create a lesson
Related papers
Simple Cayley permutations
Giulio Cerbai, Anders Claesson
Transfer of difference structures: a new semidirect product framework
Sophie Huczynska, Struan McCartney, Carys Williams
Connected Mutual-Visibility in Graphs
Tonny K B, Shikhi M
Decomposing Gorenstein polytopes of large index
Johannes Knupfer, Benjamin Nill
A non-trivial bound for 3AP-intersecting families
Peter Keevash
Solution to a conjecture on integral uniform hypercycles
Joyentanuj Das, Iswar Mahato