Simply laced Bruhat preclosure closure conjecture

From papers

Let WW be a Coxeter group of type AA, DD, or EE, let TT be its set of reflections, and let ATA\subseteq T. Write A\overline{A} for the Bruhat preclosure of AA.

Simply laced Bruhat preclosure conjecture. The Bruhat preclosure is idempotent:

A=A.\overline{A}=\overline{\overline{A}}.

The conjecture is motivated by computational evidence in types BnB_n and DnD_n and by the failure of the closure property in types HH and FF. The paper proves that the preclosure is a closure in type AA, but the stated claim for all types AA, DD, and EE remains open.

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

Aram Dermenjian, “Bruhat Preclosure”, arXiv:2512.08711 (2025).

Solutions 0

No solutions have been posted yet.