arXiv · 2410.22599
Combinatorics of cone types in Coxeter groups
Abstract
In this article, we establish some new combinatorial properties of cone types in Coxeter groups. Firstly, we show that for any element $x$ in a Coxeter group $W$ and root $\beta$ in its inversion set $\Phi(x)$, the set of elements $y \in W$ satisfying $\Phi(x) \cap \Phi(y) = \{ \beta \}$ is convex in the weak order and admits a unique minimal representative. This is strongly connected to determining the cone type of elements of $W$ and leads to efficient computational methods to determine whether arbitrary elements of $W$ have the same cone type.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Yeeka Yau. 2024-10-29. Combinatorics of cone types in Coxeter groups. https://arxiv.org/abs/2410.22599
Cite the original work for its findings. Save a collection to share your selection of sources.