Polygon dissections and some generalizations of cluster complexes
Eleni Tzanaki

TL;DR
This paper introduces a family of simplicial complexes based on polygon dissections linked to Weyl groups, generalizing cluster complexes and revealing their combinatorial and topological properties.
Contribution
It defines the complexes elta^m_Wnd proves their shellability and Cohen-Macaulay property, extending cluster complex theory to new combinatorial structures.
Findings
Faces are enumerated using generalized Narayana numbers.
The complexes are shellable for all m 1.
Complexes are Cohen-Macaulay.
Abstract
Let be a Weyl group corresponding to the root system or . We define a simplicial complex in terms of polygon dissections for such a group and any positive integer . For , is isomorphic to the cluster complex corresponding to , defined in \cite{FZ}. We enumerate the faces of and show that the entries of its -vector are given by the generalized Narayana numbers , defined in \cite{Atha3}. We also prove that for any the complex is shellable and hence Cohen-Macaulay.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Topological and Geometric Data Analysis · Algebraic structures and combinatorial models
