Faces of Generalized Cluster Complexes and Noncrossing Partitions

نویسنده

  • Eleni Tzanaki
چکیده

Let Φ be an finite root system with corresponding reflection group W and let m be a nonnegative integer. We consider the generalized cluster complex ∆(Φ) defined by S. Fomin and N. Reading and the poset NC(m)(W ) of m-divisible noncrossing partitions defined by D. Armstrong. We give a characterization of the faces of ∆(Φ) in terms of NC(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 ∆(Φ) with the Möbius function of NC(m)(W ).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coxeter-Catalan Combinatorics

In this talk we will introduce the new and active topic “CoxeterCatalan combinatorics”. We will survey three trends, namely the nonnesting partitions, noncrossing partitions and cluster complexes, leading to this topic. Some new results and unsolved problems will be given.

متن کامل

Shellability and Higher Cohen-macaulay Connectivity of Generalized Cluster Complexes

Let Φ be a finite root system of rank n and let m be a positive integer. It is proved that the generalized cluster complex ∆m(Φ), introduced by S. Fomin and N. Reading, is (m + 1)-Cohen-Macaulay, in the sense of Baclawski. This statement was conjectured by V. Reiner. More precisely, it is proved that the simplicial complex obtained from ∆m(Φ) by removing any subset of its vertex set of cardinal...

متن کامل

h-VECTORS OF GENERALIZED ASSOCIAHEDRA AND NONCROSSING PARTITIONS

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 L 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 contex...

متن کامل

Enumerative properties of generalized associahedra

Some enumerative aspects of the fans called generalized associahedra, introduced by S. Fomin and A. Zelevinsky in their theory of cluster algebras, are considered in relation with a bicomplex and its two spectral sequences. A precise enumerative relation with the lattices of generalized noncrossing partitions is conjectured and some evidence is given.

متن کامل

Clusters, Noncrossing Partitions and the Coxeter Plane Nathan Reading

The present research is a contribution to W -Catalan combinatorics, which concerns generalizations of objects counted by the Catalan number to an arbitrary finite Coxeter group W. Triangulations of a polygon are a special case of the combinatorial clusters appearing in the theory of cluster algebras of finite type. Planar diagrams analogous to triangulations encode the combinatorics of clusters...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Discrete Math.

دوره 22  شماره 

صفحات  -

تاریخ انتشار 2008