English

Generalized non-crossing Partitions and Buildings

Combinatorics 2018-05-24 v3 Group Theory

Abstract

For any finite Coxeter group WW of rank nn we show that the order complex of the lattice of non-crossing partitions NC(W)\mathrm{NC}(W) embeds as a connected chamber subcomplex into a spherical building of type An1A_{n-1}. We use this to give a new proof of the fact that the non-crossing partition lattice in type AnA_n is supersolvable for all nn and show that in case BnB_n, this is only the case if n<4n<4. We also obtain a lower bound on the radius of the Hurwitz graph H(W)H(W) in all types and re-prove that in type AnA_n the radius is (n2){n \choose 2}.

Keywords

Cite

@article{arxiv.1706.00529,
  title  = {Generalized non-crossing Partitions and Buildings},
  author = {Julia Heller and Petra Schwer},
  journal= {arXiv preprint arXiv:1706.00529},
  year   = {2018}
}

Comments

minor corrections, 28 pages, 12 figures; keywords: Generalized non-crossing partitions, buildings, Hurwitz graph, supersolvability

R2 v1 2026-06-22T20:07:04.615Z