Abstract
In this paper, we explore intricate connections between Ramanujan’s theta functions and a class of partition functions defined by the nature of the parity of their parts. This consequently leads us to the parity analysis of the crank of a partition and its correlation with the number of partitions with odd number of parts, self-conjugate partitions, and also with Durfee squares and Frobenius symbols.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
A partition of a positive integer n is a finite non-increasing sequence of positive integers \(\pi _1,\pi _2,\dots ,\pi _r\) such that \(\sum _{i=1}^{r}\pi _i=n\). The \(\pi _i\) are called the parts of the partition. The partition \((\pi _1,\pi _2,\dots ,\pi _r)\) will be denoted by \(\pi \), and we shall write \(\pi \vdash n\) to denote that \(\pi \) is a partition of n. The partition function p(n) is the number of partitions of n. A partition of n has a Durfee square of side s if s is the largest number such that the partition contains at least s parts with values \(\ge s\). One of the more significant results in the elementary theory of partitions is the Euler’s fundamental and beautiful theorem:
Theorem 1.1
[11, Theorem 1.1.10]. The number of partitions of a positive integer n into distinct parts equals the number of partitions of n into odd parts.
Consider the following refinement of Euler’s theorem which is stated above. Let k and n be positive integers with \(k \ge 2\). Then the number of partitions of n into parts which are not multiples of k, denoted by p(n, k), equal to the number of partitions of n into parts with multiplicity of parts \(<k\). For example, there are six partitions enumerated by p(5, 4) are \(5,\ 3+2,\ 3+1+1,\ 2+2+1,\ 2+1+1+1,\ 1+1+1+1+1.\) For \(k=2\), we retrieve Theorem 1.1.
Ramanujan [19, 20] investigated p(n), and discovered congruences in special arithmetic progressions such as:
Define
Ramanujan’s two-variable general theta function is defined as
Three special cases of (1.2) are defined by, in Ramanujan’s notation
Besides the above three functions, Ramanujan defines a further one
which is not a theta function but it plays a prominent role in the theory of theta functions. Following Ramanujan’s definition (1.2), Jacobi’s famous triple product identity [1, Theorem 2.8]
takes the shape
From [10, Entry 31, Equation (31.1)], it follows that we can express f(a, b) as the n-linear combination of theta functions in the following form
For a more comprehensive analysis on Ramanujan’s theta function, we refer to [10, Chapter 16]. We shall subsequently present two results, namely Lemma 1.2 (resp. Lemma 1.3) for 5-dissection of \(f(-q)\) (resp. \(1/f(-q)\)). Ramanujan defined what was later called the Rogers–Ramanujan continued fraction
Lemma 1.2
[11, p. 161 and p. 164]. If \(T(q):=\frac{q^{1/5}}{R(q)}=\frac{f(-q^2,-q^3)}{f(-q,-q^4)}\),
Lemma 1.3
[11, p. 165, Equation (7.4.14)].
In 1944, Dyson [14] discovered a beautiful combinatorial interpretation for the congruences of p(n) modulo 5 and 7 by introducing the concept of the rank of integer partitions and later, Andrews and Garvan [7] defined and established the crank, hypothesized by Dyson, to give a combinatorial proof of congruence for p(n) modulo 11 (1.1).
Definition 1.4
([7]). For a partition \(\pi \), let \(l(\pi )\) denote the largest part of \(\pi \), \(w(\pi )\) denote the number of 1s in \(\pi \) and \(\mu (\pi )\) denote the number of parts of \(\pi \) that are larger than \(w(\pi )\). The crank \(c(\pi )\) is given by
Let \(c_{e}(n)\) (resp. \(c_{o}(n)\)) be the number of partitions of n with even (resp. odd) crank and further, let \(c_{e,o}(n)\) be the difference between \(c_{e}(n)\) and \(c_{o}(n)\) [2, Equation (6.2)]. The study on \(c_{e,o}(n)\) began with the work of Andrews and Lewis [8]. Further investigation on \(c_{e,o}(n)\) which describes both combinatorial results and analytic ones which include Ramanujan type congruences modulo powers of 5 and classical asymptotic formula were introduced in the work of Choi, Kang, and Lovejoy [13]. We find in Andrews’ [2, Section 6] how Ramanujan’s third-order mock theta functions \(\phi _{3}(q)\) and \(\psi _{3}(q)\) also come into prominence in the study of classical ranks and cranks in partitions.
Definition 1.5
([16]). The Frobenius symbol is obtained through extraction from the Ferrers graph of a partition \(\pi \) as follows: We delete the diagonal of the Ferrers graph. If the diagonal is of length j, we form the top row of the Frobenius symbol using the nodes to the right of the diagonal and similarly form the bottom row from the nodes below the diagonal. The Frobenius symbol of \(\pi \) is denoted by \(\mathfrak {F}(\pi )\).
For instance, in the partition \(\pi = (7,4,4,2,1)\vdash 18\), the Ferrers graph is
and correspondingly the Frobenius symbol \(\mathfrak {F}(\pi )\) is \(\begin{pmatrix} 6 &{}\quad 2 &{}\quad 1 \\ 4 &{}\quad 2 &{}\quad 0 \end{pmatrix}\).
Ramanujan’s theta functions are the central theme of this paper. At the very outset, we establish a few partition identities where restrictions are imposed on the partition functions based on the parity of parts and their correlation to the aforementioned theta functions. A slew of investigations have been carried out on the parity study of partitions in recent years. Andrews’ [3] studied on the parts of partitions that are separated by parity, either all odd parts are smaller than all even parts or vice versa. Bringmann and Jennings-Shaffer [12] have extended the work of Andrews’ with a thorough q-series analysis that finally connects the parity study of partitions to the regime of partial theta functions, Ramanujan’s third-order mock theta function \(\nu (q)\), and combinatorial interpretation by hook-type statistics in [9]. We will see how the parity biases of parts in partitions entangled with partitions with multiplicity of parts less than or equals to 4, denoted by p(n, 4), finally connect very naturally to Ramanujan’s theta functions. We undertake a detailed study on the parity of cranks through the lens of Ramanujan’s theta functions (see Theorems 1.6 and 1.7 below). Next, we examine the parity and associated congruence properties of the function delineating the difference between even and odd cranks of partitions (see Theorem 1.8). We prove a congruence modulo 5 for \(c_{e,o}(n)\) by analyzing 5-dissection of Ramanujan’s theta functions which in turn shows that an arithmetic progression of the sequence \(c_{o}(n)\) is divisible 10 (see Theorem 1.9), without using the machinations of modular forms, as given in [13, Theorem 1.2]. The novelty of Theorem 1.10 is that it identifies the odd crank enumeration of partitions with those partitions into odd number of parts and self-conjugate partitions through Liouville’s function \(\lambda \). Following the work done in [6, 18], Theorem 1.11 springs up rather organically. Here, we count Frobenius symbols with restrictions on the entries and equate them to the enumeration of number of partitions with no parts that equal the size of the Durfee square of that partition, two ideas in the theory of partitions that are very rarely correlated.
The rest of this paper is organized as follows: in the remaining part of this section, we shall state all the main results, see Theorems 1.6–1.11. Before presenting the theorems, we shall provide all the necessary definitions, sometimes with examples, so as to ease the stating of the theorems. The proofs of Theorems 1.6–1.11 are given in Sect. 2.
We consider partitions whose odd parts unrestricted (resp. even parts distinct) tagged by couplet “ou” (resp. “ed”). Let \(p_{ou,ed}(n)\) denote the number of partitions of n such that odd parts are unrestricted and even parts are distinct and \(\mathcal {E}_{u}(n)\) denote the number of partitions of n such that even parts are unrestricted and each positive even integer smaller than the largest even part must appear as a part of the partition. As an instance, the six partitions enumerated by \(p_{ou,ed}(5)\) are \(5,\ 4+1,\ 3+2,\ 3+1+1,\ 2+1+1+1,\ 1+1+1+1+1\) and those for \(\mathcal {E}_{u}(5)\) are \(5,\ 3+2,\ 3+1+1,\ 2+2+1,\ 2+1+1+1,\ 1+1+1+1+1.\)
Theorem 1.6
Let
Then, we have
\(\mathcal {O}_{d}(n)\) denote the number of partitions of n such that the odd parts are distinct and each positive odd integer smaller than the largest odd part must appear as a part of the partition. For example, the six partitions enumerated by \(\mathcal {O}_{d}(9)\) are \(8 + 1,\ 6 + 2 + 1,\ 4 + 4 + 1,\ 4 + 2 + 2 + 1,\ 5 + 3 + 1.\)
Theorem 1.7
Theorem 1.8
Moreover based on the numerical evidences, it seems that for all \(n \ge 0\),
This has been checked up to \(n = 2000\). We leave this as an open problem.
Theorem 1.9
and
Following Fine’s notation [15, Ch. 2, Example 2], we define \(p_{E}(n)\) (\(p_{O}(n)\), respectively) to be the number of partitions of n into even (odd, respectively) number of parts. We recall one of the classical completely multiplicative function, Liouville’s function \(\lambda \), defined by
Theorem 1.10
For all \(n \in \mathbb {Z}_{\ge 2}\),
where sc(n) denotes the number of self-conjugate partitions of n.
As our proof of Theorem 1.10 primarily relies on comparing coefficients of a certain q-series identity, we would like to ask if there a bijective proof of Theorem 1.10. Next we move on to the last theorem of this paper. Let \(p (n, \Box )\) denote the number of partitions of n, where the side of the Durfee square does not occur as a part of the partition. For example, consider the partitions of 8: the partition 8 with side of Durfee square one and the partitions \(5+3,\ 4+4,\ 4+3+1,\ 3+3+1+1\) with side of Durfee square two are altogether five partitions of 8 where the side of respective Durfee square is not a part of those partitions of 8.
Define \(\mathfrak {F}_{0}(n)\) (resp. \(\mathfrak {F}^{'}_{0}(n)\)) to be the number of 0s in the Frobenius symbols in the partitions of n (resp. the numbers of Frobenius symbols for the partitions of n with no 0s). For instance, \(\mathfrak {F}_{0}(8)=20\) and \(\mathfrak {F}^{'}_{0}(7)=5\) enumerated by the Frobenius symbols
Theorem 1.11
\(p (n, \Box ) = \frac{1}{2}\mathfrak {F}_{0}(n) - \mathfrak {F}^{'}_{0}(n-1)\).
2 Proof of Theorems
Proof of Theorem 1.6
We begin the proof with following identity
that establishes \(p(n,4)=p_{ou,ed}(n)\). The generating function of \(\mathcal {E}_{u}(n)\) is given by
We note that \(\frac{1}{(q;q^2)_{\infty }}\) contributes to all the odd parts that occur in \(\mathcal {E}_{u}(n)\) and \(\frac{q^{2+4+\dots +2n}}{(q^2;q^2)_{n}}\) counts all those partitions in which even parts are unrestricted and every positive even integer smaller than the greatest even part occurs as a part. Applying \(z\mapsto -q\) into the following identity [11, Corollary 1.3.2, Equation (1.3.7)]:
we obtain
Now following the substitution \(q\mapsto q^2\) in (2.3) and from (2.2), it follows that
Putting down (2.1) and (2.5) together, it follows that
To prove the remaining part of (1.8), we start with
Applying \(q\mapsto -q\) into (2.7), we get
Now
From (2.8) and (2.9), it follows that
The q-series identities (2.6) and (2.10) conclude the proof of Theorem 1.6.
Proof of Theorem 1.7
From [3, Equation (3.1)], it follows that
Applying (1.4) with \(n=2\) and \(a=b=q\), we have
From (1.4) and (2.11), it follows that
and therefore,
Dividing by q and then replacing \(q^2\) by q in (2.14), we finally have
which finishes the proof of Theorem 1.7. \(\square \)
Proof of Theorem 1.8
To prove Theorem 1.8, it suffices to show that
as \(c_{e}(n)+c_{o}(n)=p(n)\). Due to Euler [11, Equation (1.1.7)], we have
From [7, p. 168, Equation (1.11)] with \(z=-1\), it follows that
From [5, Entry 3.1.1] with \(a=-1\), it follows that
with
Substituting (2.19) and (2.20) into (2.18), we have
Now, it can be easily observed that the right hand side of the above equation is of the form \(\sum _{n=0}^{\infty }a_n q^n\) with \((a_n)_{n \ge 0}\) a sequence of even integers; i.e., \(c_o(n) \equiv 0\ (\text {mod}\ 2)\) which concludes the proof of Theorem 1.8. \(\square \)
Proof of Theorem 1.9
We shall make use of the 5-dissections of \((q;q)^{3}_{\infty }\) and \(\frac{1}{(q^2;q^2)^2_{\infty }}\) as we rewrite (2.17) in the following way:
Applying (1.6) of Lemma 1.2, we have
where \(A_{i}\) consists of terms in which powers of q congruent to i modulo 5 can be written as follows
For the 5-dissection of \(\frac{1}{(q^2;q^2)^2_{\infty }}\), first let \(q \mapsto q^2\) and then by squaring both sides of (1.7), it follows that
Similar to (2.23), we write
with
Consequently by (2.23) and (2.26), it follows that
Finally, we plug in (2.24) and (2.27) into (2.28), and then substitute \(q^{5} \mapsto q\). This is followed by division on both side by \(q^{4}\), and hence we obtain:
This implies that \(c_{e,o}(5n+4) \equiv 0\ (\text {mod}\ 5)\) as claimed in (1.9). Now,
and
imply that for all \(n \ge 0\),
We have already proved that for all \(n \ge 0\), \(c_{o}(n) \equiv 0\ (\text {mod}\ 2)\), see (2.15), which in particular states that for all \(n \ge 0\),
From (2.30) and (2.31), it follows that \(c_{o}(5n+4) \equiv 0\ (\text {mod}\ 10)\) which finishes the proof of (1.10). \(\square \)
Proof of Theorem 1.10
From [15, Ch. 2, Equation (22.14)], we get
As \(p_{E}(n)+p_{O}(n)=p(n)\) and \(\sum _{n=0}^{\infty }p(n)q^n=1/(q;q)_{\infty }\), from (2.32), it follows that
Due to Glaisher [17, XVI, p. 256],
Recall the identity due to Gauss [1, Corollary 2.10, Equation (2.2.12)] which states that
Now
From (2.36), for all \(n \in \mathbb {Z}_{\ge 2}\), it follows that
where
Due to [4, Theorem 2.19], we know that
Combining (2.37) and (2.38), we conclude the proof of Theorem 1.10. \(\square \)
Proof of Theorem 1.11
Due to Euler [1, Corollary 2.6, Equation (2.2.9)], we have
where the \(n^{\text {th}}\) term of (2.39) \(\frac{q^{n^2}}{(q;q)^{2}_{n}}\) is the generating function for those partitions with Durfee square of side n. We observe that the generating function for \(p (n, \Box )\) is
For \(j \in \mathbb {Z}\), associated with enumeration of crank statistics given in (1.4), we define
By [18, Proposition 6 and Theorem 7], we rewrite the last line of (2.40) as
Finally, we conclude the proof of Theorem 1.11 by showing that
\(\square \)
Data Availability
No data were generated or used in the preparation of this paper.
References
G.E. Andrews, The Theory of Partitions, Addison-Wesley Pub. Co., NY, 300 pp. (1976). Reissued, Cambridge University Press, New York, 1998.
G.E. Andrews, Integer partitions with even parts below odd parts and the mock theta functions, Ann. Comb. 22 (2018), 433–445.
G.E. Andrews, Partitions with Parts Separated by Parity, Ann. Comb. 23 (2019), 241–248.
T.M. Apostol, Introduction to analytic number theory. Springer Science and Business Media, 1998.
G.E. Andrews and B.C. Berndt, Ramanujan’s Lost Notebook, Part III. Springer, New York, 2012.
G.E. Andrews, M.G. Dastidar and T. Morrill, A Stanley-Elder theorem on cranks and Frobenius symbols, Res. in Numb. Theory 7, 56 (2021).
G.E. Andrews and F.G. Garvan, Dyson’s crank of a partition, Bull. Amer. Math. Soc. (N.S.) 18(2) (1988), 167–171.
G.E. Andrews and R. Lewis, The ranks and cranks of partitions moduli 2, 3, and 4, J. Number Theory. 85 (2000), 74–84.
K. Banerjee and M.G. Dastidar, Hook type tableaux and partition identities, preprint, (2021).
B.C. Berndt, Ramanujan’s Notebooks, Part III, Springer-Verlag, New York, 1991.
B.C. Berndt, Number Theory in the Spirit of Ramanujan, Amer. Math. Soc., Providence, RI, 2006.
K. Bringmann and C. Jennings-Shaffer, A note on Andrews’ partitions with parts separated by parity. Ann. Comb., 23(3), 573–578, (2019).
D. Choi, S.Y. Kang and J. Lovejoy, Partitions weighted by the parity of the crank. J. Combin. Theory Ser. A, 116(5), 1034–1046, (2009).
F.J. Dyson, Some guesses in the theory of partitions, Eureka (Cambridge). 8, 10–15, (1944).
N.J. Fine, Basic hypergeometric series and applications, No. 27. Amer. Math. Soc., 1988.
G. Frobenius, Über die Charaktere der symmetrischen Gruppe, Sitzungsberichte derAkademie der Wiss. zu Berlin, (1900) 516–534.
J.W.L. Glaisher, On formulae of verification in the partition of numbers, Proc. Roy. Soc., London 24 (1876), 250–259.
B. Hopkins, J.A. Sellers and D. Stanton, Dyson’s crank and the mex of integer partitions, J. Combin. Theory Ser. A, 185, p. 105523.
S. Ramanujan, Congruence properties of partitions, Proc. London Math. Soc. (2) 19, 207–210.
S. Ramanujan, Ramanujan’s unpublished manuscript on the partition and tau-functions (Commentary by B. C. Berndt and K. Ono) The Andrews Festschrift (Ed. D. Foata and G.-N. Han), Springer-Verlag, Berlin, 2001, 39–110.
Acknowledgements
The first author would like to acknowledge that the research was funded by the Austrian Science Fund (FWF): W1214-N15, project DK6. The authors thank the referee for a very careful reading of the manuscript and for their helpful suggestions which improved this paper significantly.
Funding
Open access funding provided by Austrian Science Fund (FWF).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of Interest
The authors confirm that they have no conflict of interest in connection with this paper.
Additional information
Communicated by Ken Ono.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Banerjee, K., Dastidar, M.G. Ramanujan’s Theta Functions and Parity of Parts and Cranks of Partitions. Ann. Comb. 27, 565–578 (2023). https://doi.org/10.1007/s00026-022-00615-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00026-022-00615-1