2000 character limit reached
Noncrossing partitions and Bruhat order (1405.1408v2)
Published 6 May 2014 in math.CO and math.GR
Abstract: We give a criterion for Bruhat order on noncrossing partitions corresponding to the Coxeter element $c=s_1 s_2\cdots s_n$. 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.
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.