From the weak Bruhat order to crystal posets
Patricia Hersh, Cristian Lenart

TL;DR
This paper explores how properties of the weak Bruhat order extend to crystal posets, revealing both analogies and fundamental differences, including the complexity of relations among crystal operators and the structure of intervals.
Contribution
It establishes a crystal-theoretic analogue of Coxeter move relations, analyzes Mobius functions of crystal intervals, and introduces new properties and algorithms for the key map.
Findings
Coxeter move relations hold for all lower intervals in certain crystals.
No finite move set exists for arbitrary crystal intervals, even in type A.
Mobius function values are limited to 0, 1, or -1 in specific cases, with complex relations in others.
Abstract
We investigate the ways in which fundamental properties of the weak Bruhat order on a Weyl group can be lifted (or not) to a corresponding highest weight crystal graph, viewed as a partially ordered set; the latter projects to the weak order via the key map. First, a crystal theoretic analogue of the statement that any two reduced expressions for the same Coxeter group element are related by Coxeter moves is proven for all lower intervals in a simply or doubly laced crystal. On the other hand, it is shown that no finite set of moves exists, even in type A, for arbitrary crystal graph intervals. In fact, it is shown that there are relations of arbitrarily high degree amongst crystal operators that are not implied by lower degree relations. Second, for crystals associated to Kac-Moody algebras it is shown for lower intervals that the Mobius function is always 0, 1, or -1, and in finite…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
