Multiranks for Partitions into Multi-Colors
نویسنده
چکیده
We generalize Hammond-Lewis birank to multiranks for partitions into colors and give combinatorial interpretations for multipartitions such as b(n) defined by H. Zhao and Z. Zhong and Qp1,p2(n) defined by Toh congruences modulo 3, 5, 7.
منابع مشابه
Rank and Crank Analogs for some Colored Partitions
We establish some rank and crank analogs for partitions into distinct colors and give combinatorial interpretations for colored partitions such as partitions defined by Toh, Zhang and Wang congruences modulo 5, 7.
متن کاملBiranks for Partitions into 2 Colors
In 2003, Hammond and Lewis defined a statistic on partitions into 2 colors which combinatorially explains certain well known partition congruences mod 5. We give two analogs of Hammond and Lewis’s birank statistic. One analog is in terms of Dyson’s rank and the second uses the 5-core crank due to Garvan, Kim and Stanton. We discuss Andrews’s bicrank statistic and how it may be extended. We also...
متن کاملPolychromatic colorings of arbitrary rectangular partitions
A general (rectangular) partition is a partition of a rectangle into an arbitrary number of non-overlapping subrectangles. This paper examines vertex colorings using four colors of general partitions where every subrectangle is required to have all four colors appear on its boundary. It is shown that there exist general partitions that do not admit such a coloring. This answers a question of Di...
متن کاملAvoiding Colored Partitions of Two Elements in the Pattern Sense
Enumeration of pattern-avoiding objects is an active area of study with connections to such disparate regions of mathematics as Schubert varieties and stack-sortable sequences. Recent research in this area has brought attention to colored permutations and colored set partitions. A colored partition of a set S is a partition of S with each element receiving a color from the set [k] = {1, 2, . . ...
متن کاملBeaded partitions with k colors
In this paper a new category of partitions called beaded partitions with k colors will be introduced. The generating functions for these partitions will be given and several properties and congruences will be presented. A beaded partition of a positive integer n is a necklace made up of strands of beads in k colors where the total number of beads in the necklace is n. Sliding the beads around t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 19 شماره
صفحات -
تاریخ انتشار 2012