We prove formulas for the generating functions for M_2-rank differences for partitions without repeated odd parts. These formulas are in terms of modular forms and generalized Lambert series.ACI "Jeunes Chercheurs et Jeunes Chercheuses
AbstractAlthough much is known about the partition function, little is known about its parity. For t...
Let n be a positive integer. A partition of n is a sequence of non-increasing positive integ...
AbstractIn this paper, we present a reduction algorithm which transforms m-regular partitions of [n]...
We prove formulas for the generating functions for M_2-rank differences for partitions without repea...
In 1954, Atkin and Swinnerton-Dyer proved Dyson's conjectures on the rank of a partition by establis...
This is the third and final installment in our series of papers applying the method of Atkin and Swi...
AbstractThe ‘crank’ is a partition statistic which originally arose to give combinatorial interpreta...
Kathrin Bringmann (Mathematisches Institut, Universität Köln, Weyertal 86-90, D-50931 Köln, Germany)...
Abstract. We evaluate the odd-partition function p2(n) modulo 4 by elementary methods and analyze th...
This thesis focuses on the rank statistic of partition functions, congruences and relating identitie...
In this paper, motivated by the work of Mahlburg, we find congruences for a large class of modular f...
AbstractLet R(w;q) be Dysonʼs generating function for partition ranks. For roots of unity ζ≠1, it is...
Introduction and statement of results. Recent works have illustrated that the Fourier coefficients o...
This dissertation explores results pertaining to partition theory and its q-series identities using ...
AbstractLet p(n) be the number of partitions of a non-negative integer n. In this paper we prove tha...
AbstractAlthough much is known about the partition function, little is known about its parity. For t...
Let n be a positive integer. A partition of n is a sequence of non-increasing positive integ...
AbstractIn this paper, we present a reduction algorithm which transforms m-regular partitions of [n]...
We prove formulas for the generating functions for M_2-rank differences for partitions without repea...
In 1954, Atkin and Swinnerton-Dyer proved Dyson's conjectures on the rank of a partition by establis...
This is the third and final installment in our series of papers applying the method of Atkin and Swi...
AbstractThe ‘crank’ is a partition statistic which originally arose to give combinatorial interpreta...
Kathrin Bringmann (Mathematisches Institut, Universität Köln, Weyertal 86-90, D-50931 Köln, Germany)...
Abstract. We evaluate the odd-partition function p2(n) modulo 4 by elementary methods and analyze th...
This thesis focuses on the rank statistic of partition functions, congruences and relating identitie...
In this paper, motivated by the work of Mahlburg, we find congruences for a large class of modular f...
AbstractLet R(w;q) be Dysonʼs generating function for partition ranks. For roots of unity ζ≠1, it is...
Introduction and statement of results. Recent works have illustrated that the Fourier coefficients o...
This dissertation explores results pertaining to partition theory and its q-series identities using ...
AbstractLet p(n) be the number of partitions of a non-negative integer n. In this paper we prove tha...
AbstractAlthough much is known about the partition function, little is known about its parity. For t...
Let n be a positive integer. A partition of n is a sequence of non-increasing positive integ...
AbstractIn this paper, we present a reduction algorithm which transforms m-regular partitions of [n]...
DOI
Add to ORKG