Generalized non-crossing Partitions and Buildings
Combinatorics
2018-05-24 v3 Group Theory
Abstract
For any finite Coxeter group of rank we show that the order complex of the lattice of non-crossing partitions embeds as a connected chamber subcomplex into a spherical building of type . We use this to give a new proof of the fact that the non-crossing partition lattice in type is supersolvable for all and show that in case , this is only the case if . We also obtain a lower bound on the radius of the Hurwitz graph in all types and re-prove that in type the radius is .
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