On crystal operators in Lusztig's parametrizations and string cone defining inequalities
Shmuel Zelikson

TL;DR
This paper compares Lusztig's and Kashiwara's parametrizations of the canonical basis for type A quivers, revealing how crystal operators define inequalities of the string cone via combinatorics of Auslander-Reiten quivers.
Contribution
It establishes that Lusztig's parametrization patterns correspond to the defining inequalities of the string cone, providing a combinatorial approach using Auslander-Reiten quivers.
Findings
Crystal operators act in finitely many patterns in Lusztig's parametrization.
The set of patterns corresponds to the inequalities of the string cone.
Provides an alternative enumeration of the string cone inequalities using hammocks.
Abstract
Let be a reduced expression for the longest element of the Weyl group, adapted to a quiver of type . We compare Lusztig's and Kashiwara's (string) parametrizations of the canonical basis associated with . Crystal operators act in a finite number of patterns in Lusztig's parametrization, which may be seen as vectors. We show this set gives the system of defining inequalities of the string cone constructed by Gleizer and Postnikov. We use combinatorics of Auslander-Reiten quivers, and as a by-product we get an alternative enumeration of a set of inequalities defining the string cone, based on hammocks.
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.
