On Andrews' integer partitions with even parts below odd parts
Chiranjit Ray, Rupam Barman

TL;DR
This paper investigates the properties of Andrews' partition functions related to partitions with specific even and odd part constraints, establishing congruences, parity results, and divisibility properties using modular form techniques.
Contribution
It proves infinite families of congruences and parity results for the partition function ar{ ext{EO}}(n), and demonstrates divisibility properties of Uncu's related partition function.
Findings
Infinite congruences for ar{ ext{EO}}(n)
Infinitely many even and odd values of ar{ ext{EO}}(n) in arithmetic progressions
Divisibility by powers of 2 for Uncu's partition function
Abstract
Recently, Andrews defined a partition function which counts the number of partitions of in which every even part is less than each odd part. He also defined a partition function which counts the number of partitions of enumerated by in which only the largest even part appears an odd number of times. Andrews proposed to undertake a more extensive investigation of the properties of . In this article, we prove infinite families of congruences for . We next study parity properties of . We prove that there are infinitely many integers in every arithmetic progression for which is even; and that there are infinitely many integers in every arithmetic progression for which isβ¦
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
On Andrewsβ integer partitions with even parts below odd parts
Chiranjit Ray
Harish-Chandra Research Institute, Prayagraj (Allahabad), India, PIN-211019
Β andΒ
Rupam Barman
Department of Mathematics, Indian Institute of Technology Guwahati, Assam, India, PIN- 781039
(Date: Revised: January 3, 2020)
Abstract.
Recently, Andrews defined a partition function which counts the number of partitions of in which every even part is less than each odd part. He also defined a partition function which counts the number of partitions of enumerated by in which only the largest even part appears an odd number of times. Andrews proposed to undertake a more extensive investigation of the properties of . In this article, we prove infinite families of congruences for . We next study distribution of . We prove that there are infinitely many integers in every arithmetic progression for which is even; and that there are infinitely many integers in every arithmetic progression for which is odd so long as there is at least one. We further prove that is even for almost all . Very recently, Uncu has treated a different subset of the partitions enumerated by . We prove that Uncuβs partition function is divisible by for almost all . We use arithmetic properties of modular forms and Hecke eigenforms to prove our results.
Key words and phrases:
Partitions; congruences; modular forms; Hecke eigenforms
1991 Mathematics Subject Classification:
Primary 05A17, 11P83
We thank Professor Scott Ahlgren who helped us in finding a proof of an important step in Theorem 1.2. We also thank the referee for helpful comments. The first author acknowledges the financial support of Department of Atomic Energy, Government of India and Harish-Chandra Research Institute for providing research facilities.
1. Introduction and statement of results
A partition of a nonnegative integer is a nonincreasing sequence of positive integers whose sum is . In a recent paper, Andrews [1] studied the partition function which counts the number of partitions of where every even part is less than each odd part. He denoted by , the number of partitions counted by in which only the largest even part appears an odd number of times. For example, with the relevant partitions being ; and , with the relevant partitions being .
Andrews proved that the partition function has the following generating function [1, Eqn. (3.2)]:
[TABLE]
where . In the same paper, he proposed to undertake a more extensive investigation of the properties of . The objective of this paper is to study divisibility properties of . To be specific, we use the theory of Hecke eigenforms to establish the following two infinite families of congruences for modulo and , respectively.
Theorem 1.1**.**
Let be nonnegative integers. For each with , if is prime such that , then for any integer
[TABLE]
Let be a prime such that . By taking all the primes to be equal to the same prime in Theorem 1.1, we obtain the following infinite family of congruences for :
[TABLE]
where . In particular, for all and , we have
[TABLE]
Theorem 1.2**.**
Let be nonnegative integers. For each with , if is prime such that , then for any integer
[TABLE]
Let be a prime such that and . By taking all the primes to be equal to the same prime in Theorem 1.2, we obtain the following infinite family of congruences for :
[TABLE]
where . In particular, if we choose , then and . Using Mathematica we verify that . Thus, for all and , we have
[TABLE]
In [1], Andrews proved that, for all
[TABLE]
In this article, we prove that the congruence (1.2) is also true modulo if . To be specific, we prove the following result.
Theorem 1.3**.**
Let . Then for all we have
[TABLE]
We note that Theorem 1.3 is not true if . For example, is not divisible by .
For a nonnegative integer , let denote the number of partitions of . In [12], Ono proved that there are infinitely many integers in every arithmetic progression for which is even; and that there are infinitely many integers in every arithmetic progression for which is odd so long as there is at least one. Onoβs result gave an affirmative answer to a well-known conjecture on parity of in an arithmetic progression. In the following theorem, we prove the same for the partition function . We note that for all .
Theorem 1.4**.**
For any arithmetic progression , there are infinitely many integers for which is even. Also, for any arithmetic progression , there are infinitely many integers for which is odd, provided there is one such . Furthermore, if there does exist an for which is odd, then the smallest such is less than
[TABLE]
where and
A well-known conjecture of Parkin and Shanks [13] states that the even and odd values of are equally distributed, that is,
[TABLE]
where . Little is known regarding this conjecture. In the following theorem we prove that is almost always even.
Theorem 1.5**.**
Let . Then is almost always divisible by , namely,
[TABLE]
Recently, Uncu [17] has treated a different subset of the partitions enumerated by . Also see [1, p. 435]. We denote by the partition function defined by Uncu, and the generating function is given by
[TABLE]
For any fixed positive integer , Gordon and Ono [5] proved that the number of partitions of into distinct parts is divisible by for almost all . Similar studies are done for some other partition functions, for example see [2, 4, 9, 16]. In this article, we study divisibility of the partition function by . To be specific, we prove the following result.
Theorem 1.6**.**
Let be a positive integer. Then is almost always divisible by , namely,
[TABLE]
2. Preliminaries
In this section, we recall some definitions and basic facts on modular forms. For more details, see for example [11, 7]. We first define the matrix groups
[TABLE]
and
[TABLE]
where is a positive integer. A subgroup of is called a congruence subgroup if for some . The smallest such that is called the level of . For example, and are congruence subgroups of level . The index of in is
[TABLE]
where denotes a prime.
Let be the upper half of the complex plane. The group
[TABLE]
acts on by . We identify with and define , where . This gives an action of on the extended upper half-plane . Suppose that is a congruence subgroup of . A cusp of is an equivalence class in under the action of .
The group also acts on functions . In particular, suppose that . If is a meromorphic function on and is an integer, then define the slash operator by
[TABLE]
Definition 2.1**.**
Let be a congruence subgroup of level . A holomorphic function is called a modular form with integer weight on if the following hold:
- (1)
We have
[TABLE]
for all and all . 2. (2)
If , then has a Fourier expansion of the form
[TABLE]
where . That is, is holomorphic at all the cusps of .
For a positive integer , the complex vector space of modular forms of weight with respect to a congruence subgroup is denoted by . A modular form is called a cusp form if vanishes at all the cusps of . The subspace of consisting of cusp forms is denoted by .
Definition 2.2**.**
[11, Definition 1.15] If is a Dirichlet character modulo , then we say that a modular form has Nebentypus character if
[TABLE]
for all and all . The space of such modular forms is denoted by . The corresponding space of cusp forms is denoted by . If is the trivial character then we write and for short.
Recall that Dedekindβs eta-function is defined by
[TABLE]
where and . A function is called an eta-quotient if it is of the form
[TABLE]
where is a positive integer and is an integer.
We now recall two theorems from [11, p. 18] which will be used to prove our result.
Theorem 2.3**.**
[11, Theorem 1.64 and Theorem 1.65]** If is an eta-quotient such that ,
[TABLE]
and
[TABLE]
then satisfies
[TABLE]
for every . Here the character is defined by . In addition, if and are positive integers with and , then the order of vanishing of at the cusp is .
Suppose that is an eta-quotient satisfying the conditions of Theorem 2.3. If is holomorphic at all of the cusps of , then .
Definition 2.4**.**
Let be a positive integer and . Then the action of Hecke operator on is defined by
[TABLE]
In particular, if is prime, we have
[TABLE]
We note that unless is a nonnegative integer.
Definition 2.5**.**
A modular form is called a Hecke eigenform if for every there exists a complex number for which
[TABLE]
3. Proof of Theorems 1.1 and 1.2
We use the theory of Hecke eigenforms to prove Theorems 1.1 and 1.2.
Proof of Theorem 1.1.
We have
[TABLE]
This gives
[TABLE]
Let Then if and for all ,
[TABLE]
By Theorem 2.3, we have . Since is a Hecke eigenform (see, for example [10]), (2.1) and (2.2) yield
[TABLE]
which implies
[TABLE]
Putting and noting that , we readily obtain . Since for all , we have . From (3.2), we obtain
[TABLE]
From (3.3), we derive that for all and ,
[TABLE]
and
[TABLE]
Substituting by in (3.4) and together with (3.1), we find that
[TABLE]
Substituting by in (3.5) and using (3.1), we obtain
[TABLE]
Since is prime, so and . Hence when runs over a residue system excluding the multiple of , so does . Thus (3.6) can be rewritten as
[TABLE]
where .
Now, are primes such that . Since
[TABLE]
using (3.7) repeatedly we obtain that
[TABLE]
Let . Then (3.8) and (3.9) yield
[TABLE]
This completes the proof of the theorem. β
To prove Theorem 1.2, we need that the eta-quotient is an eigenform for the Hecke operators , where . This has been observed to be true by Scott Ahlgren. We now present below the proof given by Ahlgren which was communicated to us through an email. Let , , , and . Then is supported on exponents congruent to . The Hecke operators for annihilate each of these forms. The Hecke operators for map to a multiple of , where . It turns out that a linear combination of the forms is an eigenform of all of the Hecke operators. In [8, p. 209], equation (13.84) expresses the linear combination as an eigenform. Since the are supported on distinct classes of coefficients, it follows that are eigenforms of all the Hecke operators.
Proof of Theorem 1.2.
We first recall the following -dissection formula from [3, Entry 25, p. 40]:
[TABLE]
From (1.1), we have
[TABLE]
Combining (5.1) and (5.2), and then extracting the terms with odd powers of , we deduce that
[TABLE]
We again combine (5.1) and (5.3), and then extract the terms with odd powers of to obtain
[TABLE]
Since , we have
[TABLE]
This gives
[TABLE]
Let . It is clear that if Also, for all ,
[TABLE]
By Theorem 2.3, we have . Since is a Hecke eigenform for the Hecke operator , where , (2.1) and (2.2) yield
[TABLE]
Putting in (3.14) and noting that , we obtain . Also, , and hence . Thus (3.14) gives
[TABLE]
From (3.15), we obtain that for all and ,
[TABLE]
and
[TABLE]
Let . Let be a prime such that . Now, replacing by in (3.17), we obtain
[TABLE]
We note that . Hence when runs over a residue system excluding the multiple of , so does . Thus, (3.18) can be rewritten as
[TABLE]
where . Similarly, replacing by in (3.16), we have, modulo
[TABLE]
Let be such that . Then, using the relation , we have . Hence, (3.19) and (3.20) imply
[TABLE]
and
[TABLE]
From our hypothesis, we have are primes such that and . Now, using (3.22) we deduce that
[TABLE]
Replacing by , and then using (3.21) we obtain
[TABLE]
We complete the proof by using the fact that . β
4. Proof of Theorem 1.3
We prove Theorem 1.3 using the approach developed in [14, 15]. To this end, we first recall some definitions and results from [14, 15]. For a positive integer , let be the set of integer sequences indexed by the positive divisors of . If and are the positive divisors of , we write . Define by
[TABLE]
The approach to proving congruences for developed by Radu [14, 15] reduces the number of cases that one must check as compared with the classical method which uses Sturmβs bound alone.
Let be a positive integer. For any integer , let denote the residue class of in . Let be the set of all invertible elements in . Let be the set of all squares in . For and , we define a subset by
[TABLE]
Definition 4.1**.**
Suppose and are positive integers, and . Let and write
[TABLE]
where and are nonnegative integers with odd. The set consists of all tuples satisfying these conditions and all of the following.
- (1)
Each prime divisor of is also a divisor of . 2. (2)
implies for every such that . 3. (3)
. 4. (4)
. 5. (5)
divides . 6. (6)
If , then either and or and .
Throughout this section we take . Let be positive integers. For , and , set
[TABLE]
and
[TABLE]
Lemma 4.2**.**
[14, Lemma 4.5]** Let be a positive integer, and . Let be a complete set of representatives of the double cosets of . Assume that for all . Let and
[TABLE]
If the congruence holds for all and , then it holds for all and .
To apply Lemma 4.2 we utilize the following result, which gives a complete set of representatives of the double cosets in .
Lemma 4.3**.**
[18, Lemma 4.3]** If or is a square-free integer, then
[TABLE]
Proof of Theorem 1.3.
Due to (1.2) we need to prove our congruences modulo only. We have
[TABLE]
Let . It is easy to verify that and . From Lemma 4.3 we know that forms a complete set of double coset representatives of . Let . We have used to verify that for each , where . We compute that the upper bound in Lemma 4.2 is . Using we verify that for and . Thus, by Lemma 4.2, we conclude that for any , where . This completes the proof of the theorem. β
5. Proof of Theorems 1.4, 1.5 and 1.6
We prove Theorem 1.4 by using the approach developed in [12]. Recently, Jameson and Wieczorek [6] have done a similar study for the generalized Frobenius partitions. To make this paper self-contained, we recall two results from [6]. Also see [12]. Let denote the space of weakly holomorphic modular forms.
Theorem 5.1**.**
[6, Theorem 5]** Let be integers with positive, and let
[TABLE]
where are algebraic integers in some number field. For any arithmetic progression , there are infinitely many integers for which is even.
Theorem 5.2**.**
[6, Theorem 6]** Let be integers with positive, and , and let
[TABLE]
where are algebraic integers in some number field. For any arithmetic progression , there are infinitely many integers for which is odd, provided there is one such .
Furthermore, if there does exist an for which is odd, then the smallest such is less than for
[TABLE]
where , , and is a sufficiently large integer.
Proof of Theorem 1.4.
We have
[TABLE]
We rewrite the above identity in terms of -quotients, and then use the binomial theorem to obtain
[TABLE]
By Theorem 2.3, we have
[TABLE]
Let , where . The cusps of are represented by fractions where and . Now, vanishes at the cusp if and only if
[TABLE]
We have
[TABLE]
Hence, if is an integer such that , then Finally, our desired result follows immediately by applying Theorems 5.1 and 5.2 to . β
Proof of Theorem 1.5.
We first recall the following -dissection formula from [3, Entry 25, p. 40]:
[TABLE]
From (1.1), we have
[TABLE]
Combining (5.1) and (5.2), and then extracting the terms with odd powers of , we deduce that
[TABLE]
We again combine (5.1) and (5.3), and then extract the terms with odd powers of to obtain
[TABLE]
Since , we have
[TABLE]
We rewrite the above equation in terms of -quotients and obtain
[TABLE]
Let . Then, . Also, let . Then we have
[TABLE]
The cusps of are represented by fractions where and . By Theorem 2.3, is holomorphic at the cusp if and only if
[TABLE]
Now,
[TABLE]
Hence, by Theorem 2.3, .
Let be a positive integer. By a deep theorem of Serre [11, p. 43], if has Fourier expansion
[TABLE]
then there is a constant such that
[TABLE]
Since , the Fourier coefficients of are almost always divisible by . Hence, using (5.5) and (5.4) we complete the proof of the theorem. β
Proof of Theorem 1.6.
The generating function of is given by
[TABLE]
We note that is a power series of . As in the proof of Theorem 1.5, let
[TABLE]
Then using binomial theorem we have
[TABLE]
Define by
[TABLE]
Modulo , we have
[TABLE]
Combining (5.6) and (5.9), we obtain
[TABLE]
The cusps of are represented by fractions where and . By Theorem 2.3, it is easily seen that is a form of weight on . Therefore, if and only if is holomorphic at the cusp . We know that is holomorphic at a cusp if and only if
[TABLE]
Now,
[TABLE]
Hence, . Now, using Serreβs theorem [11, p. 43] as shown in the proof of Theorem 1.5, we arrive at the desired result due to (5.10). β
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] G. E. Andrews, Integer partitions with even parts below odd parts and the mock theta functions , Ann. Comb. 22 (2018), 433β445.
- 2[2] R. Barman and C. Ray, Divisibility of Andrewsβ singular overpartitions by power of 2 and 3 , Res. Number Theory 5, article no. 22 (2019).
- 3[3] B. C. Berndt, Ramanujanβs Notebooks, Part III , Springer-Verlag, New York (1991).
- 4[4] K. Bringmann and J. Lovejoy, Rank and congruences for overpartition pairs , Int. J. Number Theory 4 (2008), 303β322.
- 5[5] B. Gordon and K. Ono, Divisibility of certain partition functions by powers of primes , Ramanujan J. 1 (1997), 25β34.
- 6[6] M. Jameson and M. Wieczorek, Congruences for modular forms and generalized Frobenius partitions , Ramanujan J. (2019). doi: 10.1007/s 11139-019-00174-9.
- 7[7] N. Koblitz, Introduction to elliptic curves and modular forms , Springer-Verlag, New York (1991).
- 8[8] G. KΓΆhler, Eta products and theta series identities , Springer Monograph in Mathematics, Springer-Verlag (2011).
