2000 character limit reached
Noncrossing partitions, Bruhat order and the cluster complex (1801.06078v2)
Published 18 Jan 2018 in math.CO
Abstract: We introduce two order relations on finite Coxeter groups which refine the absolute and the Bruhat order, and establish some of their main properties. In particular we study the restriction of these orders to noncrossing partitions and show that the intervals for these orders can be enumerated in terms of the cluster complex. The properties of our orders permit to revisit several results in Coxeter combinatorics, such as the Chapoton triangles and how they are related, the enumeration of reflections with full support, the bijections between clusters and noncrossing partitions.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.