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 β in its inversion set (x), the set of elements y ∈ W satisfying (x) (y) = \ β \ 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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…