Noncrossing partitions and Bruhat order
Abstract
We give a criterion for Bruhat order on noncrossing partitions corresponding to the Coxeter element c=s1 s2·s sn. Using it we prove that the Bruhat order endows noncrossing partitions with a lattice structure. We then explain what happens if we change the Coxeter element; in that case the lattice property fails and we explain which order to consider to get the same lattice structure as for the Coxeter element c. In particular we get bijections between noncrossing partitions associated to distinct Coxeter elements, which fix the set of reflections.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.