Faces of Generalized Cluster Complexes and Noncrossing Partitions

DOI10.1137/060665683MaRDI QIDQ3614192zbMATH OpenOpenAlexFDO

Authors Eleni Tzanaki

Publication date 16 March 2009

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0605785

zbMATH Keywords

cluster complexesCoxeter groupsfinite root systemsnoncrossing partitionsreflection groups

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Combinatorial aspects of simplicial complexes (05E45) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Simplicial sets and complexes in algebraic topology (55U10)

Abstract: Let $Phi$ be an finite root system with corresponding reflection group $W$ and let $m$ be a nonnegative integer. We consider the generalized cluster complex $Delt{a}^m(Phi)$ defined by S. Fomin and N. Reading and the poset $N{C}_{(m)}(W)$ of $m$-divisible noncrossing partitions defined by D. Armstrong. We give a characterization of the faces of $Delt{a}^m(Phi)$ in terms of $N{C}_{(m)}(W)$, generalizing that of T. Brady and C. Watt given in the case $m=1$. Making use of this, we give a case free proof of a conjecture of F. Chapoton and D. Armstrong, which relates a certain refined face count of $Delt{a}^m(Phi)$ with the M"obius function of $N{C}_{(m)}(W)$.

Recommendations

• scientific article; zbMATH DE number 6909258
• h-vectors of generalized associahedra and noncrossing partitions
• On some enumerative aspects of generalized associahedra
• Shellability and higher Cohen-Macaulay connectivity of generalized cluster complexes
• The \(F\)-triangle of the generalised cluster complex

Cited in

(19)

• Shellability and higher Cohen-Macaulay connectivity of generalized cluster complexes
• Enumerative properties of grid associahedra
• Counting chains in the noncrossing partition lattice via the \(W\)-Laplacian
• The rank enumeration of certain parabolic non-crossing partitions
• On the \(H\)-triangle of generalised nonnesting partitions
• Defining an m-cluster category.
• The \(M\)-triangle of generalised non-crossing partitions for the types \(E_7\) and \(E_8\).
• Möbius numbers of some modified generalized noncrossing partitions
• h-vectors of generalized associahedra and noncrossing partitions
• The \(F\)-triangle of the generalised cluster complex
• Decomposition numbers for finite Coxeter groups and generalised non-crossing partitions
• Generalized noncrossing partitions and combinatorics of Coxeter groups
• Facets of the generalized cluster complex and regions in the extended Catalan arrangement of type \(A\)
• From \(m\)-clusters to \(m\)-noncrossing partitions via exceptional sequences
• The generalized cluster complex: refined enumeration of faces and related parking spaces
• Refined lattice path enumeration and combinatorial reciprocity
• Rational noncrossing Coxeter-Catalan combinatorics
• Cataland: why the Fuß?
• On some enumerative aspects of generalized associahedra

This page was built for publication: Faces of Generalized Cluster Complexes and Noncrossing Partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3614192)