Recurrences for 2-colored and 3-colored F-partitions
نویسنده
چکیده
The goal of this paper is to prove new recurrences involving 2–colored and 3–colored generalized Frobenius partitions of n similar to the classical recurrence for the partition function p(n). Section
منابع مشابه
ar X iv : m at h / 06 10 98 4 v 1 [ m at h . C O ] 3 1 O ct 2 00 6 COLORED POSETS AND COLORED QUASISYMMETRIC FUNCTIONS
The colored quasisymmetric functions, like the classic quasisymmetric functions, are known to form a Hopf algebra with a natural peak subalgebra. We show how these algebras arise as the image of the algebra of colored posets. To effect this approach we introduce colored analogs of P -partitions and enriched P -partitions. We also frame our results in terms of Aguiar, Bergeron, and Sottile’s the...
متن کاملCrossings and Nestings in Colored Set Partitions
Chen, Deng, Du, Stanley, and Yan introduced the notion of k-crossings and k-nestings for set partitions, and proved that the sizes of the largest k-crossings and k-nestings in the partitions of an n-set possess a symmetric joint distribution. This work considers a generalization of these results to set partitions whose arcs are labeled by an r-element set (which we call r-colored set partitions...
متن کاملAvoiding Colored Partitions of Lengths Two and Three
Pattern avoidance in the symmetric group Sn has provided a number of useful connections between seemingly unrelated problems from stack-sorting to Schubert varieties. Recent work [3, 9, 10, 11] has generalized these results to Sn o Cc, the objects of which can be viewed as “colored permutations”. Another body of research that has grown from the study of pattern avoidance in permutations is patt...
متن کاملA simple proof of some congruences for colored generalized frobenius partitions
where c#,Jr) is the number of F-partitions of r using h colors with (at most) s repetitions where s can be any positive integer or 00 (to represent no restriction on repetitions). The proofs of these congruences were based on some interesting congruence properties of compositions and were combinatorial in nature. Though the proofs were straightforward, they were somewhat lengthy and tedious. Du...
متن کاملOn the Number of Colored Birch and Tverberg Partitions
In 2009, Blagojević, Matschke & Ziegler established the first tight colored Tverberg theorem. We develop a colored version of our previous results (2008): Evenness and non-trivial lower bounds for the number of colored Tverberg partitions. Both properties follow from similar results on the number of colored Birch partitions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 156 شماره
صفحات -
تاریخ انتشار 1996