English
Related papers

Related papers: M_2-rank differences for overpartitions

200 papers

In 1954, Atkin and Swinnerton-Dyer proved Dyson's conjectures on the rank of a partition by establishing formulas for the generating functions for rank differences in arithmetic progressions. In this paper, we prove formulas for the…

Number Theory · Mathematics 2021-02-03 Jeremy Lovejoy , Robert Osburn

Based on work of Atkin and Swinnerton-Dyer on partition rank difference functions, and more recent work of Lovejoy and Osburn, Mao has proved several inequalities between partition ranks modulo $10$, and additional results modulo $6$ and…

Number Theory · Mathematics 2015-09-22 Ethan Alwaise , Elena Iannuzzi , Holly Swisher

Ramanujan's congruence $p(5k+4) \equiv 0 \pmod 5$ led Dyson \cite{dyson} to conjecture the existence of a measure "rank" such that $p(5k+4)$ partitions of $5k+4$ could be divided into sub-classes with equal cardinality to give a direct…

Number Theory · Mathematics 2016-05-20 Rupam Barman , Archit Pal Singh Sachdeva

In a series of papers the first author and Ono connected the rank, a partition statistic introduced by Dyson, to weak Maass forms, a new class of functions which are related to modular forms. Naturally it is of wide interest to find other…

Number Theory · Mathematics 2007-08-07 Kathrin Bringmann , Jeremy Lovejoy

We prove general fomulas for the deviations of two overpartition ranks from the average. These formulas are in terms of Appell--Lerch series and sums of quotients of theta functions and can be used, among other things, to recover any of the…

Number Theory · Mathematics 2025-07-14 Jeremy Lovejoy , Robert Osburn

We give combinatorial interpretations of two residual cranks of overpartitions defined by Bringmann, Lovejoy and Osburn in 2009 analogous to the crank of partitions given by Andrews and the first author in 1988. As a consequence, we give…

Combinatorics · Mathematics 2024-10-29 Frank G. Garvan , Rishabh Sarma

Denote by $p(n)$ the number of partitions of $n$ and by $N(a,M;n)$ the number of partitions of $n$ with rank congruent to $a$ modulo $M$. By considering the deviation \begin{equation*} D(a,M) := \sum_{n= 0}^{\infty}\left(N(a,M;n) -…

Number Theory · Mathematics 2018-08-01 Eric T. Mortenson

We prove formulas for generalized rank deviations for overpartitions. These formulas are in terms of Appell-Lerch series and sums of quotients of theta functions and extend work of Lovejoy and the second author. As an application, we…

Number Theory · Mathematics 2025-11-21 Kevin Allen , Robert Osburn , Matthias Storzer

Bringmann, Lovejoy, and Osburn showed that the generating functions of the spt-overpartition functions spt(n), spt1(n), spt2(n), and M2spt(n) are quasimock theta functions, and satisfy a number of simple Ramanujan-like congruences. Andrews,…

Number Theory · Mathematics 2014-12-12 Frank Garvan , Chris Jennings-Shaffer

The rank of partitions play an important role in the combinatorial interpretations of several Ramanujan's famous congruence formulas. In 2005 and 2008, the $D$-rank and $M_2$-rank of an overpartition were introduced by Lovejoy,…

Combinatorics · Mathematics 2019-03-06 Huan Xiong , Wenston J. T. Zang

We introduce a statistic on overpartitions called the $\overline{k}$-rank. When there are no overlined parts, this coincides with the $k$-rank of a partition introduced by Garvan. Moreover, it reduces to the D-rank of an overpartition when…

Combinatorics · Mathematics 2021-08-20 Alice X. H. Zhao

By considering the $M_2$-rank of an overpartition as well as a residual crank, we give another combinatorial refinement of the congruences $\overline{\mbox{spt}}_2(3n)\equiv \overline{\mbox{spt}}_2(3n+1)\equiv 0\pmod{3}$. Here…

Number Theory · Mathematics 2014-06-23 Chris Jennings-Shaffer

We prove that the generating function of overpartition $M2$-rank differences is, up to coefficient signs, a component of the vector-valued mock Eisenstein series attached to a certain quadratic form. We use this to compute analogs of the…

Number Theory · Mathematics 2018-09-26 Brandon Williams

Denote by $p(n)$ the number of partitions of $n$ and by $N(a,M;n)$ the number of partitions of $n$ with rank congruent to $a$ modulo $M$. We find and prove a general formula for Dyson's ranks by considering the deviation of the ranks from…

Number Theory · Mathematics 2017-02-09 Dean Hickerson , Eric Mortenson

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.

Number Theory · Mathematics 2021-02-03 Jeremy Lovejoy , Robert Osburn

In this paper, we obtain inequalities on $M_2$-ranks of overpartitions modulo $6$. Let $\overline{N}_2(s,m,n)$ to be the number of overpartitions of $n$ whose $M_2$-rank is congruent to $s$ modulo $m$. For $M_2$-ranks modulo $3$, Lovejoy…

Combinatorics · Mathematics 2018-05-11 Helen W. J. Zhang

Noting a curious link between Andrews' even-odd crank and the Stanley rank, we adopt a combinatorial approach building on the map of conjugation and continue the study of integer partitions with parts separated by parity. Our motivation is…

Number Theory · Mathematics 2025-06-11 Shishuo Fu , Dazhao Tang

In 1944 Dyson defined the rank of a partition as the largest part minus the number of parts, and conjectured that the residue of the rank mod 5 divides the partitions of 5n+4 into five equal classes. This gave a combinatorial explanation of…

Number Theory · Mathematics 2020-12-15 Frank Garvan

In 2015, Bringmann, Lovejoy and Mahlburg considered certain kinds overpartitions, which can been seen as the overpartition analogue of Schur's partition. The motivation of their work is that the difference between the generating function of…

Combinatorics · Mathematics 2018-01-09 Doris D. M. Sang , Diane Y. H. Shi

In this paper, we discuss a few recent conjectures made by George Beck related to the ranks and cranks of partitions. The conjectures for the rank of a partition were proved by Andrews by using results due to Atkin and Swinnerton-Dyer on a…

Combinatorics · Mathematics 2021-01-27 Shreejit Bandyopadhyay
‹ Prev 1 2 3 10 Next ›