Subwords and Plane Partitions

نویسندگان

  • Zachary Hamaker
  • Nathan Williams
چکیده

Using the powerful machinery available for reduced words of type B, we demonstrate a bijection between centrally symmetric k-triangulations of a 2(n + k)-gon and plane partitions of height at most k in a square of size n. This bijection can be viewed as the type B analogue of a bijection for k-triangulations due to L. Serrano and C. Stump. Résumé. En utilisant la machinerie puissante pour mots réduits de type B, nous démontrons une bijection entre les k-triangulations centralement symétriques d’un 2(n+ k)-gon et les partitions de plans d’hauteur inférieure ou égale à k dans un carré de taille n. Cette bijection peut être considérée comme l’analogue de type B d’une bijection de k-triangulations due à L. Serrano et C. Stump.

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

ثبت نام

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

منابع مشابه

Counting subwords in flattened permutations

In this paper, we consider the number of occurrences of descents, ascents, 123-subwords, 321-subwords, peaks and valleys in flattened permutations, which were recently introduced by Callan in his study of finite set partitions. For descents and ascents, we make use of the kernel method and obtain an explicit formula (in terms of Eulerian polynomials) for the distribution on Sn in the flattened ...

متن کامل

Self-complementary Plane Partitions by Proctor's Minuscule Method

A method of Proctor [4] realizes the set of arbitrary plane partitions in a box and the set of symmetric plane partitions as bases of linear representations of Lie groups. We extend this method by realizing transposition and complementation of plane partitions as natural linear transformations of the representations, thereby enumerating symmetric plane partitions, self-complementary plane parti...

متن کامل

Plane Partitions

Throughout our study of the enumeration of plane partitions we make use of bijective proofs to find generating functions. In particular, we consider bounded plane partitions, symmetric plane partitions and weak reverse plane partitions. Using the combinatorial interpretations of Schur functions in relation to semistandard Young tableaux, we rely on the properties of symmetric functions. In our ...

متن کامل

Some Combinatorial Aspects of Reduced Words in Finite Coxeter Groups

We analyze the structure of reduced expressions in the Coxeter groups An, Bn and Dn. Several special classes of elements are singled out for their connections with symmetric functions or the theory of P -partitions. Membership in these special classes is characterized in a variety of ways, including forbidden patterns, forbidden subwords, and by the form of canonically chosen reduced words.

متن کامل

Counting Subwords in a Partition of a Set

A partition π of the set [n] = {1, 2, . . . , n} is a collection {B1, . . . , Bk} of nonempty disjoint subsets of [n] (called blocks) whose union equals [n]. In this paper, we find explicit formulas for the generating functions for the number of partitions of [n] containing exactly k blocks where k is fixed according to the number of occurrences of a subword pattern τ for several classes of pat...

متن کامل

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


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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2015