Non-crossing Partitions, Non-nesting Partitions and Coxeter Sortable Elements in Types a and B

نویسنده

  • CHRISTIAN STUMP
چکیده

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 on non-nesting partitions to the length function and to the sum of the major index and the inverse major index on reverse non-crossing partitions. Finally, we construct bijections between non-nesting partitions and Coxeter sortable elements for types A and B having exactly the same properties.

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

ثبت نام

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

منابع مشابه

Clusters, Coxeter-sortable Elements and Noncrossing Partitions

We introduce Coxeter-sortable elements of a Coxeter group W. For finite W, we give bijective proofs that Coxeter-sortable elements are equinumerous with clusters and with noncrossing partitions. We characterize Coxeter-sortable elements in terms of their inversion sets and, in the classical cases, in terms of permutations.

متن کامل

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

متن کامل

Decomposition Numbers for Finite Coxeter Groups and Generalised Non-crossing Partitions

Given a finite irreducible Coxeter group W , a positive integer d, and types T1, T2, . . . , Td (in the sense of the classification of finite Coxeter groups), we compute the number of decompositions c = σ1σ2 · · ·σd of a Coxeter element c of W , such that σi is a Coxeter element in a subgroup of type Ti in W , i = 1, 2, . . . , d, and such that the factorisation is “minimal” in the sense that t...

متن کامل

Sortable Elements in Infinite Coxeter Groups

In a series of previous papers, we studied sortable elements in finite Coxeter groups, and the related Cambrian fans. We applied sortable elements and Cambrian fans to the study of cluster algebras of finite type and the noncrossing partitions associated to Artin groups of finite type. In this paper, as the first step towards expanding these applications beyond finite type, we study sortable el...

متن کامل

A bijection between noncrossing and nonnesting partitions of types A, B and C

The total number of noncrossing partitions of type Ψ is equal to the nth Catalan number 1 n+1 ( 2n n ) when Ψ = An−1, and to the corresponding binomial coefficient ( 2n n ) when Ψ = Bn or Cn. These numbers coincide with the corresponding number of nonnesting partitions. For type A, there are several bijective proofs of this equality; in particular, the intuitive map, which locally converts each...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:

دوره   شماره 

صفحات  -

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