Counting chains in the noncrossing partition lattice via the W-Laplacian
Combinatorics
2022-06-27 v1 Group Theory
Abstract
We give an elementary, case-free, Coxeter-theoretic derivation of the formula for the number of maximal chains in the noncrossing partition lattice of a real reflection group . Our proof proceeds by comparing the Deligne-Reading recursion with a parabolic recursion for the characteristic polynomial of the -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.
Keywords
Cite
@article{arxiv.2109.04341,
title = {Counting chains in the noncrossing partition lattice via the W-Laplacian},
author = {Guillaume Chapuy and Theo Douvropoulos},
journal= {arXiv preprint arXiv:2109.04341},
year = {2022}
}
Comments
17 pages, comments very much welcome!