Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 91 tok/s
Gemini 2.5 Pro 46 tok/s Pro
GPT-5 Medium 33 tok/s
GPT-5 High 27 tok/s Pro
GPT-4o 102 tok/s
GPT OSS 120B 465 tok/s Pro
Kimi K2 205 tok/s Pro
2000 character limit reached

Generalized non-crossing Partitions and Buildings (1706.00529v3)

Published 2 Jun 2017 in math.CO and math.GR

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.