Euler Characteristic of the Truncated Order Complex of Generalized Noncrossing Partitions
نویسندگان
چکیده
منابع مشابه
Euler Characteristic of the Truncated Order Complex of Generalized Noncrossing Partitions
Abstract. The purpose of this note is to complete the study, begun in the first author’s PhD thesis, of the topology of the poset of generalized noncrossing partitions associated to real reflection groups. In particular, we calculate the Euler characteristic of this poset with the maximal and minimal elements deleted. As we show, the result on the Euler characteristic extends to generalized non...
متن کاملNoncrossing partitions and the shard intersection order
We define a new lattice structure (W, ) on the elements of a finite Coxeter group W. This lattice, called the shard intersection order, is weaker than the weak order and has the noncrossing partition lattice NC(W ) as a sublattice. The new construction of NC(W ) yields a new proof that NC(W ) is a lattice. The shard intersection order is graded and its rank generating function is the W -Euleria...
متن کامل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...
متن کاملMöbius numbers of some modified generalized noncrossing partitions
In [2] they proved this result counting the multichains of NC(k)(W ). Moreover they considered the case of well-generated complex reflection groups and gave the same result. Our approach is independent to theirs. Our method is using the EL-labeling of NC(k)(W ) introduced by Armstrong and Thomas [1]. If we can give an EL-labeling for NC(W ) for a complex reflction group W , then we can improve ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2009
ISSN: 1077-8926
DOI: 10.37236/232