Non-crossing partitions for classical reflection groups
نویسنده
چکیده
We introduce analogues of the lattice of non-crossing set partitions for the classical reeection groups of type B and D. The type B analogues ((rst considered by Montenegro in a diierent guise) turn out to be as well-behaved as the original non-crossing set partitions, and the type D analogues almost as well-behaved. In both cases, they are EL-labellable ranked lattices with symmetric chain decompo-sitions (self-dual for type B), whose rank-generating functions, zeta polynomials, rank-selected chain numbers have simple closed forms.
منابع مشابه
Cyclic Sieving for Generalised Non–Crossing Partitions Associated to Complex Reflection Groups of Exceptional Type
We present the proof of the cyclic sieving conjectures for generalised non-crossing partitions associated to well-generated complex reflection groups due to Armstrong, respectively to Bessis and Reiner, for the 26 exceptional well-generated complex reflection groups. The computational details are provided in the manuscript “Cyclic sieving for generalised non-crossing partitions associated to co...
متن کاملNon-crossing Partitions, Non-nesting Partitions and Coxeter Sortable Elements in Types a and B
First, we investigate a generalization of the area statistic on Dyck paths for all crystallographic reflection groups. In particular, we explore Dyck paths of type B together with an area statistic and a major index. Then, we construct bijections between non-nesting and reverse non-crossing partitions for types A and B. These bijections simultaneously send the area statistic and the major index...
متن کاملA bijection between noncrossing and nonnesting partitions for classical reflection groups
We present an elementary type preserving bijection between noncrossing and nonnesting partitions for all classical reflection groups, answering a question of Athanasiadis.
متن کاملCrossings and Nestings in Set Partitions of Classical Types
We study bijections { Set partitions of type X } −̃→ { Set partitions of type X } for X ∈ {A,B,C,D}, which preserve openers and closers. In types A, B, and C, they interchange • either the number of crossings and of nestings, • or the cardinalities of a maximal crossing and of a maximal nesting. In type D, the results are obtained only in the case of non-crossing and nonnesting set partitions. I...
متن کاملBijections between noncrossing and nonnesting partitions for classical reflection groups
We present type preserving bijections between noncrossing and nonnesting partitions for all classical reflection groups, answering a question of Athanasiadis and Reiner. The bijections for the abstract Coxeter types B, C and D are new in the literature. To find them we define, for every type, sets of statistics that are in bijection with noncrossing and nonnesting partitions, and this correspon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 177 شماره
صفحات -
تاریخ انتشار 1997