Shellability and higher Cohen-Macaulay connectivity of generalized cluster complexes
From MaRDI portal
Abstract: Let be a finite root system of rank and let be a nonnegative integer. The generalized cluster complex was introduced by S. Fomin and N. Reading. It was conjectured by these authors that is shellable and by V. Reiner that it is -Cohen-Macaulay, in the sense of Baclawski. These statements are proved in this paper. Analogous statements are shown to hold for the positive part of . An explicit homotopy equivalence is given between and the poset of generalized noncrossing partitions, associated to the pair by D. Armstrong.
Recommendations
Cites work
- scientific article; zbMATH DE number 863503 (Why is no real title available?)
- scientific article; zbMATH DE number 2246193 (Why is no real title available?)
- Cluster algebras. I: Foundations
- Cohen-Macaulay connectivity and geometric lattices
- Combinatorics and commutative algebra
- Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra
- Faces of Generalized Cluster Complexes and Noncrossing Partitions
- Generalized noncrossing partitions and combinatorics of Coxeter groups
- Non-crossing partition lattices in finite real reflection groups
- On a refinement of the generalized Catalan numbers for Weyl groups
- On the enumeration of positive cells in generalized cluster complexes and Catalan hyperplane arrangements.
- Polygon dissections and some generalizations of cluster complexes
- Root systems and generalized associahedra
- Shellability of noncrossing partition lattices
- \(Y\)-systems and generalized associahedra
- g-elements, finite buildings and higher Cohen-Macaulay connectivity.
- h-vectors of generalized associahedra and noncrossing partitions
Cited in
(11)- The EKR property for flag pure simplicial complexes without boundary
- Decomposition numbers for finite Coxeter groups and generalised non-crossing partitions
- The generalized cluster complex: refined enumeration of faces and related parking spaces
- Some properties of the parking function poset
- Defining an m-cluster category.
- Reflection ordering on the group \(G(m,m,n)\).
- Enumerative combinatorics. Abstracts from the workshop held March 2--8, 2014.
- Faces of Generalized Cluster Complexes and Noncrossing Partitions
- Generalized cluster complexes via quiver representations.
- Shelling Coxeter-like complexes and sorting on trees
- Generalized noncrossing partitions and combinatorics of Coxeter groups
This page was built for publication: Shellability and higher Cohen-Macaulay connectivity of generalized cluster complexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1001406)