Related papers: Combinatorial Proofs of Two Overpartition Theorems…
The bilateral series corresponding to many of the third-, fifth-, sixth- and eighth order mock theta functions may be derived as special cases of $_2\psi_2$ series \[ \sum_{n=-\infty}^{\infty}\frac{(a,c;q)_n}{(b,d;q)_n}z^n. \] Three…
In 2012 Bryson, Ono, Pitman and Rhoades showed how the generating functions for certain strongly unimodal sequences are related to quantum modular and mock modular forms. They proved some parity results and conjectured some mod 4…
The main result of this paper is a bijective proof showing that the generating function for partitions with bounded differences between largest and smallest part is a rational function. This result is similar to the closely related case of…
Refined versions, analytic and combinatorial, are given for classical integer partition theorems. The examples include the Rogers-Ramanujan identities, the Gollnitz-Gordon identities, Euler's odd=distinct theorem, and the Andrews-Gordon…
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,…
The Alladi-Gordon identity plays an important role for the Alladi-Gordon generalization of Schur's partition theorem. By using Joichi-Stanton's insertion algorithm, we present an overpartition interpretation for the Alladi-Gordon key…
The connection between the generating functions of various sets of tableaux and the appropriate families of quasisymmetric functions is a significant tool to give a direct analytical proof of some advanced bijective results and provide new…
In this paper, we give fundamental solutions of some $q$-difference equations satisfied by the universal mock theta functions and the higher level Appell functions. As an application, we provide an alternative proof of the representation…
Recently Lachterman, Schayer, and Younger published an elegant proof of the Ramanujan congruences for the partition function $p(n)$. Their proof uses only the classical theory of modular forms as well as a beautiful result of Choie, Kohnen,…
We study generating functions of ordinary and plane partitions coloured by the action of a finite subgroup of the corresponding special linear group. After reviewing known results for the case of ordinary partitions, we formulate a…
For a given permutation or set partition there is a natural way to assign a genus. Counting all permutations or partitions of a fixed genus according to cycle lengths or block sizes, respectively, is the main content of this article. After…
Major Percy A. MacMahon's first paper on plane partitions included a conjectured generating function for symmetric plane partitions. This conjecture was proven almost simultaneously by George Andrews and Ian Macdonald, Andrews using the…
Pandharipande-Thomas theory and Donaldson-Thomas theory (PT and DT) are two branches of enumerative geometry in which particular generating functions arise that count plane-partition-like objects. That these generating functions differ only…
Folsom, Kent, and Ono used the theory of modular forms modulo $\ell$ to establish remarkable ``self-similarity'' properties of the partition function and give an overarching explanation of many partition congruences. We generalize their…
Properties of four quintic theta functions are developed in parallel with those of the classical Jacobi null theta functions. The quintic theta functions are shown to satisfy analogues of Jacobi's quartic theta function identity and…
The modularity of the partition generating function has many important consequences, for example asymptotics and congruences for $p(n)$. In a series of papers the author and Ono \cite{BO1,BO2} connected the rank, a partition statistic…
We show how Andrews' generating functions for generalized Frobenius partitions can be understood within the theory of Eichler and Zagier as specific coefficients of certain Jacobi forms. This reformulation leads to a recursive process which…
We provide new Schmidt-type results through an investigation of two bijections, which are results involving partitions with parts counted only at given indices. Mork's bijection, the first of these, was originally given as a proof of…
We establish quasimodularity for a family of residual crank generating functions defined on overpartitions. We also show that the second moments of these $k$th residual cranks admit a combinatoric interpretation as weighted overpartition…
In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called {\it partitions with designated summands}. These are built by taking unrestricted integer partitions and designating exactly one of each occurrence…