Results 11 to 20 of about 349 (51)
Arithmetic properties for Andrews’ (48,6)- and (48,18)-singular overpartitions
Singular overpartition functions were defined by Andrews. Let Ck,i(n) denote the number of (k, i)-singular overpartitions of n, which counts the number of overpartitions of n in which no part is divisible by k and only parts ±i (mod k) may be overlined ...
Liu Eric H., Du Wenjing
doaj +1 more source
Variations on a result of Bressoud [PDF]
The well-known Rogers-Ramanujan identities have been a rich source of mathematical study over the last fifty years. In particular, Gordon’s generalization in the early 1960s led to additional work by Andrews and Bressoud in subsequent years ...
Kursungoz, Kagan +2 more
core +3 more sources
Congruences in ordered pairs of partitions
Dyson defined the rank of a partition (as the first part minus the number of parts) whilst investigating certain congruences in the sequence p−1(n). The rank has been widely studied as have been other statistics, such as the crank. In this paper a “birank” is defined which relates to ordered pairs of partitions, and is used in an elementary proof of a ...
Paul Hammond, Richard Lewis
wiley +1 more source
Computational proofs of congruences for 2‐colored Frobenius partitions
In 1994, the following infinite family of congruences was conjectured for the partition function cΦ2(n) which counts the number of 2‐colored Frobenius partitions of n: for all n ≥ 0 and α ≥ 1, cΦ2(5αn + λα) ≡ 0(mod5α), where λα is the least positive reciprocal of 12 modulo 5α. In this paper, the first four cases of this family are proved.
Dennis Eichhorn, James A. Sellers
wiley +1 more source
The Kostant partition functions for twisted Kac‐Moody algebras
Employing the method of generating functions and making use of some infinite product identities like Euler, Jacobi′s triple product and pentagon identities we derive recursion relations for Kostant′s partition functions for the twisted Kac‐Moody algebras.
Ranabir Chakrabarti +1 more
wiley +1 more source
On congruence properties of the partition function
Some congruence properties of the partition function are proved.
Jayce Getz
wiley +1 more source
On partitions with difference conditions
We present two general theorems having interesting special cases. From one of them we give a new proof for theorems of Gordon using a bijection and from another we have a new combinatorial interpretation associated with a theorem of Göllnitz.
José Plínio, O. Santos, Paulo Mondek
wiley +1 more source
q‐series, elliptic curves, and odd values of the partition function
Let p(n) be the number of partitions of an integer n. Euler proved the following recurrence for p(n): where ω(k) = (3k 2 + k)/2. In view of Euler′s result, one sees that it is fairly easy to compute p(n) very quickly. However, many questions remain open even regarding the parity of p(n).
Nicholas Eriksson
wiley +1 more source
q‐Analogue of a binomial coefficient congruence
We establish a q‐analogue of the congruence where p is a prime and a and b are positive integers.
W. Edwin Clark
wiley +1 more source
Some Congruences of a Restricted Bipartition Function
Let $c_N(n)$ denotes the number of bipartitions $(\lambda, \mu)$ of a positive integer $n$ subject to the restriction that each part of $\mu$ is divisible by $N$.
Boruah, Chayanika, Saikia, Nipen
core +2 more sources

