The sorting-alternating quotient conjecture for subword complexes
The sorting-alternating quotient conjecture for subword complexes
Let be a word and let be an element of a Coxeter group. For the non-empty subword complex , let be the corresponding weak-order interval and let be the subword complex equivalence. The word is sorting when it contains a reduced expression for the longest element , and it is alternating when every pair of non-commuting generators alternates within . Sorting-alternating quotient conjecture. If is sorting and alternating, then the Hasse diagram of the lattice quotient is isomorphic to the graph of extremal increasing flips between acyclic facets of . In the sorting case all acyclic facets are strongly acyclic, so this specializes the alternating-word quotient conjecture; the source gives no resolution status.
Sources & referencesView supporting material
Primary source
Nantel Bergeron, Noémie Cartier, Cesar Ceballos and Vincent Pilaud, “Lattices of acyclic pipe dreams”, arXiv:2303.11025 (2025).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.