Simply laced Bruhat preclosure closure conjecture
Statement
Let be a Coxeter group of type , , or , let be its set of reflections, and let . Write for the Bruhat preclosure of .
Simply laced Bruhat preclosure conjecture. The Bruhat preclosure is idempotent:
The conjecture is motivated by computational evidence in types and and by the failure of the closure property in types and . The paper proves that the preclosure is a closure in type , but the stated claim for all types , , and remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.