English

Crystal Pop-Stack Sorting and Type A Crystal Lattices

Combinatorics 2021-09-20 v1 Representation Theory

Abstract

Given a complex simple Lie algebra g\mathfrak g and a dominant weight λ\lambda, let Bλ\mathcal B_\lambda be the crystal poset associated to the irreducible representation of g\mathfrak g with highest weight λ\lambda. In the first part of the article, we introduce the \emph{crystal pop-stack sorting operator} Pop ⁣:BλBλ\mathsf{Pop}_{\lozenge}\colon\mathcal B_\lambda\to\mathcal B_\lambda, a noninvertible operator whose definition extends that of the pop-stack sorting map and the recently-introduced Coxeter pop-stack sorting operators. Every forward orbit of Pop\mathsf{Pop}_{\lozenge} contains the minimal element of Bλ\mathcal B_\lambda, which is fixed by Pop\mathsf{Pop}_{\lozenge}. We prove that the maximum size of a forward orbit of Pop\mathsf{Pop}_{\lozenge} is the Coxeter number of the Weyl group of g\mathfrak g. In the second part of the article, we characterize exactly when a type AA crystal is a lattice.

Keywords

Cite

@article{arxiv.2109.08251,
  title  = {Crystal Pop-Stack Sorting and Type A Crystal Lattices},
  author = {Colin Defant and Nathan Williams},
  journal= {arXiv preprint arXiv:2109.08251},
  year   = {2021}
}

Comments

16 pages, 4 figures

R2 v1 2026-06-24T06:03:22.537Z