h-vectors of generalized associahedra and non-crossing partitions
Christos A. Athanasiadis, Thomas Brady, Jon McCammond, Colum Watt
Abstract
A case-free proof is given that the entries of the h-vector of the cluster complex Δ(Φ), associated by S. Fomin and A. Zelevinsky to a finite root system Φ, count elements of the lattice of noncrossing partitions of corresponding type by rank. Similar interpretations for the h-vector of the positive part of Δ(Φ) are provided. The proof utilizes the appearance of the complex Δ(Φ) in the context of the lattice , in recent work of two of the authors, as well as an explicit shelling of Δ(Φ).
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.