A pair of Garside shadows (Q6662823)

Regular partitions are essentially equivalent to automata recognising the language of reduced words \(\mathcal{L}(W,S)\) of a Coxeter system \((W,S)\): for each regular partition \(\mathcal{R}\) of \(W\), there exists an explicitly defined automaton recognising \(\mathcal{L}(W,S)\) with states being the parts of \(\mathcal{R}\). Moreover, every automaton recognising \(\mathcal{L}(W,S)\) arises in this way from a regular partition (see [\textit{J. Parkinson} and the second author, Adv. Math. 398, Article ID 108146, 66 p. (2022; Zbl 1515.20201)]). The Shi partition and the cone type partition are examples of regular partitions. The parts of the Shi partition are the connected components of the well-known generalised Shi arrangement, the cone type partition gives rise to the smallest automaton recognising \(\mathcal{L}(W,S)\). The authors show that each part of the Shi partition and the cone type partition contains a smallest element. Moreover, these smallest elements form Garside shadows. This results resolves a conjecture of [loc. cit.] as well as a conjecture of \textit{C. Hohlweg} et al. [J. Algebra 457, 431--456 (2016; Zbl 1346.20053)].