The gate set is a Garside shadow
Statement
Let be a Coxeter system, let be the set of gates of , and let joins be taken in the weak order on . A Garside shadow conjecture. The set is closed under join, and hence is a Garside shadow. This would resolve the conjecture of Hohlweg, Nadeau, and Williams that the smallest Garside shadow yields the minimal automaton. The paper proves this when , but the general statement 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.