Dyer's Bruhat-preclosure conjecture for joins in finite Coxeter groups
Let be a finite Coxeter group, and let . For , write for its left-reflection set. Given , define its Bruhat preclosure by
Here an -Bruhat path is a directed path in the Bruhat graph from the identity element , with every edge labeled by an element of . Dyer's Bruhat-preclosure conjecture. For all ,
The conjecture gives a description of joins in the right weak order in terms of Bruhat preclosure. It is not known whether it holds for all finite Coxeter systems; the source reports proofs in types and and verification in types , , and , while the type case motivates the paper.
References
Primary source
Riccardo Biagioli and Lorenzo Perrone, “Computing Joins in the Weak Order of Type B Coxeter Groups: an Algorithmic Approach”, arXiv:2606.13154 (2026).
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
No solutions have been posted yet.