Related papers: Generalized rank deviations for overpartitions

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…

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…

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…

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…

We generalize and prove conjectures of Corteel and Lovejoy, related to overpartitions and divisor functions.

In this paper, we develop a unified method for obtaining and proving $m$-dissections of mock theta functions. Our approach builds upon a transformation formula for Appell--Lerch sums due to Hickerson and Mortenson, which allows these sums…

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…

In this article, we prove two identities of generalized Lambert series. By introducing what we call $\mathcal{S}$-series, we establish relationships between multiple generalized Lambert series and multiple infinite products. Compared with…

Let $\alpha$ and $\beta$ be two nonnegative integers such that $\beta < \alpha$. For an arbitrary sequence $\{a_n\}_{n\geqslant 1}$ of complex numbers, we consider the generalized Lambert series in order to investigate linear combinations…

In recent work, Hickerson and the author demonstrated that it is useful to think of Appell--Lerch sums as partial theta functions. This notion can be used to relate identities involving partial theta functions with identities involving…

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 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…

We study the combinatorics of two classes of basic hypergeometric series. We first show that these series are the generating functions for certain overpartition pairs defined by frequency conditions on the parts. We then show that when…

We extend partition-theoretic work of Andrews, Bressoud, and Burge to overpartitions, defining the notions of successive ranks, generalized Durfee squares, and generalized lattice paths, and then relating these to overpartitions defined by…

In this paper, we obtain asymptotic formulas for an infinite class of rank generating functions. As an application, we solve a conjecture of Andrews and Lewis on inequalities between certain ranks.

We develop the theory of copartitions, which are a generalization of partitions with connections to many classical topics in partition theory, including Rogers-Ramanujan partitions, theta functions, mock theta functions, partitions with…

In this paper, we generalize Andrews' partitions separated by parity to overpartitions in two ways. We investigate the generating functions for 16 overpartition families whose parts are separated by parity, and we prove various $q$-series…

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…

We prove a general lemma about partitioning the vertex set of a graph into subgraphs of bounded degree. This lemma extends a sequence of results of Lov\'asz, Catlin, Kostochka and Rabern.

We demonstrate how formulas that express Hecke-type double-sums in terms of theta functions and Appell--Lerch functions -- the building blocks of Ramanujan's mock theta functions -- can be used to give general string function formulas for…