Recurrences for 2-colored and 3-colored F-partitions
نویسندگان
چکیده
منابع مشابه
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
متن کاملComputational Proofs of Congruences for 2-colored Frobenius Partitions
1. Background and introduction. In his 1984 Memoir of the American Mathematical Society, Andrews [2] introduced two families of partition functions, φk(m) and cφk(m), which he called generalized Frobenius partition functions. In this paper, we will focus our attention on one of these functions, namely cφ2(m), which denotes the number of generalized Frobenius partitions of m with 2 colors. In [2...
متن کاملLabeled partitions with colored permutations
In this paper, we extend the notion of labeled partitions with ordinary permutations to colored permutations in the sense that the colors are endowed with a cyclic structure. We use labeled partitions with colored permutations to derive the generating function of the fmajk indices of colored permutations. The second result is a combinatorial treatment of a relation on the q-derangement numbers ...
متن کامل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...
متن کاملBalanced partitions of 3-colored geometric sets in the plane
Let S be a finite set of geometric objects partitioned into classes or colors. A subset S′ ⊆ S is said to be balanced if S′ contains the same amount of elements of S from each of the colors. We study several problems on partitioning 3colored sets of points and lines in the plane into two balanced subsets: (a) We prove that for every 3-colored arrangement of lines there exists a segment that int...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1996
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00059-6