This is the third and final installment in our series of papers applying the method of Atkin and Swinnerton-Dyer to deduce formulas for rank differences. The study of rank differences was initiated by Atkin and Swinnerton-Dyer in their proof of Dyson's conjectures concerning Ramanujan's congruences for the partition function. Since then, other types of rank differences for statistics associated to partitions have been investigated. In this paper, we prove explicit formulas for M_2-rank differences for overpartitions. Additionally, we express a third order mock theta function in terms of rank differences.
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 generating functions for rank differences for overpartitions. These are in terms of modular functions and generalized Lambert series.
In 2003, Atkin and Garvan initiated the study of rank and crank moments for ordinary partitions. These moments satisfy a strict inequality. We prove that a strict inequality also holds for the first rank and crank moments of overpartitions and consider a new combinatorial interpretation in this setting.
Let $\overline{N}_2(a,c,n)$ be the number of overpartitions of $n$ whose the $M_2$-rank is congruent to $a$ modulo $c$. In this paper, we obtain the asymptotic formula of $\overline{N}_2(a,c,n)$ utilizing the Ingham Tauberian Theorem. As applications, we derive inequalities concerning with $\overline{N}_2(a,c,n)$ including its strict concavity and log-concavity.
We generalize recent results of Breuer and Kronholm, and Chern on partitions and overpartitions with bounded differences between largest and smallest parts. We prove our generalization both analytically and combinatorially.
In this paper we obtain asymptotic formulas for the positive crank and rank moments for overpartitions. Moreover, we show that crank and rank moments are asymptotically equal while the difference is asymptotically positive. This indicates that there exist analogous higher ospt-functions for overpartitions, which we define.
We study two types of crank moments and two types of rank moments for overpartitions. We show that the crank moments and their derivatives, along with certain linear combinations of the rank moments and their derivatives, can be written in terms of quasimodular forms. We then use this fact to prove exact relations involving the moments as well as congruence properties modulo 3, 5, and 7 for some combinatorial functions which may be expressed in terms of the second moments. Finally, we establish a congruence modulo 3 involving one such combinatorial function and the Hurwitz class number H(n).
We study the generating function for overpartitions with bounded differences between largest and smallest parts, which is analogous to a result of Breuer and Kronholm on integer partitions. We also connect this problem with over $q$-binomial coefficients introduced by Dousse and Kim.
We show that the Zagier-Eisenstein series shares its non-holomorphic part with certain weak Maass forms whose holomorphic parts are generating functions for overpartition rank differences. This has a number of consequences, including exact formulas, asymptotics, and congruences for the rank differences as well as $q$-series identities of the mock theta type.
We investigate the modular properties of a new partition rank, the $M_d$-rank of overpartitions. In fact this is an infinite family of ranks, indexed by the positive integer $d$, that gives both the Dyson rank of overpartitions and the overpartition $M_2$-rank as special cases. The $M_d$-rank of overpartitions is the holomorphic part of a certain harmonic Maass form of weight $\frac{1}{2}$. We give the exact transformation of this harmonic Maass form along with a few identities for the $M_d$-rank.
We investigate Ramanujan congruences for the function which counts the overpartitions of n with restricted odd differences. In particular, we show that only one such congruence exists. Our method involves using the theory of modular forms to prove a more general theorem which bounds the number of primes possible for Ramanujan congruences in certain eta-quotients. This generalizes work done by Jonah Sinick. We also provide two congruences modulo 5 for this function.
Using that the overpartition rank function is the holomorphic part of a harmonic Maass form, we deduce formulas for the rank differences modulo 7. To do so we make improvements on the current state of the overpartition rank function in terms of harmonic Maass forms by giving simple formulas for the transformations under $\mbox{SL}_2(\mathbb{Z})$ as well as formulas for orders at cusps.
In this paper we compute asymptotics for the coefficients of an infinite class of overpartition rank generating functions. Using these results, we show that $ \overline{N}(a,c,n), $ the number of overpartitions of $ n $ with rank congruent to $ a $ modulo $ c, $ is equidistributed with respect to $ 0\le a< c, $ for any $ c\ge2, $ as $ n\to\infty $ and, in addition, we prove some inequalities between ranks of overpartitions conjectured by Ji, Zhang and Zhao (2018), and Wei and Zhang (2018) for $ n=6 $ and $ n=10. $
Bringmann and Lovejoy introduced a rank for overpartition pairs and investigated its role in congruence properties of $\bar{pp}(n)$, the number of overpartition pairs of n. In particular, they applied the theory of Klein forms to show that there exist many Ramanujan-type congruences for the number $\bar{pp}(n)$. In this paper, we shall derive two Ramanujan-type identities and some explicit congruences for $\bar{pp}(n)$. Moreover, we find three ranks as combinatorial interpretations of the fact that $\bar{pp}(n)$ is divisible by three for any n. We also construct infinite families of congruence…
We generalize the generating series of the Dyson ranks and $M_2$-ranks of overpartitions to obtain $k$-fold variants, and give a combinatorial interpretation of each. The $k$-fold generating series correspond to the full ranks of two families of buffered Frobenius representations, which generalize Lovejoy's first and second Frobenius representations of overpartitions, respectively.
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 explicit examples of Maass forms. Here we construct a new infinite family of such forms, arising from overpartitions. As applications we obtain combinatorial decompositions of Ramanujan-type congruences for overpartitions as well as the modularity of rank differences in certain arithmetic progressions.
We consider the symmetrized moments of three ranks and cranks, similar to the work of Garvan for the rank and crank of a partition. By using Bailey pairs and elementary rearrangements, we are able to find useful expressions for these moments. We then deduce inequalities between the corresponding ordinary moments. In particular we prove that the crank moment for overpartitions is always larger than the rank moment for overpartitions; with recent asymptotics this was known to hold for sufficiently large values of n for each fixed k. Lastly we provide higher order spt functions for overpartitions…
In 1969, Andrews proved a theorem on partitions with difference conditions which generalises Schur's celebrated partition identity. In this paper, we generalise Andrews' theorem to overpartitions. The proof uses q-differential equations and recurrences.
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 $\overline{\mbox{spt}}_2(n)$ is the total number of occurrences of the smallest parts among the overpartitions of $n$ where the smallest part is even and not overlined. Our proof depends on Bailey's Lemma and the rank difference formulas of Lovejoy and Osburn for the $M_2$-rank of an overpartition. This congruence, along with a modulo $5$ congruence, has previously been …
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 class number relations for $M2$-rank differences. As applications we split the Kronecker-Hurwitz relation into its "even" and "odd" parts and calculate sums over Hurwitz class numbers of the form $\sum_{r \in \mathbb{Z}} H(n - 2r^2)$.
In this paper we give a full description of the inequalities that can occur between overpartition ranks. If $ \overline{N}(a,c,n) $ denotes the number of overpartitions of $ n $ with rank congruent to $ a $ modulo $ c,$ we prove that for any $ c\ge7 $ and $ 0\le a<b\le\left\lfloor\frac{c}{2}\right\rfloor $ we have $ \overline{N}(a,c,n)>\overline{N}(b,c,n) $ for $n$ large enough. That the sign of the rank differences $ \overline{N}(a,c,n)-\overline{N}(b,c,n) $ depends on the residue class of $ n $ modulo $ c $ in the case of small moduli, such as $ c=6, $ is known due to the work of Ji, Zhang a…
Let $B_{k,i}(n)$ be the number of partitions of $n$ with certain difference condition and let $A_{k,i}(n)$ be the number of partitions of $n$ with certain congruence condition. The Rogers-Ramanujan-Gordon theorem states that $B_{k,i}(n)=A_{k,i}(n)$. Lovejoy obtained an overpartition analogue of the Rogers-Ramanujan-Gordon theorem for the cases $i=1$ and $i=k$. We find an overpartition analogue of the Rogers-Ramanujan-Gordon theorem in the general case. Let $D_{k,i}(n)$ be the number of overpartitions of $n$ satisfying certain difference condition and $C_{k,i}(n)$ be the number of overpartition…
Recently, Andrews, Chan, Kim and Osburn introduced a $q$-series $h(q)$ for the study of the first positive rank and crank moments for overpartitions. They conjectured that for all integers $m \geq 3$, \begin{equation*}\label{hqcon} \frac{1}{(q)_{\infty}} (h(q) - m h(q^{m})) \end{equation*} has positive power series coefficients for all powers of $q$. Byungchan Kim, Eunmi Kim and Jeehyeon Seo provided a combinatorial interpretation and proved it is asymptotically true by circle method. In this note, we show this conjecture is true if $m$ is any positive power of $2$, and we show that in order t…
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, Garvan, and Liang defined an spt-crank in terms of weighted vector partitions which combinatorially explain simple congruences mod 5 and 7 for spt (n). Chen, Ji, and Zang were able to define this spt-crank in terms of ordinary partitions. In this paper we define spt-cranks in terms of vector partitions that combinatorially explain the known simple congruenc…
In 1968 and 1969, Andrews proved two partition theorems of the Rogers-Ramanujan type which generalise Schur's celebrated partition identity (1926). Andrews' two generalisations of Schur's theorem went on to become two of the most influential results in the theory of partitions, finding applications in combinatorics, representation theory and quantum algebra. In a recent paper, the author generalised the first of these theorems to overpartitions, using a new technique which consists in going back and forth between $q$-difference equations on generating functions and recurrence equations on thei…
Let $\overline{p}(n)$ denote the overpartition function. In this paper, our primary goal is to study the asymptotic behavior of the finite differences of the logarithm of the overpartition function, i.e., $(-1)^{r-1}Δ^r \log \p(n)$, by studying the inequality of the following form $$\log \Bigl(1+\dfrac{C(r)}{n^{r-1/2}}-\dfrac{C_1(r)}{n^{r}}\Bigr)<(-1)^{r-1}Δ^r \log \p(n) <\log \Bigl(1+\dfrac{C(r)}{n^{r-1/2}}\Bigr)\ \text{for}\ n \geq N(r),$$ where $C(r), C_1(r), \text{and}\ N(r)$ are computable constants depending on the positive integer $r$, determined explicitly. This solves a problem posed …
We prove a general theorem on overpartitions with difference conditions that unifies generalisations of Schur's theorem due to Alladi-Gordon, Andrews, Corteel-Lovejoy and the author. This theorem also allows one to give companions and refinements of the generalisations of Andrews' theorems to overpartitions. The proof relies on the method of weighted words of Alladi and Gordon and $q$-difference equation techniques introduced recently by the author.
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.
In this paper, we obtain infinitely many non-trivial identities and inequalities between full rank differences for 2-marked Durfee symbols, a generalization of partitions introduced by Andrews. A certain strict inequality, which almost always holds, shows that identities for Dyson's rank, similar to those proven by Atkin and Swinnerton-Dyer, are quite rare. By showing an analogous strict inequality, we show that such non-trivial identities are also rare for the full rank, but on the other hand we obtain an infinite family of non-trivial identities, contrasting the partition theoretic case.
We study quadratic residue difference sets, GMW difference sets, and difference sets arising from monomial hyperovals, all of which are $(2^d-1, 2^{d-1}-1, 2^{d-2}-1)$ cyclic difference sets in the multiplicative group of the finite field $F_{2^d}$ of $2^d$ elements, with $d \geq 2$. We show that, except for a few cases with small $d$, these difference sets are all pairwise inequivalent. This is accomplished in part by examining their 2-ranks. The 2-ranks of all of these difference sets were previously known, except for those connected with the Segre and Glynn hyperovals. We determine the 2-ra…
The Dyson rank of an integer partition is the difference between its largest part and the number of parts it contains. Using Fine-Dyson symmetry, we give formulas for the number of partitions of n with rank larger than n/2, and we prove identities for counts of partitions with large rank in fixed residue classes.
We provide a necessary and sufficient condition for the solvability of a rank one differential (resp. $q$-difference) equation over the Amice's ring. We also extend to that ring a Birkoff decomposition result, originally due to Motzkin.
Andrews' spt-function can be written as the difference between the second symmetrized crank and rank moment functions. Using the machinery of Bailey pairs a combinatorial interpretation is given for the difference between higher order symmetrized crank and rank moment functions. This implies an inequality between crank and rank moments that was only know previously for sufficiently large n and fixed order. This combinatorial interpretation is in terms of a weighted sum of partitions. A number of congruences for higher order spt-functions are derived.
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 proof of Ramanujan's congruence. The notion of rank was extended to rank differences by Atkin and Swinnerton-Dyer \cite{atkin}, who proved Dyson's conjecture. More recently, Mao proved several equalities and inequalities, leaving some as conjectures, for rank differences for partitions modulo 10 \cite{mao10} and for $M_2$ rank differences for partitions with no …
By work of Bringmann, Ono, and Rhoades it is known that the generating function of the $M_2$-rank of partitions without repeated odd parts is the so-called holomorphic part of a certain harmonic Maass form. Here we improve the standing of this function as a harmonic Maass form and show more can be done with this function. In particular we show the related harmonic Maass form transforms like the generating function for partitions without repeated odd parts (which is a modular form). We then use these improvements to determine formulas for the rank differences modulo $7$. Additionally we give id…
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 $10$ for the $M_2$ rank of partitions without repeated odd parts. Mao conjectured some additional inequalities. We prove some of Mao's rank inequality conjectures for both the rank and the $M_2$ rank modulo $10$ using elementary methods.
Rank-2 Drinfeld modules are a function-field analogue of elliptic curves, and the purpose of this paper is to investigate similarities and differences between rank-2 Drinfeld modules and elliptic curves in terms of supersingularity. Specifically, we provide an explicit formula of a supersingular polynomial for rank-2 Drinfeld modules and prove several basic properties. As an application, we give a numerical example of an asymptotically optimal tower of Drinfeld modular curves.
