betaFeedback

WorksMathematics

Proof of two conjectures on the log-concavity of partition ranks and cranks

Abstract

Let M(m,n)M(m,n) and N(m,n)N(m,n) denote the numbers of partitions of nn with crank mm and rank mm, respectively. Ji and Zang proved that the crank sequence (M(m,n))∣m∣≤n−1(M(m,n))_{|m|\le n-1} is unimodal for every n≥44n\ge44. Bringmann, Man, and Rolen subsequently established the unimodality of the rank sequence (N(m,n))∣m∣≤n−2(N(m,n))_{|m|\le n-2} for every n≥39n\ge39. Ji and Zang also conjectured that (M(m,n))∣m∣≤n−71(M(m,n))_{|m|\le n-71} is log-concave for every n≥72n\ge72, and that (N(m,n))∣m∣≤n−72(N(m,n))_{|m|\le n-72} is log-concave for every n≥73n\ge73. In this paper, we prove both conjectures.

2020 Mathematics Subject Classification. 05A17, 05A20, 11P82.

Introduction

The rank and crank are two fundamental statistics in the theory of partitions. A partition λ=(λ1,…,λr)\lambda=(\lambda_1,\ldots,\lambda_r) of nn is a finite sequence satisfying

λ1≥λ2≥⋯≥λr>0andλ1+λ2+⋯+λr=n.\lambda_1\ge\lambda_2\ge\cdots\ge\lambda_r>0 \qquad\text{and}\qquad\lambda_1+\lambda_2+\cdots+\lambda_r=n.

The rank of λ\lambda, introduced by Dyson [10], is defined by

rank⁡(λ)=λ1−r.\operatorname{rank}(\lambda)=\lambda_1-r.

Let ω(λ)\omega(\lambda) denote the number of ones in λ\lambda and μ(λ)\mu(\lambda) denote the number of parts of λ\lambda larger than ω(λ)\omega(\lambda). The crank of λ\lambda, defined by Andrews and Garvan [1], is

crank⁡(λ)={λ1,if ω(λ)=0,μ(λ)−ω(λ),if ω(λ)>0.\operatorname{crank}(\lambda)= \begin{cases} \lambda_1, & \text{if }\omega(\lambda)=0,\\ \mu(\lambda)-\omega(\lambda), & \text{if }\omega(\lambda)>0. \end{cases}

Let p(n)p(n) denote the number of partitions of nn. It was conjectured by Dyson [10] and confirmed by Atkin and Swinnerton-Dyer [2] that the rank of a partition could explain two of Ramanujan’s famous partition congruences p(5n+4)≡0(mod5)p(5n+4)\equiv0\pmod{5} and p(7n+5)≡0(mod7)p(7n+5)\equiv0\pmod{7}. However, the rank fails to explain Ramanujan’s congruence modulo 11. Therefore Dyson [10] conjectured the existence of another statistic which would explain the third Ramanujan congruence. Andrews and Garvan [1, 11] successfully found the crank, and proved that the crank simultaneously explains the above three Ramanujan congruences.

A sequence of nonnegative numbers (cn)n≥0(c_n)_{n\ge0} is said to be unimodal if there exists a pp such that

c0≤c1≤⋯≤cp−1≤cp≥cp+1≥⋯ .c_0\le c_1\le\cdots\le c_{p-1}\le c_p\ge c_{p+1}\ge\cdots.

We say (ck)k≥0(c_k)_{k\ge0} is log-concave if ck2−ck−1ck+1≥0c_k^2-c_{k-1}c_{k+1}\ge0 for k≥1k\ge1. Clearly, log-concavity with no internal zeros implies unimodality (or monotonicity). It is well known that the partition function satisfies p(n+1)≥p(n)p(n+1)\ge p(n) for n≥0n\ge0. Nicolas [15] and DeSalvo and Pak [8] independently proved that (p(n))n(p(n))_n is log-concave for n≥26n\ge26.

Let N(m,n)N(m,n) and M(m,n)M(m,n) denote the numbers of partitions of nn with rank mm and crank mm, respectively. The unimodality of rank and crank has been studied from both combinatorial and analytic perspectives. For the rank sequence, Chan and Mao [6] proved that N(m,n)≥N(m+2,n)N(m,n)\ge N(m+2,n) for m,n≥0m,n\ge0. Thus the even and odd rank subsequences are separately unimodal. They ask the question to find conditions on the unimodality of (N(m,n))m(N(m,n))_m. Bringmann, Man and Rolen [5 Theorem 1.6] answered the question and proved that the sequence (N(m,n))m(N(m,n))_m is unimodal for every n≥39n\ge39 and 0≤m≤n−30\le m\le n-3. For the crank sequence, Kim, Kim, and Seo [13] proved that, for each fixed nonnegative integer mm, M(m,n)>M(m+1,n)M(m,n)>M(m+1,n) holds for all sufficiently large nn. Ji and Zang [12] subsequently proved that the sequence (M(m,n))m(M(m,n))_m is unimodal for every n≥44n\ge44 and 0≤m≤n−20\le m\le n-2.

Ji and Zang posed the following conjectures on the log-concavity of (M(m,n))m(M(m,n))_m and (N(m,n))m(N(m,n))_m. See also Bringmann, Jennings-Shaffer, and Mahlburg [4].

Conjecture 1.1 ([12], Conjecture 11.1). For every integer n≥72n\ge72 and every integer mm with ∣m∣≤n−72|m|\le n-72,

M(m,n)2≥M(m−1,n)M(m+1,n).M(m,n)^2\ge M(m-1,n)M(m+1,n).

Conjecture 1.2 ([12], Conjecture 11.3). For every integer n≥73n\ge73 and every integer mm with ∣m∣≤n−73|m|\le n-73,

N(m,n)2≥N(m−1,n)N(m+1,n).N(m,n)^2\ge N(m-1,n)N(m+1,n).

Bringmann and Dousse [3] proved Dyson’s logistic asymptotic for the crank; Dousse and Mertens [9] obtained its rank counterpart. On each fixed range ∣m∣≤Ln|m| \le L\sqrt{n}, these results give, uniformly as n→∞n \to\infty,

M(m,n), N(m,n)∼πp(n)46nsech⁡2(πm26n).(1)M(m,n),\ N(m,n) \sim\frac{\pi p(n)}{4\sqrt{6n}} \operatorname{sech}^{2}\left(\frac{\pi m}{2\sqrt{6n}}\right). \tag*{(1)}

The density f(z)=14sech⁡2(z/2)f(z) = \frac{1}{4}\operatorname{sech}^{2}(z/2) satisfies −(log⁡f)′′(z)=2f(z)>0-(\log f)^{\prime\prime}(z) = 2f(z) > 0.

Liu and Zhou [14] introduced Garvan’s kk-rank functions Ak(m,n)A_k(m,n), where

A1(m,n)=M(m,n),A2(m,n)=N(m,n).(2)A_1(m,n) = M(m,n), \qquad A_2(m,n) = N(m,n). \tag*{(2)}

Zhou [16] proved that, for k∈{1,2}k \in\{1,2\} and integers n≥142+2kn \ge142 + 2k and mm satisfying n2−2k+2≤∣m∣≤n−k−71\frac{n}{2} - 2k + 2 \le|m| \le n-k-71,

Ak(m,n)2>Ak(m−1,n)Ak(m+1,n).(3)A_k(m,n)^2 > A_k(m-1,n)A_k(m+1,n). \tag*{(3)}

The following theorem establishes strict log-concavity in the two conjectures.

Theorem 1.3. For k∈{1,2}k \in\{1,2\} and integers n≥72n \ge72 and mm with ∣m∣≤n−k−71|m| \le n-k-71, we have

Ak(m,n)2>Ak(m−1,n)Ak(m+1,n).(4)A_k(m,n)^2 > A_k(m-1,n)A_k(m+1,n). \tag*{(4)}

The case k=1k=1 and k=2k=2 in Theorem 1.3 imply Conjectures 1.1 and 1.2 respectively. Ji and Zang [12 Section 11] have checked Conjecture 1.1 for 72≤n≤1000072 \le n \le10000. We check that the inequality (4) is strict for both k=1,2k=1,2 and n≤5000n \le5000. It suffices to prove Theorem 1.3 for n≥5000n \ge5000. The paper is organized as follows. In Section 2, we establish explicit estimates for the partition function, its smooth approximation, and the first difference of this approximation. In Section 3, we prove Theorem 1.3 for n≥5000n \ge5000 and 0≤m≤2n0 \le m \le2\sqrt{n}. Section 4 establishes the inequality in Theorem 1.3 for n≥5000n \ge5000 and 2n≤m≤n/2+12\sqrt{n} \le m \le n/2+1. Finally, we complete the proof of Theorem 1.3 in Section 5, by combining these estimates with Zhou’s result (3).

Preliminaries

By convention, p(0)=1p(0) = 1 and p(n)=0p(n) = 0 for n<0n < 0. For ∣q∣<1|q| < 1,

∑n≥0p(n)qn=1(q;q)∞=1∏j≥1(1−qj).(5)\sum_{n\ge0} p(n)q^n = \frac{1}{(q;q)_{\infty}} = \frac{1}{\prod_{j\ge1}(1-q^j)}. \tag*{(5)}

For k∈{1,2}k \in\{1,2\}, integers n≥2n \ge2 and m≥0m \ge0, Ak(m,n)A_k(m,n) can be expressed as the following finite alternating sum of partition numbers:

Ak(m,n)=∑j≥1(−1)j−1{p(n−(k−12)j2−∣m∣j+j2)−p(n−(k−12)j2−∣m∣j−j2)}.(6)A_k(m,n) = \sum_{j\ge1}(-1)^{j-1}\left\{p\left(n-\left(k-\frac{1}{2}\right)j^2-|m|j+\frac{j}{2}\right)-p\left(n-\left(k-\frac{1}{2}\right)j^2-|m|j-\frac{j}{2}\right)\right\}. \tag*{(6)}

See, for example, Zhou [16 p. 267]. Clearly by (6), Ak(−m,n)=Ak(m,n)A_k(-m,n) = A_k(m,n) for k=1,2k=1,2. Hence, to prove Theorem 1.3, it suffices to consider 0≤m≤n−k−710 \le m \le n-k-71.

References

  1. [1]G. E. Andrews and F. G. Garvan, Dyson’s crank of a partition, Bull. Amer. Math. Soc. (N.S.) 18 (1988), no. 2, 167–171.DOI
  2. [2]A. O. L. Atkin and P. Swinnerton-Dyer, Some properties of partitions, Proc. London Math. Soc. (3) 4 (1954), 84–106.
  3. [3]K. Bringmann and J. Dousse, On Dyson’s crank conjecture and the uniform asymptotic behavior of certain inverse theta functions, Trans. Amer. Math. Soc. 368 (2016), 3141–3155.arxiv.org/abs/1311.6089
  4. [4]K. Bringmann, C. Jennings-Shaffer and K. Mahlburg, The asymptotic distribution of the rank for unimodal sequences, J. Number Theory 229 (2021), 444–462.arxiv.org/abs/1910.10790
  5. [5]K. Bringmann, S. H. Man and L. Rolen, Unimodality of ranks and a proof of Stanton’s conjecture, arXiv:2209.12239v1 (2022).arxiv.org/abs/2209.12239
  6. [6]S. H. Chan and R. Mao, Inequalities for ranks of partitions and the first moment of ranks and cranks of partitions, Adv. Math. 258 (2014), 414–437.DOI
  7. [8]S. DeSalvo and I. Pak, Log-concavity of the partition function, Ramanujan J. 38 (2015), 61–73.arxiv.org/abs/1310.7982
  8. [9]J. Dousse and M. H. Mertens, Asymptotic formulae for partition ranks, Acta Arith. 168 (2015), 83–100.arxiv.org/abs/1406.6848
  9. [10]F. J. Dyson, Some guesses in the theory of partitions, Eureka (Cambridge) 8 (1944), 10–15.
  10. [11]F. G. Garvan, New combinatorial interpretations of Ramanujan’s partition congruences mod 5, 7 and 11, Trans. Amer. Math. Soc. 305 (1988), no. 1, 47–77.DOI
  11. [12]K. Q. Ji and W. J. T. Zang, Unimodality of the Andrews–Garvan–Dyson cranks of partitions, Adv. Math. 393 (2021), Article 108053.DOI
  12. [13]B. Kim, E. Kim, and J. Seo, Asymptotics for q-expansions involving partial theta functions, Discrete Math. 338 (2015), no. 2, 180–189.DOI
  13. [14]Z.-G. Liu and N. H. Zhou, Uniform asymptotic formulas for the Fourier coefficients of the inverse of theta functions, Ramanujan J. 57 (2022), 1085–1123.arxiv.org/abs/1903.00835
  14. [15]J.-L. Nicolas, Sur les entiers N pour lesquels il y a beaucoup de groupes abéliens d’ordre N, Ann. Inst. Fourier (Grenoble) 28 (1978), no. 4, 1–16.DOI
  15. [16]N. H. Zhou, Eventual log-concavity of k-rank statistics for integer partitions, J. Number Theory 259 (2024), 242–272.arxiv.org/abs/2110.11174

Paper details

vlnc:W_wwweb3zd
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC0-1.0
Usage

views · 9

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents