Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 9 Sep 2021 in math.CO and math.GR | (2109.04341v1)

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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

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

Collections

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