Abstract
Euler’s partition theorem states that every integer has as many partitions into odd parts as into distinct parts. In this work, we reveal a new result behind this statement. On one hand, we study the partitions into odd parts according to the residue modulo 4 of the size of those parts occurring an odd number of times. On the other hand, we discuss the partitions into distinct parts with respect to the position of odd parts in the sequence. Some other statistics are also considered together, including the length, alternating sum and minimal odd excludant.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
A partition \(\lambda \) is a finite weakly decreasing sequence of positive integers \(\lambda =(\lambda _1,\lambda _2,\ldots ,\lambda _l)\). The terms \(\lambda _i\) are called the parts of \(\lambda \), and the number of parts of \(\lambda \) is called the length of \(\lambda \), denoted \(\ell (\lambda )\). The weight of \(\lambda \) is the sum of its parts, denoted \(|\lambda |\). We say \(\lambda \) is a partition of n if \(|\lambda |=n\).
An important part of the theory of partitions concerns partition identities, which have a long history starting with Euler’s celebrated partition theorem [8].
Theorem 1.1
The partitions of n into odd parts are equinumerous with the partitions of n into distinct parts.
For convenience, a partition \(\lambda \) is called odd if each part of \(\lambda \) is odd, and distinct if every pair of parts differs by at least one. Let \(\mathcal {O}\) and \(\mathcal {D}\) denote the set of odd and distinct partitions respectively. We next discuss several statistics on partitions and study their joint distribution on \(\mathcal {O}\) and \(\mathcal {D}\).
Given a partition \(\lambda =(\lambda _1,\lambda _2,\ldots ,\lambda _l)\), the alternating sum of \(\lambda \) is defined to be
Denote by \(o(\lambda )\) the number of distinct odd parts occurring an odd number of times in \(\lambda \), and denote by \(n_o(\lambda )\) the number of odd parts in \(\lambda \). Define the minimal odd excludant of \(\lambda \), denoted \(\textrm{moe}(\lambda )\), to be the smallest positive odd integer that is not a part of \(\lambda \). This newer statistic was introduced by Andrews and Newman [2] in 2019, and has many fruitful applications [3, 12, 13]. We now give an example to illustrate these statistics. Let \(\lambda =(7,7,5,5,5,3,2,1,1)\). Then, \(\ell _a(\lambda )=4,o(\lambda )=2,n_o(\lambda )=8\), and \(\textrm{moe}(\lambda )=9\).
Let \(\mathcal {O}_{1,4}\) and \(\mathcal {O}_{3,4}\) be the set of odd partitions with the minimal odd excludant congruent to 1 and 3 modulo 4, respectively. Denote by \(\mathcal {D}_e\) and \(\mathcal {D}_o\) the set of distinct partitions of even and odd length, respectively. The first author of the present paper and Xu [15] presented a strong refinement of Euler’s identity, which reads as follows.
Theorem 1.2
The number of odd partitions of n with length l, m parts occurring an odd number of times and the minimal odd excludant congruent to 1 (respectively, 3) modulo 4 is the same as the number of distinct partitions of n into an even (respectively, odd) number of parts with m odd parts and alternating sum l. Equivalently,
In this paper, we strengthen further Theorem 1.2 by taking into account the relationship between the statistics \(o(\lambda )\) and \(n_o(\pi )\). Given a partition \(\lambda \), let \(o_{1,4}(\lambda )\) and \(o_{3,4}(\lambda )\) denote the number of distinct parts occurring an odd number of times in \(\lambda \) and congruent to 1 and 3 modulo 4, respectively. Clearly, \(o(\lambda )=o_{1,4}(\lambda )+o_{3,4}(\lambda )\). For a partition \(\pi =(\pi _1,\pi _2,\ldots ,\pi _l)\), we call each \(\pi _{2i-1}\) an odd indexed part, and each \(\pi _{2i}\) an even indexed part. Namely, whether \(\pi _i\) is an odd or even indexed part depends on the parity of the subscript i. Let \(n_{o,o}(\pi )\) and \(n_{o,e}(\pi )\) denote the number of odd and even indexed odd parts of \(\pi \), respectively. It is clear that \(n_o(\pi )=n_{o,o}(\pi )+n_{o,e}(\pi )\).
We come to the main result of this work.
Theorem 1.3
The number of odd partitions of n with length l, i parts congruent to 1 modulo 4 and occurring an odd number of times, j parts congruent to 3 modulo 4 and occurring an odd number of times, and the minimal odd excludant congruent to 1 (respectively, 3) modulo 4 is equal to the number of distinct partitions of n into an even (respectively, odd) number of parts with alternating sum l, i odd indexed odd parts and j even indexed odd parts. Equivalently,
We demonstrate Theorem 1.3 for \(n=10\) in Table 1.
Remark 1.4
Over the years, there have been many different refinements of Euler’s theorem; see [5,6,7, 9] and the references therein for more information. Theorem 1.3 is a new refinement of Euler’s result.
The rest of the paper is organized as follows. In Sect. 2, we present some preliminary results, which are useful to our later proofs. The goal of Sect. 3 is to establish the generating function to keep track of the statistics on odd partitions. In Sect. 4, we find an expression for the joint distribution of the statistics on distinct partitions of fixed length, and finish the proof of Theorem 1.3.
2 Preliminaries
Throughout this paper, we use the following standard notation
and always assume that \(|q|<1\).
In this work, we employ some fundamental tools in the theory of q-series. Among the most useful summation formulas is the q-binomial theorem, one special case of which [1, p. 7, Eq. (1.2.4)] is stated as follows.
Lemma 2.1
For \(|z|<\infty \),
We also need the second Heine transformation [1, p. 9, Corollary 1.2.4].
Lemma 2.2
For \(|t|<1\) and \(|c/b|<1\),
where
Another important formula in q-series is the Rogers–Fine identity, which was first proved by Rogers [14] and rediscovered independently by Fine [10].
Lemma 2.3
We have
We now establish some preliminary results, which play a central role in our later proofs.
Lemma 2.4
We have
Proof
Replacing q by \(q^4\) and setting \(a=-xy^{-1}q,b=q^4,c=-xzq^3,t=-xyq\) in (2.2), we get
Replacing x by \(xq^2\) and interchanging y with z in (2.4) produces (2.5). \(\square \)
Theorem 2.5
We have
Proof
Replacing q by \(q^4\) and setting \(a=-q^2/\tau ,b=-xz^{-1}q^3,c=x^2q^{4i+2},t=xz\tau q^{4i+1}\) in (2.2), and then letting \(\tau \rightarrow 0\), we obtain
Employing the above identity, we can derive that
The proof is complete. \(\square \)
Corollary 2.6
We have
Proof
In Theorem 2.5, replacing x by \(xq^2\) and interchanging y with z yields
where we used (2.5) in the last step.
We then multiply both sides of the above identity by
to get the desired result after \(k+1\) replaced by k. \(\square \)
3 Odd Partitions
Let \(O_{1,4}(x,y,z;q)\) and \(O_{3,4}(x,y,z;q)\) be the trivariate generating function defined by
Theorem 3.1
We have
Proof
The generating function for odd partitions with the minimal odd excludant \(4k+1\) is
Summing over all k, we obtain
Replacing q by \(q^4\), and letting \(\alpha =-xy^{-1}q,\beta =-xzq^3,\tau =-xyq\) in the Rogers–Fine identity (2.3), we get
We now arrive at
Similarly, we have
where the last equality was derived by replacing q by \(q^4\) and setting
in the Rogers–Fine identity (2.3).
Combining the above equation and (2.5) together, we get
This completes the proof. \(\square \)
4 Distinct Partitions
For a partition \(\lambda \), let \(n_{e,o}(\lambda )\) and \(n_{e,e}(\lambda )\) be the number of odd and even indexed even parts of \(\lambda \), respectively. Denote by \(\mathcal {D}_k\) the set of distinct partitions of length k, and define
It is straightforward to see that \(D^o_0(x,y,z;q)=1\) and \(D^e_0(x,y,z;q)=1\), and
We next deduce the recurrence for \(D^o_{k}(x,y,z;q)\) and \(D^e_{k}(x,y,z;q)\).
Lemma 4.1
For \(k\ge 1\), we have
Proof
Given a partition \(\lambda =(\lambda _1,\lambda _2,\ldots ,\lambda _{2k})\in \mathcal {D}_{2k}\), define \(\pi \) to be the partition
Clearly, \(\pi \in \mathcal {D}_{2k-1}\).
It is easy to see that \(|\lambda |=|\pi |+2k\lambda _{2k}\) and \(\ell _a(\lambda )=\ell _a(\pi )\). Moreover, we have
and
We now can conclude that
which shows that (4.1) is true. Similarly, we can prove (4.2) and omit the details here.
Letting \(\lambda =(\lambda _1,\lambda _2,\ldots ,\lambda _{2k-1})\in \mathcal {D}_{2k-1}\), define \(\pi \) to be the partition
Obviously, \(\pi \in \mathcal {D}_{2k-2}\).
It is not hard to see that \(|\lambda |=|\pi |+(2k-1)\lambda _{2k-1}\) and \(\ell _a(\lambda )=\ell _a(\pi )+\lambda _{2k-1}\). Furthermore, we have
and
We now can derive that
which proves (4.3). Similarly, we can show that (4.4) is true, and we omit the details here. \(\square \)
Theorem 4.2
For \(k\ge 0\), we have
Proof
We proceed by induction on k. It is trivial for the case where \(k=0\).
We first prove (4.5) and (4.6). It follows from Lemma 4.1 that
and
where we used the matrix notation and matrix product. We now conclude that
We now see that \(D^o_{2k}(x,y,z;q)\) satisfies
Thus, (4.5) is true. We can prove (4.6) in a similar manner, and omit the details here.
We next turn to (4.7) and (4.8). It follows from (4.3) and (4.4) that
Combining the above equation and (4.9) together, we obtain
Now, we can verify that
Therefore, (4.7) is true. A similar argument yields (4.8). \(\square \)
As a consequence of Theorem 4.2, we have the following result.
Corollary 4.3
We have
Proof
Employing (4.5), it is routine to check that
where the last equality follows from Theorem 2.5.
Similarly, we can show that
Applying Corollary 2.6 to the above equality yields the second equation. \(\square \)
We conclude this section with the following result, which shows Theorem 1.3 is true.
Corollary 4.4
We have
Proof
The desired result follows immediately from Theorem 3.1 and Corollary 4.3. \(\square \)
5 Concluding Remarks
It was pointed out by one anonymous referee that Berkovich and Uncu [4] have discussed the location of odd parts in distinct partitions. They established the following elegant result.
Theorem 5.1
The number of distinct partitions of n with i odd indexed odd parts and j even indexed odd parts is the same as the number of distinct partitions of n with i parts congruent to 1 modulo 4 and j parts congruent to 3 modulo 4.
As an immediate consequence of Theorem 1.3 and Theorem 5.1, we get a simple refinement of Euler’s partition theorem.
Corollary 5.2
The set of odd partitions of n with i different parts congruent to 1 modulo 4 and occurring an odd number of times, and j different parts congruent to 3 modulo 4 and occurring an odd number of times is equinumerous with the set of distinct partitions of n with i parts that are congruent to 1 modulo 4, and j parts that are congruent to 3 modulo 4.
In fact, Corollary 5.2 can be easily shown by applying Glaisher’s merging/splitting proof of Theorem 1.1. See [11] for details. If we take other pairs of statistics into account, such as the length of odd partitions and the alternating sum of distinct partitions or the minimal odd excludant of odd partitions and the length of distinct partitions, Corollary 5.2 is no longer true. Namely, Corollary 5.2 cannot be strengthened to be similar in flavor to Theorem 1.3.
Data Availability
Data sharing is not applicable to this article as no datasets were generated or analysed during the current study.
References
G.E. Andrews and B.C. Berndt, Ramanujan’s Lost Notebook, Part II, Springer, 2009.
G.E. Andrews and D. Newman, Partitions and the minimal excludant, Ann. Comb., 23 (2019), 249–254.
G.E. Andrews and D. Newman, The minimal excludant in integer partitions, J. Integer Seq., 23 (2020), Article 20.2.3.
A. Berkovich and A.K. Uncu, On partitions with fixed number of even-indexed and odd-indexed odd parts, J. Number Theory, 167 (2016), 7–30.
C. Bessenrodt, A bijection for Lebesgue’s partition identity in the spirit of Sylvester, Discrete Math., 132 (1994), 1–10.
M. Bousquet-Mélou and K. Eriksson, Lecture hall partitions, Ramanujan J., 1 (1997), 101–110.
W.Y.C. Chen, H.Y. Gao, K.Q. Ji and M.Y.X. Li, A unification of two refinements of Euler’s partition theorem, Ramanujan J., 23 (2010), 137–149.
L. Euler, Introductio in Analysin Infinitorum, Vol. 1, Marcum-Michaelum Bousquet, 1748.
N.J. Fine, Some new results on partitions, Proc. Natl. Acad. Sci. USA, 34 (1948), 616–618.
N.J. Fine, Basic Hypergeometric Series and Applications, American Mathematical Society, 1988.
J.W.L. Glaisher, A theorem in partitions, Messenger Math., 12 (1883), 158–170.
J.Y. Kang, R.Q. Li and A.Y.Z. Wang, A new refinement of Fine’s partition theorem, Bull. Aust. Math. Soc., 104 (2021), 353–361.
J.Y. Kang, R.Q. Li and A.Y.Z. Wang, Partition identities related to the minimal excludant, Discrete Math., 346 (2023), Article 113302.
L.J. Rogers, On two theorems of combinatory analysis and some allied identities, Proc. Lond. Math. Soc., S2-16 (1917), 315–336.
A.Y.Z. Wang and Z. Xu, The minimal odd excludant and Euler’s partition theorem, Int. J. Number Theory, 20 (2024), 1445–1461.
Acknowledgements
The authors would like to thank the anonymous referees for reading the manuscript carefully and providing helpful comments.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of Interest
The authors declare that they have no conflict of interest.
Additional information
Communicated by Jeremy Lovejoy.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Wang, A.Y.Z., Zhang, L. A Multiparameter Refinement of Euler’s Theorem. Ann. Comb. (2024). https://doi.org/10.1007/s00026-024-00713-2
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00026-024-00713-2