Papers
Topics
Authors
Recent
Search
2000 character limit reached

Noncrossing partitions, Bruhat order and the cluster complex

Published 18 Jan 2018 in math.CO | (1801.06078v2)

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.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.