Dyer's Bruhat-preclosure conjecture for joins in finite Coxeter groups

From papers

Let WW be a finite Coxeter group, and let u,vWu,v\in W. For wWw\in W, write TL(w)T_L(w) for its left-reflection set. Given ATA\subseteq T, define its Bruhat preclosure by

A={tTthere is an A-Bruhat path from e to t}.\overline{A}=\{t\in T\mid\text{there is an $A$-Bruhat path from }e\text{ to }t\}.

Here an AA-Bruhat path is a directed path in the Bruhat graph from the identity element ee, with every edge labeled by an element of AA. Dyer's Bruhat-preclosure conjecture. For all u,vWu,v\in W,

TL(uRv)=TL(u)TL(v).T_L(u\vee_R v)=\overline{T_L(u)\cup T_L(v)}.

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 II and AA and verification in types F4F_4, H3H_3, and H4H_4, while the type BB case motivates the paper.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

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).

Solutions 0

No solutions have been posted yet.