Skip to content
DraconiticResearch
Search Sources API
203,203 studies31 sourcesUpdated 11 min ago
PreprintCC BY 4.0arXiv

Molecules of an affine FPF W-graph and a labelled row-Beissinger reconstruction

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 m-type affine FPF W-graph Γnm 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.

Related

  1. The Class Edge-Reconstruction Number of a Maximal Planar Graph Is One or Two
    Sergey Ivanov
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  2. A graph reconstruction problem involving common neighbors
    Michela Ascolese, Pietro Negrini, Silvia Maria Carla Pagani +1
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsarXiv
  3. Integrating multi-source local information for global undirected graph reconstruction via integer programming
    Nir Keret, Armeen Taeb, Ali Shojaie
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  4. ST-GFM: Spectral-Temporal Graph Forecasting with Measured Perturbation Bounds and Masked Spectral Reconstruction
    Aashish Bohra, Vivek Vijay
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  5. A Joint Information-Theoretic and Graph Learning Framework for Sensor Placement and Macroscopic Traffic State Reconstruction
    Ying Zhang, Fatemeh Fakhrmoosavi, Arash E. Zaghi
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
BibTeX
@misc{zhang2026molecules,
  title = {{Molecules of an affine FPF $W$-graph and a labelled row-Beissinger reconstruction}},
  author = {Yifeng Zhang},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2608.03792},
  eprint = {2608.03792},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2608.03792},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Molecules of an affine FPF W-graph and a labelled row-Beissinger reconstruction
AU  - Yifeng Zhang
PY  - 2026
DA  - 2026/09/01
PB  - arXiv
DO  - 10.48550/arxiv.2608.03792
UR  - https://arxiv.org/abs/2608.03792
AB  - 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 m-type affine FPF W-graph Γ_n^m 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.
ER  -