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

10Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We give an elementary, case-free, Coxeter-theoretic derivation of the formula hnn!/|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.

Cite

CITATION STYLE

APA

Chapuy, G., & Douvropoulos, T. (2022). Counting chains in the noncrossing partition lattice via the W-Laplacian. Journal of Algebra, 602, 381–404. https://doi.org/10.1016/j.jalgebra.2022.02.023

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free