Crystal Pop-Stack Sorting and Type A Crystal Lattices
Combinatorics
2021-09-20 v1 Representation Theory
Abstract
Given a complex simple Lie algebra and a dominant weight , let be the crystal poset associated to the irreducible representation of with highest weight . In the first part of the article, we introduce the \emph{crystal pop-stack sorting operator} , 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 contains the minimal element of , which is fixed by . We prove that the maximum size of a forward orbit of is the Coxeter number of the Weyl group of . In the second part of the article, we characterize exactly when a type 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