We establish bounds for exponential sums twisted by generalized Möbius functions and their convolutions. As an application, we prove asymptotic formulas for certain weighted chromatic partitions by using the Hardy–Littlewood circle method. Lastly, we provide an explicit formula relating the contributions from the major arcs with a sum over the zeros of the Riemann zeta-function.

Let $\overline {M}(a,c,n)$ denote the number of overpartitions of n with first residual crank congruent to a modulo c with $c\geq 3$ being odd and $0\leq a<c$. The central objective of this paper is twofold: firstly, to establish an asymptotic formula for the crank of overpartitions; and secondly, to establish several inequalities concerning $\overline {M}(a,c,n)$ that encompasses crank differences, positivity, and strict log-subadditivity.

Let $p(n)$ and $M(m,L;n)$ be the number of partitions of n and the number of partitions of n with crank congruent to m modulo L, respectively, and let

$$ \begin{align*}M(a,b,c;L;n):= M(a,L;n) + M(b,L;n) + M(c,L;n).\end{align*} $$

In this paper, we focus on some relations between $M(m,L;n)$ and $p(n),$ which Dyson, Andrews, and Garvan etc. have studied previously. By applying a modification of the circle method to estimate the Fourier coefficients of generating functions, we establish the following inequalities between $M(a,b,c;L;n)$ and $p(n):$ for $n \geq 467$,

$$ \begin{align*} M(0,1,1;9;n)> \frac{p(n)}{3} &\;\: \mathrm{when}\;\: n \equiv 0,1,5,8 ~ (\mathrm{mod}~9), \\ M(0,1,1;9;n) < \frac{p(n)}{3} &\;\: \mathrm{when}\;\: n \equiv 2,3,4,6,7 ~ (\mathrm{mod}~9), \\ M(2,3,4;9;n) < \frac{p(n)}{3} &\;\: \mathrm{when}\;\: n \equiv 0,1,5,8 ~ (\mathrm{mod}~9), \\ M(2,3,4;9;n)> \frac{p(n)}{3} &\;\: \mathrm{when}\;\: n \equiv 2,3,4,6,7 ~ (\mathrm{mod}~9). \end{align*} $$

In the proof of these inequalities, an inequality for the logarithm of the generating function for $p(n)$ is derived and applied. Our method reduces the last possible counterexamples to $467 \leq n \leq 22471$, and it will produce more effective estimates when proving inequalities of such types.

We establish some inequalities that arise from truncating Lerch sums and derive uniform asymptotic formulae for the spt-crank of ordinary partitions. The uniform asymptotic formulae improve upon a result of Mao [‘Asymptotic formulas for spt-crank of partitions’, J. Math. Anal. Appl. 460(1) (2018), 121–139].

In 2007, Andrews introduced Durfee symbols and k-marked Durfee symbols so as to give a combinatorial interpretation for the symmetrized moment function $\eta _{2k}(n)$ of ranks of partitions. He also considered the relations between odd Durfee symbols and the mock theta function $\omega (q)$, and proved that the $2k$th moment function $\eta _{2k}^0(n)$ of odd ranks of odd Durfee symbols counts $(k+1)$-marked odd Durfee symbols of n. In this paper, we first introduce the definition of symmetrized positive odd rank moments $\eta _k^{0+}(n)$ and prove that for all $1\leq i\leq k+1$, $\eta _{2k-1}^{0+}(n)$ is equal to the number of $(k+1)$-marked odd Durfee symbols of n with the ith odd rank equal to zero and $\eta _{2k}^{0+}(n)$ is equal to the number of $(k+1)$-marked Durfee symbols of n with the ith odd rank being positive. Then we calculate the generating functions of $\eta _{k}^{0+}(n)$ and study its asymptotic behavior. Finally, we use Wright’s variant of the Hardy–Ramanujan circle method to obtain an asymptotic formula for $\eta _{k}^{0+}(n)$.

A number of recent papers have estimated ratios of the partition function $p(n-j)/p(n)$ , which appear in many applications. Here, we prove an easy-to-use effective bound on these ratios. Using this, we then study the second shifted difference of partitions, $f(\,j,n) := p(n) -2p(n-j) +p(n-2j)$ , and give another easy-to-use estimate of $f(\,j,n)$ . As applications of these, we prove a shifted convexity property of $p(n)$ , as well as giving new estimates of the k-rank partition function $N_k(m,n)$ and non-k-ary partitions along with their differences.

Recent works at the interface of algebraic combinatorics, algebraic geometry, number theory and topology have provided new integer-valued invariants on integer partitions. It is natural to consider the distribution of partitions when sorted by these invariants in congruence classes. We consider the prominent situations that arise from extensions of the Nekrasov–Okounkov hook product formula and from Betti numbers of various Hilbert schemes of n points on ${\mathbb {C}}^2$ . For the Hilbert schemes, we prove that homology is equidistributed as $n\to \infty $ . For t-hooks, we prove distributions that are often not equidistributed. The cases where $t\in \{2, 3\}$ stand out, as there are congruence classes where such counts are zero. To obtain these distributions, we obtain analytic results of independent interest. We determine the asymptotics, near roots of unity, of the ubiquitous infinite products

$$ \begin{align*}F_1(\xi; q):=\prod_{n=1}^{\infty}\left(1-\xi q^n\right), \ \ \ F_2(\xi; q):=\prod_{n=1}^{\infty}\left(1-(\xi q)^n\right) \ \ \ {\mathrm{and}}\ \ \ F_3(\xi; q):=\prod_{n=1}^{\infty}\left(1-\xi^{-1}(\xi q)^n\right). \end{align*} $$

Let $\mathcal {C}_n =\left [\chi _{\lambda }(\mu )\right ]_{\lambda , \mu }$ be the character table for $S_n,$ where the indices $\lambda $ and $\mu $ run over the $p(n)$ many integer partitions of $n.$ In this note, we study $Z_{\ell }(n),$ the number of zero entries $\chi _{\lambda }(\mu )$ in $\mathcal {C}_n,$ where $\lambda $ is an $\ell $ -core partition of $n.$ For every prime $\ell \geq 5,$ we prove an asymptotic formula of the form

$$ \begin{align*}Z_{\ell}(n)\sim \alpha_{\ell}\cdot \sigma_{\ell}(n+\delta_{\ell})p(n)\gg_{\ell} n^{\frac{\ell-5}{2}}e^{\pi\sqrt{2n/3}}, \end{align*} $$

$\sigma _{\ell }(n)$

$\delta _{\ell }:=(\ell ^2-1)/24,$

$1/\alpha _{\ell }>0$

$L\left (\left ( \frac {\cdot }{\ell } \right ),\frac {\ell -1}{2}\right ).$

$\ell $

$n>\ell ^6/24,$

$\chi _{\lambda }(\mu )=0$

$\lambda $

$\mu $

$\ell $

$Z^*_{\ell }(n)$

$\ell $

$\ell \geq 5$

$$ \begin{align*}Z^*_{\ell}(n)\sim \alpha_{\ell}^2 \cdot \sigma_{\ell}( n+\delta_{\ell})^2 \gg_{\ell} n^{\ell-3}. \end{align*} $$

Hausel and Rodriguez-Villegas (2015, Astérisque 370, 113–156) recently observed that work of Göttsche, combined with a classical result of Erdös and Lehner on integer partitions, implies that the limiting Betti distribution for the Hilbert schemes $(\mathbb {C}^{2})^{[n]}$ on $n$ points, as $n\rightarrow +\infty ,$ is a Gumbel distribution. In view of this example, they ask for further such Betti distributions. We answer this question for the quasihomogeneous Hilbert schemes $((\mathbb {C}^{2})^{[n]})^{T_{\alpha ,\beta }}$ that are cut out by torus actions. We prove that their limiting distributions are also of Gumbel type. To obtain this result, we combine work of Buryak, Feigin, and Nakajima on these Hilbert schemes with our generalization of the result of Erdös and Lehner, which gives the distribution of the number of parts in partitions that are multiples of a fixed integer $A\geq 2.$ Furthermore, if $p_{k}(A;n)$ denotes the number of partitions of $n$ with exactly $k$ parts that are multiples of $A$ , then we obtain the asymptotic

$$ \begin{align*} p_{k}(A,n)\sim \frac{24^{\frac k2-\frac14}(n-Ak)^{\frac k2-\frac34}}{\sqrt2\left(1-\frac1A\right)^{\frac k2-\frac14}k!A^{k+\frac12}(2\pi)^{k}}e^{2\pi\sqrt{\frac1{6}\left(1-\frac1A\right)(n-Ak)}}, \end{align*} $$

Let $N\geq 1$ be squarefree with $(N,6)=1$ . Let $c\phi _N(n)$ denote the number of N-colored generalized Frobenius partitions of n introduced by Andrews in 1984, and $P(n)$ denote the number of partitions of n. We prove

$$ \begin{align*}c\phi_N(n)= \sum_{d \mid N} N/d \cdot P\left( \frac{ N}{d^2}n - \frac{N^2-d^2}{24d^2} \right) + b(n),\end{align*} $$

$C(z) := (q;q)^N_\infty \sum _{n=1}^{\infty } b(n) q^n$

$S_{(N-1)/2} (\Gamma _0(N),\chi _N)$

$c\phi _N(n)$

$P(n)$

We investigate the sum of the parts in all the partitions of n into distinct parts and give two infinite families of linear inequalities involving this sum. The results can be seen as new connections between partitions and divisors.

In this paper, we investigate $\unicode[STIX]{x1D70B}(m,n)$, the number of partitions of the bipartite number$(m,n)$ into steadily decreasing parts, introduced by Carlitz [‘A problem in partitions’, Duke Math. J.30 (1963), 203–213]. We give a relation between $\unicode[STIX]{x1D70B}(m,n)$ and the crank statistic $M(m,n)$ for integer partitions. Using this relation, we establish some uniform asymptotic formulas for $\unicode[STIX]{x1D70B}(m,n)$.

Our main result establishes Andrews’ conjecture for the asymptotic of the generating function for the number of integer partitions of $n$ without $k$ consecutive parts. The methods we develop are applicable in obtaining asymptotics for stochastic processes that avoid patterns; as a result they yield asymptotics for the number of partitions that avoid patterns.

Holroyd, Liggett, and Romik, in connection with certain bootstrap percolation models, introduced the study of partitions without $k$ consecutive parts. Andrews showed that when $k=2$, the generating function for these partitions is a mixed-mock modular form and, thus, has modularity properties which can be utilized in the study of this generating function. For $k>2$, the asymptotic properties of the generating functions have proved more difficult to obtain. Using $q$-series identities and the $k=2$ case as evidence, Andrews stated a conjecture for the asymptotic behavior. Extensive computational evidence for the conjecture in the case $k=3$ was given by Zagier.

This paper improved upon early approaches to this problem by identifying and overcoming two sources of error. Since the writing of this paper, a more precise asymptotic result was established by Bringmann, Kane, Parry, and Rhoades. That approach uses very different methods.

Let p(n) denote the partition function. In this paper, we will prove that for $n\ges 222$,

$$\left| {\matrix{ {p(n)} & {p(n + 1)} & {p(n + 2)} \cr {p(n-1)} & {p(n)} & {p(n + 1)} \cr {p(n-2)} & {p(n-1)} & {p(n)} \cr } } \right| > 0.{\rm }$$

$n\ges 222$

$$(p(n)^2-p(n-1)p(n+1))^2-(p(n-1)^2-p(n-2)p(n))(p(n+1)^2-p(n)p(n+2))>0.$$

We compute the limit shape for several classes of restricted integer partitions, where the restrictions are placed on the part sizes rather than the multiplicities. Our approach utilizes certain classes of bijections which map limit shapes continuously in the plane. We start with bijections outlined in [43], and extend them to include limit shapes with different scaling functions.

Let ${{p}_{w}}(n)$ be the weighted partition function defined by the generating function $\Sigma _{n=0}^{\infty }{{p}_{w}}(n){{x}^{n}}=\prod{_{m=1}^{\infty }{{(1-{{x}^{m}})}^{-w(m)}}}$ , where $w\left( m \right)$ is a non-negative arithmetic function. Let ${{P}_{w}}(u)={{\Sigma }_{n\le u}}{{p}_{w}}(n)\,and\,{{N}_{w}}(u)={{\Sigma }_{n\le u}}w(n)$ be the summatory functions for ${{p}_{w}}(n)$ and $w\left( n \right)$, respectively. Generalizing results of G. A. Freiman and E. E. Kohlbecker, we show that, for a large class of functions $\Phi \left( u \right)$ and $\text{ }\!\!\lambda\!\!\text{ }\left( u \right)$, an estimate for ${{P}_{w}}\left( u \right)$ of the form log ${{P}_{w}}(u)=\Phi (u)\{1+Ou(1/\lambda (u))\}$$\left( u\to \infty \right)$ implies an estimate for ${{N}_{w}}(u)$ of the form ${{N}_{w}}(u)={{\Phi }^{*}}(u)\{1+O(1/\log \lambda (u))\}$$\left( u\to \infty \right)$ with a suitable function ${{\Phi }^{*}}(u)$ defined in terms of $\Phi \left( u \right)$. We apply this result and related results to obtain characterizations of the Riemann Hypothesis and the Generalized Riemann Hypothesis in terms of the asymptotic behavior of certain weighted partition functions.

This is an expanded version of two lectures given at the conference held at Sydney University in December 1997 on the 50th anniversary of the death of G. H. Hardy.