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], Andrews gives the generating function for cφ2(m): ∑
منابع مشابه
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...
متن کاملThe Andrews–Sellers family of partition congruences
In 1994, James Sellers conjectured an infinite family of Ramanujan type congruences for 2-colored Frobenius partitions introduced by George E. Andrews. These congruences arise modulo powers of 5. In 2002 Dennis Eichhorn and Sellers were able to settle the conjecture for powers up to 4. In this article, we prove Sellers' conjecture for all powers of 5. In addition, we discuss why the Andrews-Sel...
متن کاملCongruences for Generalized Frobenius Partitions with an Arbitrarily Large Number of Colors
In his 1984 AMS Memoir, George Andrews defined the family of k–colored generalized Frobenius partition functions. These are enumerated by cφk(n) where k ≥ 1 is the number of colors in question. In that Memoir, Andrews proved (among many other things) that, for all n ≥ 0, cφ2(5n+3) ≡ 0 (mod 5). Soon after, many authors proved congruence properties for various k–colored generalized Frobenius part...
متن کاملCombinatorial proofs of generating function identities for F-partitions
In his memoir in 1984, George E. Andrews introduces many general classes of Frobenius partitions (simply F-partitions). Especially, he focuses his interest on two general classes of F-partitions: one is F-partitions that allow up to k repetitions of an integer in any row, and the other is F-partitions whose parts are taken from k copies of the nonnegative integers. The latter are called k color...
متن کامل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
متن کامل