Odd Partitions in Young ’ S Lattice
نویسنده
چکیده
We show that the subgraph induced in Young’s graph by the set of partitions with an odd number of standard Young tableaux is a binary tree. This tree exhibits self-similarities at all scales, and has a simple recursive description.
منابع مشابه
The Andrews-Olsson identity and Bessenrodt insertion algorithm on Young walls
We extend the Andrews-Olsson identity to two-colored partitions. Regarding the sets of proper Young walls of quantum affine algebras gn = A (2) 2n , A (2) 2n−1, B (1) n , D (1) n and D (2) n+1 as the sets of two-colored partitions, the extended Andrews-Olsson identity implies that the generating functions of the sets of reduced Young walls have very simple formulae: ∏ ∞ i=1(1 + t )i where κi = ...
متن کاملBalanced Partitions
A famous theorem of Euler asserts that there are as many partitions of n into distinct parts as there are partitions into odd parts. We begin by establishing a less well-known companion result, which states that both of these quantities are equal to the number of partitions of n into even parts along with exactly one triangular part. We then introduce the characteristic of a partition, which is...
متن کاملTableaux on k+1-cores, reduced words for affine permutations, and k-Schur expansions
The k-Young lattice Y k is a partial order on partitions with no part larger than k. This weak subposet of the Young lattice originated [9] from the study of the k-Schur functions s (k) λ , symmetric functions that form a natural basis of the space spanned by homogeneous functions indexed by k-bounded partitions. The chains in the k-Young lattice are induced by a Pieri-type rule experimentally ...
متن کاملCollege of Arts and Sciences Tableaux on K + 1-cores, Reduced Words for Affine Permutations, and K-schur Expansions
The following item is made available as a courtesy to scholars by the author(s) and Drexel University Library and may contain materials and content, including computer code and tags, artwork, text, graphics, images, and illustrations (Material) which may be protected by copyright law. Unless otherwise noted, the Material is made available for non profit and educational purposes, such as researc...
متن کاملSkew Tableaux, Lattice Paths, and Bounded Partitions
We establish a one to one correspondence between a set of certain bounded partitions and a set of two-rowed standard Young tableaux of skew shape. Then we obtain a formula for a number which enumerates these partitions. We give two proofs for this formula, one by applying the above correspondence, the other by using the reflection principle. Finally, we give another expression for this number i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016