arXiv Analytics

Sign in

arXiv:2109.04341 [math.CO]AbstractReferencesReviewsResources

Counting chains in the noncrossing partition lattice via the W-Laplacian

Guillaume Chapuy, Theo Douvropoulos

Published 2021-09-09Version 1

We give an elementary, case-free, Coxeter-theoretic derivation of the formula $h^nn!/|W|$ for the number of maximal chains in the noncrossing partition lattice $NC(W)$ of a real reflection group $W$. Our proof proceeds by comparing the Deligne-Reading recursion with a parabolic recursion for the characteristic polynomial of the $W$-Laplacian matrix considered in our previous work. We further discuss the consequences of this formula for the geometric group theory of spherical and affine Artin groups.

Comments: 17 pages, comments very much welcome!
Categories: math.CO, math.GR
Subjects: 20F55, 05E99, 20F36
Related articles: Most relevant | Search more
arXiv:2206.05721 [math.CO] (Published 2022-06-12)
On the homology of the noncrossing partition lattice and the Milnor fibre
arXiv:1509.06942 [math.CO] (Published 2015-09-23)
Symmetric Chain Decompositions and the Strong Sperner Property for Noncrossing Partition Lattices
arXiv:math/0601687 [math.CO] (Published 2006-01-27)
Noncrossing partitions in surprising locations