Results 1 to 10 of about 42 (42)
The false theta functions of Rodgers and their modularity
Bulletin of the London Mathematical Society, Volume 53, Issue 4, Page 963-980, August 2021., 2021 Abstract In this survey article, we explain how false theta functions can be embedded into a modular framework and show some of the applications of this modularity.
Kathrin Bringmann
wiley +1 more source
Counting certain quadratic partitions of zero modulo a prime number
Open Mathematics, 2021 Consider an odd prime number p≡2(mod3)p\equiv 2\hspace{0.3em}\left(\mathrm{mod}\hspace{0.3em}3). In this paper, the number of certain type of partitions of zero in Z/pZ{\mathbb{Z}}\hspace{-0.1em}\text{/}\hspace{-0.1em}p{\mathbb{Z}} is calculated using a ...
Xiao Wang, Li Aihua
doaj +1 more source
Ramanujan-type congruences modulo 4 for partitions into distinct parts
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2022 In this paper, we consider the partition function Q(n) counting the partitions of n into distinct parts and investigate congruence identities of the form Q(p⋅n+p2-124)≡0 (mod4),Q\left( {p \cdot n + {{{p^2} - 1} \over {24}}} \right) \equiv 0\,\,\,\left(
Merca Mircea
doaj +1 more source
Some congruences for 3-component multipartitions
Open Mathematics, 2016 Let p3(n) denote the number of 3-component multipartitions of n. Recently, using a 3-dissection formula for the generating function of p3(n), Baruah and Ojah proved that for n ≥ 0, p3(9n + 5) ≡ 0 (mod 33) and p3 (9n + 8) ≡ 0 (mod 34).
Zhao Tao Yan, Jin Lily J., Gu C.
doaj +1 more source
Arithmetic properties for Andrews’ (48,6)- and (48,18)-singular overpartitions
Open Mathematics, 2019 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
On the existence of a non‐zero lower bound for the number of Goldbach partitions of an even integer
International Journal of Mathematics and Mathematical Sciences, Volume 2004, Issue 15, Page 789-798, 2004., 2004 The Goldbach partitions of an even number, given by the sums of two prime addends, form the nonempty set for all integers 2n with 2 ≤ n ≤ 2 × 1014. It will be shown how to determine by the method of induction the existence of a non‐zero lower bound for the number of Goldbach partitions of all even integers greater than or equal to 4.
Simon Davis
wiley +1 more source
Congruences in ordered pairs of partitions
International Journal of Mathematics and Mathematical Sciences, Volume 2004, Issue 47, Page 2509-2512, 2004., 2004 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
Parity results for broken 11-diamond partitions
Open Mathematics, 2019 Recently, Dai proved new infinite families of congruences modulo 2 for broken 11-diamond partition functions by using Hecke operators. In this note, we establish new parity results for broken 11-diamond partition functions.
Wu Yunjian
doaj +1 more source
Computational proofs of congruences for 2‐colored Frobenius partitions
International Journal of Mathematics and Mathematical Sciences, Volume 29, Issue 6, Page 333-340, 2002., 2002 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
International Journal of Mathematics and Mathematical Sciences, Volume 24, Issue 1, Page 11-27, 2000., 2000 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