A relationship between certain colored generalized Frobenius partitions and ordinary partitions
نویسندگان
چکیده
منابع مشابه
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...
متن کامل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...
متن کاملOverpartitions and Generating Functions for Generalized Frobenius Partitions
Generalized Frobenius partitions, or F -partitions, have recently played an important role in several combinatorial investigations of basic hypergeometric series identities. The goal of this paper is to use the framework of these investigations to interpret families of infinite products as generating functions for F -partitions. We employ q-series identities and bijective combinatorics.
متن کاملOrdinary graphs and subplane partitions
We introduce a generalization of symmetric (v, k, λ) block designs, and show how these could potentially be used to construct projective planes of non-prime-power order. If q is a prime power and n2+n+1 = N(q2+q+1), then conceivably we could construct a projective plane of order n by gluing together N planes of order q. For example, 182+18+1 = 343 = 49 ·7. Can we make a projective plane of orde...
متن کاملA bijection between certain non-crossing partitions and sequences
We present a bijection between non-crossing partitions of the set [2n+1] into n+1 blocks such that no block contains two consecutive integers, and the set of sequences {si}n1 such that 1 ≤ si ≤ i, and if si = j, then si−r ≤ j − r for 1 ≤ r ≤ j − 1.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 1989
ISSN: 0022-314X
DOI: 10.1016/0022-314x(89)90008-5