ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (W,S)(W,S) be a Coxeter system, let Γ\Gamma be the set of gates of WW, and let joins be taken in the weak order on WW. A Garside shadow conjecture. The set Γ\Gamma 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 E=Φsph+\mathcal{E}=\Phi_{\mathrm{sph}}^+, 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.