English

Noncrossing partitions and Bruhat order

Combinatorics 2015-03-04 v2 Group Theory

Abstract

We give a criterion for Bruhat order on noncrossing partitions corresponding to the Coxeter element c=s1s2snc=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 cc. In particular we get bijections between noncrossing partitions associated to distinct Coxeter elements, which fix the set of reflections.

Keywords

Cite

@article{arxiv.1405.1408,
  title  = {Noncrossing partitions and Bruhat order},
  author = {Thomas Gobet},
  journal= {arXiv preprint arXiv:1405.1408},
  year   = {2015}
}

Comments

This paper has been withdrawn by the author since it gave rise to a joint work with Nathan Williams, see http://arxiv.org/abs/1503.00595

R2 v1 2026-06-22T04:07:36.330Z