Elias's acyclicity and unique extrema conjecture for affine reduced-word graphs
For an affine permutation , let be the directed graph whose vertices are commutation classes of reduced words for , with edges oriented by the braid relations , where indices are taken modulo . Elias's conjecture. For any , the directed graph is acyclic with a unique source vertex and a unique sink vertex. This conjecture concerns the global structure of directed braid-move graphs for affine permutations; the supplied text does not state whether it has been resolved.
References
- Sara Billey, Herman Chau and Kevin Liu, “Commutation classes of reduced words and higher Bruhat orders for affine permutations”, arXiv:2604.24573 (2026).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.