The gate set is a Garside shadow
The gate set is a Garside shadow
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.
Sources & referencesView supporting material
Primary source
James Parkinson and Yeeka Yau, “Cone Types, Automata, and Regular Partitions in Coxeter Groups”, arXiv:2107.09962 (2021).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.