arXiv:2010.09881v2 [math.CO] 13 Jul 2021 iaoiso attos ieysuidfrteraihei propert arithmetic their for studied widely partitions, of binatorics ento 1. formally: Definition it define We coefficients. odd its of hi offiins hnw a eishsdensity has concerns series area, a say this we in When research coefficients. ongoing their of deal great a motivated powe the two. present the conflate not often does we precisely typically calculating interest combinatorial most of Q ommdl ;rglrpriin t-utet aiyo h part the of parity eta-quotient; partition; regular 2; modulo form limit o integers for (1) i ∞ t-utet r udmna bet nteter fmodular of theory the in objects fundamental are Eta-quotients n ftems hlegn n neetn usin eadn eta regarding questions interesting and challenging most the of One 2010 e od n phrases. and words Key =1 AIYO H OFIINSO ETI ETA-QUOTIENTS CERTAIN OF COEFFICIENTS THE OF PARITY (1 ahmtc ujc Classification. Subject Mathematics xmnn h aeof case the examining ugsigals fseicrsac ietosfrftr investig future for the directions throughout research questions specific of open list other a several suggesting pose We classica function. Parkin-Shanks’ extending greatly eta-quotients, trary impossible. are results such that conjecture or ones, previous iiaiismdl ;adifiiefmle fcnrecsi rtmtcpr arithmetic in congruences specified of for families 2 infinite all and modulo 2; lacunarity modulo establishing similarities particular in values, odd Abstract. − l forwr scnitn ihanw vrrhn ojcueth conjecture overarching new, a with consistent is work our of All m q ji 1. ≤ α ,te an then ), i 8 eete sals e eut fteetpsweenn were none where types these of results new establish either we 28, nrdcinadSaeeto h anConjecture Main the of Statement and Introduction and h oe series power The eivsiaeteprt ftececet fcraneta-quotien certain of coefficients the of parity the investigate We γ i oiieaddistinct, and positive atto ucin binary function; Partition eta-quotient ILA .KIHADFBII ZANELLO FABRIZIO AND KEITH J. WILLIAM x lim →∞ m F rglrpriin.Orterm ocr h est ftheir of density the concern theorems Our partitions. -regular x 1 ( q # = ) { f a ( ( q q safnto fteform the of function a is n = ) (1 : ) rmr:1P3 eodr:0A7 18,1P2 11F33. 11P82, 11P84, 05A17, Secondary: 11P83; Primary: / 24)( n P P ≤ n ∞ α =0 ,a x, q r i 1 r sre;dniyodvle;priiniett;modular identity; partition values; odd density -series; i i s , a − ( P i n ( n ) > γ δ i q ) s eaesekn ftentrldensity natural the of speaking are we , n i ≡ ,and 0, ) Q Q ssi ohave to said is to function. ition md2) (mod 1 i u i t =1 =1 f f ojcuefrtepartition the for conjecture l ,t u, α γ r s i i i i tosi hsarea. this in ations , ae,adcnld by conclude and paper, ≥ } tw rsn o arbi- for present we at h td fteprt of parity the of study the .Terltdfunction related The 0. hf,adwe not when and shift, r od density (odd) e.I elet we If ies. qoins hc has which -quotients, offiins self- coefficients; om n h com- the and forms gesos For ogressions. nw,extend known, s extensively ts, δ f fthe if j := 2 WILLIAMJ.KEITHANDFABRIZIOZANELLO
exists and equals δ.
When δ = 0, we say that f (or its coefficients) is lacunary modulo 2. The best-known special case of (1) is perhaps
1 = p(n)qn, f 1 n≥0 X where p(n) is the ordinary partition function [1]. It is widely believed that p(n) has odd density 1/2, and that, in fact, its parity behaves essentially “at random” [6, 25, 29], though proving this appears extremely hard. We know that p(n) assumes infinitely many even, and infinitely many odd values. By results of Ono [26] and Radu [30], this remains true for p(An + B), for any given A and B; in particular, p(n) is not constant modulo 2 over any arithmetic progression. We only remark here that this is in stark distinction to the existence of progressions p(An + B) 0 (mod m) for any m coprime to 6, for which there is ≡ a well-established unifying theorem in terms of the crank statistic (see, e.g., [23] for details). The best asymptotic bound available today on the parity of p(n) (which can also be applied to a broader class of eta-quotients) was obtained in 2018 by Bella¨ıche et al. [3], after decades of incremental progress. Unfortunately, it only guarantees p(n) is odd for at least the order of √x/ log log x integers n x, while the correct asymptotic estimate is conjecturally x/2. ≤ More generally, we (along with then-graduate student S. Judge) recently conjectured that for any odd integer t 1, the t-multipartition function p (n), whose generating function is ≥ t t 1/f1, has odd density 1/2 (see [17, 18], where we also related such densities for infinitely many values of t). On the other hand, despite an impressive body of literature and a number of mostly isolated conjectures, no eta-quotient is known today whose coefficients have positive odd density. In fact, to the best of our knowledge, not even the existence of such density has ever been proven for any eta-quotient, except in those cases where it equals zero! Density zero can be established for some families of eta-quotients by means of the following very recent result by Cotron et al. [8], who built on and generalized seminal works by Serre [34] and then Gordon-Ono [13]. We phrase their theorem as follows:
u ri Qi=1 fαi Theorem 2. ([8], Theorem 1.1.) Let F (q)= t si , and assume that Qi=1 fγi
u r t i s γ . α ≥ i i i=1 i i=1 X X Then the coefficients of F are lacunary modulo 2. PARITY OF THE COEFFICIENTS OF CERTAIN ETA-QUOTIENTS 3
Note that the hypothesis of this theorem does not apply to the partition function, nor to many of the closely related functions we study in this paper, namely the m-regular partitions
f ∞ B (q) := m = b (n)qn, m f m 1 n=0 X for m 28. However, after certain easy equivalences, Theorem 2 can be shown to immedi- ≤ ately imply lacunarity modulo 2 for B when m 2, 4, 8, 12, 16, 24 . m ∈{ } We denote by δm the density, should it exist, of Bm.
Remark 3. Cotron et al. [8] suggested, without making it a formal conjecture, that when the hypothesis of Theorem 2 does not hold for an eta-quotient, then its density should be 1 2 . In this paper, we exhibit several counterexamples to that claim. It already follows from 1 1 earlier work [16, 17] that δ5 = 4 δ20 (assuming they both exist), and therefore δ5 4 . In fact, 1 ≤ numerical evidence seems to suggest that δ5 = 8 . Similarly, always assuming existence, we 1 1 have δ7 = 2 δ28 (see [17]), and a natural guess is that δ7 = 4 . On the other hand, we note that the example at the end of [8] is consistent with our data.
It can actually be shown that the odd density of the function G1,18,3 studied in section 5.1 of [8] coincides with the odd density δ6 of the 6-regular partitions, and a computer search 1 suggests that δ6 = 2 .
Almost all of the theorems we prove in this paper concern Bm with m odd, but we briefly note here, for m even, that b2(n) and b4(n) are odd precisely for the pentagonal and triangular
numbers, respectively. The functions b8 and b16 were studied by Cui and Gu in 2013 [9], who found families of even progressions b (An + B) with A = p2α for p 1 (mod 6), and b 8 ≡ − 16 with p 1 (mod 4). The series for b12 and b24 are lacunary modulo 2 by Theorem 2 above ≡ − 2j (use f j /f f /f ), and we conjecture the existence of infinitely many even arithmetic 2 m 1 ≡ m 1 progressions also for these m. However, in analogy to the case of the partition function p(n), for all other even values of m 28 we believe that no even progressions exist, and that the ≤ 1 corresponding densities δm all equal 2 (see Conjecture 15). As for the odd values of m, we see in this paper that, in many interesting instances, Bm exhibits multiple arithmetic progressions in which b (An + B) 0 (mod 2) for all n. A m ≡ few of these have been studied in the past; here, we produce theorems which exhibit even progressions – in several cases, a large infinite family of them – for all m 28 for which ≤ few or no such progressions were known before, with the only two exceptions m = 15 and m = 27, where we conjecture that no even progression exists. For certain values of m, we also include broader conjectures on the existence of suitable progressions or on their density. 4 WILLIAMJ.KEITHANDFABRIZIOZANELLO
The table below, while by no means an exhaustive survey of the area, is a substantial sampling of previously published results concerning the parity of m-regular partitions for m n odd. Symbols ( p ) are Legendre symbols.
m bm(An + B) known to be even Source 3 New in this paper
5 b5(2n), when n is not twice a pentagonal number Calkin et al. [7] 7 Family modulo 2p2 if ( −14 )= 1, p prime Baruah and Das [2] p − j 9 b9(2 n + c(j)) for various j Xia and Yao [36] More new in this paper
11 b11(22n +2, 8, 12, 14, 16) (finite family) Zhao, Jin, and Yao [38] 13 b (2n), when n = k(k + 1), n = 13k(k +1)+3 Calkin et al. [7] 13 6 6 15 We conjecture none 17 b (2 172α+2p2βn + c(p,α,β)) if ( −51 )= 1 Zhao, Jin, and Yao [38] 17 · p − 19 b19(38n +2, 8, 10, 20, 24, 28, 30, 32, 34) (finite family) Radu and Sellers [31] More new in this paper 21 New in this paper 23 Family modulo 2p2 if ( −46 )= 1, p prime Baruah and Das [2] p − 25 b25(100n + 64, 84) (finite family) Dai [10] More new in this paper 27 We conjecture none
All of our theorems, as well as previous results on m-regular partitions, are consistent with the following very broad (and bold!) main conjecture on the parity of eta-quotients. In fact, Conjecture 4 seems to be the first to appear in the literature in this level of generality.
n Conjecture 4. Let F (q)= n≥0 c(n)q be an eta-quotient, shifted by a suitable power of q so powers are integral, and denoteP by δF the odd density of its coefficients c(n). We have: i) For any F , δ exists and satisfies δ 1/2. F F ≤ ii) If δF = 1/2, then for any nonnegative integer-valued polynomial P of positive degree, the odd density of c(P (m)) is 1/2. (In particular, c(Am + B) has odd density 1/2 for all arithmetic progressions Am + B.)
iii) If δF < 1/2, then the coefficients of F are identically zero (mod 2) on some arithmetic
progression. (Note that this is not even a priori obvious when δF =0.) iv) If the coefficients of F are not identically zero (mod 2) on any arithmetic progression,
then they have odd density 1/2 on every arithmetic progression; in particular, δF =1/2. (Note that i), ii), and iii) together imply iv), and that iv) implies iii).) PARITY OF THE COEFFICIENTS OF CERTAIN ETA-QUOTIENTS 5
In Section 2, we list our main theorems. In Section 3 we present the preliminary results and modular form tools we use throughout. In Sections 4 through 8, categorized by the value of m, we prove our theorems. In the final section, we offer some concluding remarks, including applications to other classes of eta-quotients, and present further open questions that might be of interest for future investigations.
2. Main Theorems and Further Conjectures
We now introduce the main results and conjectures contained in the next sections. In addition to being consistent with the main Conjecture 4, the theorems below generally describe more specific behaviors for each case listed. We remark that, of course, they are not exhaustive of all candidates for even arithmetic progressions. In order to avoid enormous repetition, we use the convention that any congruence a b ≡ is modulo 2 unless explicitly stated otherwise.
Case m =3:
Theorem 5. The series b (2n) is lacunary modulo 2. If p 13, 17, 19, 23 (mod 24) is 3 ≡ prime, then b (2(p2n + kp 24−1)) 0 3 − ≡ for 1 k p 1, where 24−1 is taken modulo p2. ≤ ≤ − More generally, we conjecture that:
Conjecture 6. For any prime p > 3, let α 24−1 (mod p2), 0 <α For instance, one specific case of Conjecture 6 is the following (corresponding to p = 13): Theorem 7. It holds that ∞ ∞ b (26n + 14)qn b (2n)q13n, 3 ≡ 3 n=0 n=0 X X and therefore b (2 132n + 40) 0, 3 · ≡ 6 WILLIAMJ.KEITHANDFABRIZIOZANELLO and by iteration, b 2 132kn + 132k−2 40+14 (132k−2 1)/168 0 3 · · − ≡ for all k 1. ≥ Case m =9: Theorem 8. For p 17, 19, 37 , let α 3−1 (mod 2p), 0 <α< 2p, and β = 2p . ∈ { } ≡ − ⌊ 3 ⌋ Then ∞ ∞ b (2pn + α)qn qβ b (2n + 1)qpn. 9 ≡ 9 n=0 n=0 X X An example of this theorem (corresponding to p = 19) is that ∞ ∞ b (38n + 25)qn q12 b (2n + 1)q19n. 9 ≡ 9 n=0 n=0 X X Because 3−1 (mod 2p) is always an odd integer, note that Theorem 8 implies several − self-similarities between the sequence b (2n + 1) and certain of its subprogressions (see { 9 } Corollary 24). In fact, we conjecture that an analogous phenomenon is true in a much greater level of generality: Conjecture 9. Theorem 8 and Corollary 24 hold for all primes p 1 (mod 9). ≡ ± Case m = 19: Some congruences of the form b (38n + k) 0 were previously known [31]. We have the 19 ≡ following new family: Theorem 10. It holds that ∞ ∞ b (10n + 8)qn q b (2n)q5n. 19 ≡ 19 n=0 n=0 X X This implies that b (50n + 10k + 8) 0 19 ≡ for all k 1 (mod 5). By iteration, 6≡ b (2n) b 2 52dn + 9((52d 1)/24) , 19 ≡ 19 · − and therefore b 2 52d(50n + 10k +8)+9((52d 1)/24) 0, 19 · − ≡ for all d,k 1 with k 1 (mod 5). ≥ 6≡ PARITY OF THE COEFFICIENTS OF CERTAIN ETA-QUOTIENTS 7 The next examples up in this family are the progressions b (1250n + j) 0 for j 19 ≡ ∈ 218, 718, 968, 1218 . { } Similarly to the situation we encountered with b9, we conjecture that the previous theorem is the first case (corresponding to the prime p = 5) of an infinite family, even though here we were unable to characterize the primes involved. We have: Conjecture 11. For a prime p> 3, let α 3 8−1 (mod p), 0 <α Case m = 21: We establish lacunarity modulo 2 for the sequences b21(4n) and b21(4n +1), and give two theorems identifying even progressions within these sequences: Theorem 12. If p 19, 37, 47, 65, 85, 109, 113, 115, 137, 139, 143, or 167 (mod 168) is prime, ≡ then b (4(p2n + kp 5 24−1)) 0 21 − · ≡ for all 1 k Theorem 13. If p 13, 17, 19, or 23 (mod 24) is prime, then ≡ b (4(p2n + kp 11 24−1)+1) 0 21 − · ≡ for all 1 k Case m = 25: We have results within each residue class modulo 4 for B25: 8 WILLIAMJ.KEITHANDFABRIZIOZANELLO Theorem 14. The sequences b25(4n), b25(4n + 1), and b25(8n + 3) are not identically zero but lacunary modulo 2, and the following congruences hold within arithmetic progressions modulo 4: (1) If p 31 or 39 (mod 40) is prime, then ≡ b (4(p2n + pk 4−1)) 0 25 − ≡ for all 1 k b (16n + 11) 0. 25 ≡ We also conjecture the following noncongruences, analogous to Ono’s and Radu’s theorems for the partition function (see [26, 30]): Conjecture 15. Let m 6, 10, 14, 15, 18, 20, 22, 26, 27, 28 . We have: ∈{ } (1) For no integers A> 0 and B 0, b (An + B) 0 for all n. ≥ m ≡ (2) The series fm/f1 has odd density 1/2. Note that if the main Conjecture 4 holds, then either clause of Conjecture 15 implies the other (and much more). Finally, in the last section of our paper, we also demonstrate that an odd density may be constant over suitable infinite families of eta-quotients. As an example, we show: Theorem 16. Assume the odd density δ(k) of 9k+2 f3 3k+1 f1 PARITY OF THE COEFFICIENTS OF CERTAIN ETA-QUOTIENTS 9 exists for any k 0. Then δ(k) exists for all k 0, and its value is independent of k. In ≥ ≥ (0) particular, since δ = δ6 (the odd density of the 6-regular partitions), if δ6 exists then all of (k) the δ exist and are equal to δ6. 3. Background Given two power series f(q)= ∞ a(n)qn and h(q)= ∞ b(n)qn, if we say f(q) h(q), n=0 n=0 ≡ in this paper we always mean that a(n) b(n) (mod 2) for all n. P ≡ P Two common series expansions we extensively need (see for instance [1]) are the modulo 2 reduction of Euler’s Pentagonal Number Theorem, n f q 2 (3n−1), 1 ≡ Xn∈Z so named since the exponents are the eponymous (generalized) pentagonal numbers, and the classical fact that the cube of f1 has odd coefficients precisely at the triangular numbers, ∞ n+1 f 3 q( 2 ). 1 ≡ n=0 X A fact we also use frequently is: ∞ n Lemma 17. For any power series f(q)= n=0 a(n)q , it holds that P ∞ (f(q))2 a(n)q2n. ≡ n=0 X In particular, f 2 f . j ≡ 2j t The eta-quotients ft /f1 (which are the generating functions for the so-called t-core parti- tions) have the following modulo 2 expansions for t = 3 and t = 5 (see [33], Theorem 7, and [14], equation (10), respectively): Lemma 18. We have: f 3 (2) 3 qn(3n−2); f ≡ 1 n∈Z X 5 ∞ ∞ ∞ ∞ f 2 2 2 2 (3) 5 qn −1 + q2n −1 + q5n −1 + q10n −1. f ≡ 1 n=1 n=1 n=1 n=1 X X X X The following classical result can be attributed to Landau [20]: 10 WILLIAMJ.KEITHANDFABRIZIOZANELLO Lemma 19. Let r(n) and s(n) be quadratic polynomials. Then qr(n) qs(n) ! ! Xn∈Z Xn∈Z is lacunary modulo 2. 3.1. Modular forms background. We include here sufficient background from the theory of modular forms in order to make our proofs relatively self-contained. For further details, see for instance the standard text [19] or the monograph [28]. With q = e2πiz, define the η-function as 1/24 η(z) := q f1. An eta-quotient is a modular form for Γ0(N) of weight k and character χ under the following conditions on the exponents and arguments appearing, by a theorem of Gordon-Hughes [12] and Newman [24], which also specifies the necessary values of N, k, and χ. Theorem 20 ([12, 24]). Let f(z)= ηrδ (δz), with r Z. If δ|N δ ∈ N δr 0 (mod24)Q and r 0 (mod24), δ ≡ δ δ ≡ Xδ|N Xδ|N 1 (−1)ks then f(z) is a modular form for Γ0(N) of weight k = 2 rδ and character χ(d)= d , rδ · where s = δ|N δ and d denotes the Kronecker symbol.P Remark 21.Q Note that the Kronecker symbol appearing in Theorem 20 (as described in [27], Lemma 6 and [37], Proposition 2.1), multiplicatively extends the Jacobi symbol from odd values to all positive integers, by the assignment: 0 if a even; a (4) = 1 if a 1 (mod 8); 2 ≡ ± 1 if a 3 (mod8). − ≡ ± Given two modular forms of weight k and characters χ and ψ for Γ0(N), the following result of Sturm [35] gives a criterion – crucially, one involving a finite amount of calculation – to determine when all of their coefficients are congruent modulo a given prime. Theorem 22 . ∞ n ([35]) Let p be a prime number, and f(z) = n=n0 a(n)q and g(z) = ∞ b(n)qn be holomorphic modular forms of weight k for Γ (N) of characters χ and n=n1 P0 ψ, respectively, where n , n 0. If either χ = ψ and P 0 1 ≥ kN 1 a(n) b(n) (mod p) for all n 1+ , ≡ ≤ 12 · d d prime;Y d|N PARITY OF THE COEFFICIENTS OF CERTAIN ETA-QUOTIENTS 11 or χ = ψ and 6 kN 2 1 a(n) b(n) (mod p) for all n 1 , ≡ ≤ 12 · − d2 d prime;Y d|N then f(z) g(z) (mod p) (i.e., a(n) b(n) (mod p) for all n). ≡ ≡ We may sometime refer to the bound calculated above as the Sturm bound. In order to use Sturm’s Theorem we require that the modular forms being compared be holomorphic, i.e., vanishing to nonnegative orders at the cusps, a representative set of rational values. These orders are determined by the following theorem of Ligozat: Theorem 23 ([21, 28]). Let c, d and N be integers such that d N and gcd(c,d)=1. Then | if f is an η-quotient satisfying the conditions of Theorem 20 for Γ0(N), the order of f at the c cusp d is 2 N (gcd(d, δ)) rδ N . 24 gcd d, d dδ Xδ|N Given a prime p, the Hecke operator Tp (in fact, Tp,k,χ, but the latter two values are usually suppressed when they are clear from context) is a C-vector space endomorphism on Mk(Γ0(N), χ). For ∞ f(z)= a(n)qn M (Γ (N), χ), ∈ k 0 n=0 X the action of this operator is f T := (a(pn)+ χ(p)pk−1a(n/p))qn, | p where we take by convention thatXa(n/p) = 0 whenever p ∤ n. If f is an η-quotient with the properties listed in Theorem 20, and p s as defined above, | then χ(p) = 0 so that the latter term vanishes. In this case, we have the factorization property that ∞ ∞ ∞ f g(n)qpn T = a(pn)qn g(n)qn . · | p n=0 ! n=0 ! n=0 ! X X X Another operator we will need is the V operator. Given f(z)= ∞ a(n)qn M (Γ (N), χ) n=n0 ∈ k 0 and a positive integer d, define P ∞ f(z) V (d) := a(n)qdn. | n=n0 X Then it holds (see [28], Proposition 2.22) that f(z) V (d) M (Γ (Nd), χ). | ∈ k 0 12 WILLIAMJ.KEITHANDFABRIZIOZANELLO 4. Case m =3 In this section, we present the proof of Theorem 5, stated in Section 2. Proof of Theorem 5. A crucial tool, which we shall use in many variations, is the following identity ([17], equation (12)): (5) (f f )3 f 12 + qf 12. 1 3 ≡ 1 3 4 2 Dividing through by f1 f3 , we obtain an even-odd dissection of the 3-regular partitions: 8 10 f3 f1 f3 (6) 2 + q 4 . f1 ≡ f3 f1 By the identity f 2 f (see Lemma 17), on which we will rarely further remark explicitly 1 ≡ 2 to avoid heavy repetition, the first term on the right side contributes nonzero terms modulo 2 only to even powers of q, while the second term only to odd powers. Thus, by extracting those even powers and halving them, we obtain: ∞ f 4 b (2n)qn 1 . 3 ≡ f n=0 3 X A simple algebraic analysis shows the following identity which 3-dissects the triangular numbers (see [15], Chapter 1): (7) f 3 f + qf 3. 1 ≡ 3 9 From this and Lemma 18, we get: 4 3 f1 f9 f1 + qf1 f3 ≡ f3 2 f 1+ q q3n(3n−2) f 1+ q(3n−1) . ≡ 1 ≡ 1 n∈Z ! n∈Z ! X 3X The second congruence follows from the fact that f9 is simply the 3-core generating f3 3 function f3 under the substitution q q3, which we will henceforth refer to as being f1 → magnified by 3. Therefore, b3(2n) can only be odd if n is the sum of a pentagonal number and either zero or a square not divisible by 3. Thus, as a product of two quadratic forms, Lemma 19 gives lacunarity modulo 2 for b3(2n). We now proceed to identify arithmetic subprogressions on which this is identically zero modulo 2. Modulo any prime p2 with p> 3, completing the square yields that the pentagonal numbers are of the form 3 x2 24−1, 2 − PARITY OF THE COEFFICIENTS OF CERTAIN ETA-QUOTIENTS 13 where 2−1 and 24−1 are taken modulo p2. That is, let p > 3 be prime. Then we have the following: k n (3k 1) (mod p2) ≡ 2 − (3 2−1)(k2 3−1k) (mod p2) ≡ · − (3 2−1)(k2 3−1k + 36−1) 24−1 (mod p2) ≡ · − − (3 2−1)(k 6−1)2 24−1 (mod p2). ≡ · − − As for squares not divisible by 3, we observe that the divisibility criterion is irrelevant when noting that the sequences can eventually intersect any residue class modulo p2 that is a quadratic residue, but not any quadratic nonresidue modulo p2. Let a 3 x2 24−1 (mod p2) and b y2 (mod p2), for x, y Z, and write n = a + b. ≡ 2 − ≡ ∈ Now suppose n kp 24−1 (mod p2). Then 3 x2 + y2 0 (mod p). This is possible if ≡ − 2 ≡ x, y 0 (mod p), in which case n 24−1 (mod p2). ≡ ≡ − Conversely, x 0 (mod p) if and only if y 0 (mod p), and if so, then we may write 6≡ 6≡ y2 3 − (mod p2). x2 ≡ 2 But this can only be true if 6 is a quadratic residue modulo p. If not, then no such x and − y can exist. Therefore, if ( 6/p)= 1, we have that − − b (2(p2n + kp 24−1)) 0, 3 − ≡ for all n 0 and 1 k p 1. Since 6 is a quadratic nonresidue precisely for the primes ≥ ≤ ≤ − − p 13, 17, 19, 23 (mod 24), Theorem 5 is proved. ≡ We next show the specific case of Conjecture 6 stated in Theorem 7. Proof of Theorem 7. This proof employs a congruence argument for modular forms. In order to prevent substantial repetition we give one full example of such an argument in the next section. Here, we provide sufficient detail to reproduce the proof for this theorem. We construct modular forms f 4 ∞ C (q) := q6 1 f 2f 5 q6 b (2n)qn f 2f 5 1 f 39 13 ≡ 3 39 13 3 n=0 ! X and f 4 ∞ C (q) := q 13 f 2f 5 q b (2n)q13n f 2f 5. 2 f 3 1 ≡ 3 3 1 39 n=0 ! X 14 WILLIAMJ.KEITHANDFABRIZIOZANELLO We then calculate that ∞ C T q b (26n + 14)qn f 2f 5. 1| 13 ≡ 3 3 1 n=0 ! X We find that C1, C1 T13, and C2 are all modular forms of weight 5, level 117, and character −39 | χ = d . Thus, we verify holomorphicity by the criterion of Theorem 23, and apply Sturm’s Theorem 22 with bound 70 to determine, after a brief calculation, that the two forms C1 T13 and C2 2 5 | are congruent in all coefficients. Dividing out the factors qf3 f1 , we establish the congruence of the desired sequences. Since only powers for which 13 n can be nonzero on the right side of the statement, we | obtain: b (26(13n +1)+14) = b (2 132n + 40) 0. 3 3 · ≡ Finally, by repeatedly applying the relation b (2n) b (26 13n + 14), 3 ≡ 3 · we get: b (2 132n + 40) b (2 132(132n +20)+14) 3 · ≡ 3 · = b (2 134n + 132 40 + 14) 3 · · b (2 136n + 134 40+132 14+ 14) ≡ 3 · · · ... ≡ b 2 132kn + 132k−2 40 + 14((132k−2 1)/168) , ≡ 3 · · − where the last line is given by a finite geometric summation. 5. Case m =9 Proof of Theorem 8. The even-odd dissection of B9 is given by [36], Lemma 2.1: ∞ f 5 f f 4 b (n)qn = 6 + q 2 9 . 9 f f f n=0 4 18 6 X Thus, ∞ f 5 b (2n)qn 3 ; 9 ≡ f f n=0 2 9 X ∞ f f 2 b (2n + 1)qn 1 9 . 9 ≡ f n=0 3 X PARITY OF THE COEFFICIENTS OF CERTAIN ETA-QUOTIENTS 15 Each clause of Theorem 8 is proven by establishing a congruence of parity between the modular forms C (q) T and p | p f f 2 rp p 9p jp q f1 f3p for p = 17, 19, and 37, where ∞ dp n jp Cp = q b9(2n + 1)q fp , n=0 ! X and (d17,d19,d37) = (12, 7, 13); (8) (r17,r19,r37) = (12, 13, 24); (j17, j19, j37) = (16, 8, 8). We will prove the theorem for p = 17 in detail. The calculations are similar for the other values of p. We construct: ∞ η(z)η(9z)2η(17z)16 C (q) := q12 b (2n + 1)qn f 16 = . 1 9 17 η(3z) n=0 ! X 3 By Theorem 20, we compute that this is an element of M9(Γ0(3 17), χ1(d)), where 16 · χ (d)= −27·17 . This character is simply −3 for 17 ∤ d, and 0 if 17 d. 1 d d | We verify by Theorem 23 that the form vanishes to nonnegative order at all cusps, and therefore it is holomorphic. Since the Hecke operator is an endomorphism on Mk(Γ0(N), χ), we have that ∞ C T = q b (34n + 11)qn f 16 M (Γ (27 17), χ (d)) 1| 17 9 1 ∈ 9 0 · 1 n=0 ! X as well. By Theorem 22, the Sturm bound for this space of forms is 486 as long as we are comparing forms with the same character. For the right side of our comparison, we construct 2 12 f17f153 16 G1(q) := q f1 . f51 We compute, again by Theorem 20, that this is also an element of M (Γ (27 17), χ(d)), 9 0 · noting that the character is 33 172 χ(d)= − · = χ (d). d 1 Ligozat’s Theorem 23 then confirms holomorphicity. 16 WILLIAMJ.KEITHANDFABRIZIOZANELLO We wish to verify the congruence ∞ f f 2 q b (34n + 11)qn f 16 q12 17 153 f 16. 9 1 ≡ f 1 n=0 ! 51 X 486 The coefficient of q on the left side involves the value b9(16535); thus, f9/f1 must be expanded at least that far, and the product on the right side must be constructed up to the q486 term. Finally, expansion with a calculation package such as Mathematica confirms that all coefficients up to the desired bound are congruent, and the theorem is established. The argument is similar for the other two primes, with the necessary values being listed in equations (8). We can obtain several corollaries by observing that 2 fpf9p f3p is the q qp magnification of the odds in B . That is, → 9 f f 2 ∞ p 9p = b (2n + 1)qpn, f 9 3p n=0 X which clearly has coefficient 0 in any term qk with p ∤ k. This self-similarity can thus establish families of progressions modulo powers of the primes involved, from which we deduce the following corollary: Corollary 24. For p 17, 19, 37 , let 2p2kn + B be the sequence obtained by iteratively ∈{ } { k} taking n β (mod p) in the prior sequence of index k 1, with k = 1 being the sequence ≡ − described on the right side of the congruence in Theorem 8, in which β and α are defined. Then, for any n pj +(α 1)/2 (mod p2) such that j β (mod p), we have: ≡ − 6≡ b (2p2kn + B ) 0. 9 k ≡ As an example with base sequence b (38n+25) , if n 12 (mod 19), then b (38n+25) { 9 } 6≡ 9 ≡ 0. Thus, for instance, b (38(19n +7)+25) = b (722n +291) = b (2(361n +145)+1) 0. 9 9 9 ≡ Our base case k = 1 is the sequence b (38(19n +12)+25) = b (722n + 481) b (2n + 1). 9 9 ≡ 9 By iterating, we obtain b (2n + 1) b (722n + 481) b 2 192kn + 480((192k 1)/360)+ 1 . 9 ≡ 9 ≡···≡ 9 · − PARITY OF THE COEFFICIENTS OF CERTAIN ETA-QUOTIENTS 17 By taking now the n 145 (mod 361) subsequence, we obtain new families of even ≡ progressions, of which the following is the next example for k = 2: b (722(361j +145)+481) = b (2 194j + 105171) 0. 9 9 · ≡ The same process can be performed for the other progressions. This yields an infinite collection of such congruences for each prime for which the theorem is proved. In fact, interestingly, we believe that this self-similarity holds for all primes p 1 ≡ ± (mod 9) (see Conjecture 9). 6. Case m = 19 Proof of Theorem 10. We note that once the self-similarity of Theorem 10 is proved, the even progressions and the iterated infinite families follow by the same argument that we employed for Corollary 24. Because we do not have a convenient even-odd dissection for b19, the proof begins with a pair of Hecke operators. For the right side, we construct: 246 52 f19 246 η(19z)η(5z) C1(q) := q f5 = . f1 η(z) We compute that this is an element of M123(Γ0(95), χ1), where 19 5246 19 χ (d)= − · = − 1 d d if 5 ∤ d, and χ (d) = 0 if 5 d. 1 | We now apply Hecke operators to construct ∞ G(q) := C (q) T (2) V (5) q130 b (2n)q5n f 123. 1 | | ≡ 19 25 n=0 ! X We verify that this is an element of M (γ (19 2 52), χ ). 123 0 · · 1 For the left side, we construct 246 1282 f19 246 η(19z)η(125z) C2(q) := q f125 = . f1 η(z) We compute that this is an element of M (Γ (19 53), χ ), where 123 0 · 2 19 5738 χ (d)= − · = χ (d). 2 d 1 We now apply a different sequence of Hecke operators, to obtain: ∞ H(q) := C (q) T (2) T (5) q129 b (10n + 8)qn f 123, 2 | | ≡ 19 25 n=0 ! X and we verify that this is an element of M (Γ (19 2 53), χ ). 123 0 · · 1 18 WILLIAMJ.KEITHANDFABRIZIOZANELLO Theorem 23 confirms that both initial forms are holomorphic, and the Hecke operators preserve this property. Thus, G(q) and H(q) may be compared as elements of M (Γ (19 123 0 · 2 53), χ ), for which the Sturm bound (Theorem 22) is given by: · 1 123 1 1 1 (19 2 53) 1+ 1+ 1+ = 92250. 12 · · 2 5 19 Hence, in order to confirm the desired congruence, we must calculate terms of b19 up to q922508. This was done over the course of several days on a desktop computer, and the theorem is confirmed. The iterative results follow. Remark 25. The relatively large Sturm bound is the main reason we did not choose to confirm more cases from Conjecture 11. 7. Case m = 21 In this section, we prove Theorems 12 and 13. We begin with some preliminaries. In addition to identity (6), we require the following, which is easily seen to be equivalent to [22], equation 2.4: 8 f7 6 2 4 2 f7 (9) f1 + qf1 f7 + q 2 . f1 ≡ f1 Magnifying equation (9) by q q3, we can now dissect B as: → 21 f f f f 8 f 10 f 8 21 = 3 21 1 + q 3 f 6 + q3f 2f 4 + q2 21 . f f f ≡ f 2 f 4 3 3 21 f 2 1 1 3 3 1 3 Extracting terms that are even and odd, and then further extracting those that are, respectively, 0 and 1 modulo 4, we obtain the following: ∞ f 4f 4 f 6f 2 b (2n)qn f 4f 2 + q3 1 21 + q2 3 21 ; 21 ≡ 1 3 f 2 f 2 n=0 3 1 X ∞ f 3 b (4n)qn f 2f + q 3 f ; 21 ≡ 1 3 f 21 n=0 1 X ∞ f 8 f 4f 4 b (2n + 1)qn 3 + q3 3 21 + qf 4f 2 ; 21 ≡ f 2 f 2 1 21 n=0 1 1 X ∞ f 3 b (4n + 1)qn 3 f . 21 ≡ f 3 n=0 1 X Because, by Lemma 18, f 3 3 qn(3n−2), f1 ≡ Xn∈Z PARITY OF THE COEFFICIENTS OF CERTAIN ETA-QUOTIENTS 19 ∞ n ∞ n we deduce from Lemma 19 that both n=0 b21(4n)q and n=0 b21(4n + 1)q are lacunary modulo 2. P P As for the two progressions 2 and 3 (mod 4), we conjecture that their behavior modulo 2 is entirely different. We have: ∞ n ∞ n Conjecture 26. The series n=0 b21(4n + 2)q and n=0 b21(4n + 3)q have odd density 1/2. Consequently, the 21-regularP partition function hasP odd density 1/4. We now show that each of the two lacunary progressions modulo 2, expectedly, contain even arithmetic progressions. Note that with b21(4n) we have the additional complication that there are two terms to study. Proofs of Theorems 12 and 13. We comment in detail only on Theorem 12; the proof for Theorem 13 is similar to previous arguments. ∞ n For each term individually in n=0 b21(4n)q , the argument is in part similar to the proofs in Section 4; the new task is toP connect several of them. Note that 24 is invertible modulo all the primes p listed in the theorem. 2 2 We consider the term f1 f3. Residues a modulo p that this series can reach must satisfy 9 3 3x2 x + y2 y a (mod p2) − 2 − 2 ≡ for some x, y Z. Letting b x 6−1 (mod p2) and c y 6−1 (mod p2), we find that ∈ ≡ − ≡ − 9 a +5 24−1 3b2 + c2 (mod p2). · ≡ 2 Thus if a 5 24−1 (mod p), we must have 3b2 + 9 c2 0 (mod p). ≡ − · 2 ≡ Suppose this relation to hold. If either b or c is zero modulo p, then the other must be as well, and then a 5 24−1 (mod p2). If neither is zero modulo p, then it holds that ≡ − · (b/c)2 3/2 (mod p2). ≡ − Therefore, 6 must be a quadratic residue modulo p. − We have that 6 is a quadratic nonresidue for primes p 13, 17, 19, 23 (mod 24). Thus, − ≡ for these primes, the series f 2f avoids kp 5 24−1 (mod p2) for any k 0 (mod p). 1 3 − · 6≡ We now consider the term f 3 q 3 f . f 21 1 Residues a modulo p2 that this series can reach must satisfy 63 21 a x2 x +3y2 2y + 1 (mod p2) ≡ 2 − 2 − 20 WILLIAMJ.KEITHANDFABRIZIOZANELLO for some x, y Z. Letting b x 6−1 (mod p2) and c y 3−1 (mod p2), we find that ∈ ≡ − ≡ − 63 a +5 24−1 b2 +3c2 (mod p2). · ≡ 2 Thus if a 5 24−1 (mod p), we must have ≡ − · 63 b2 +3c2 0 (mod p). 2 ≡ By the same logic, if b, c 0 (mod p), then 2 21−1 must be a quadratic residue modulo 6≡ − · p2, and 42 must be as well. − ∞ n If we are seeking residue classes avoided by both terms of n=0 b21(4n+1)q , then we may choose to require that 6 be a quadratic nonresidue, and therefore, in order to make 42 a − P − quadratic nonresidue, we further desire that 7 be a quadratic residue. The latter occurs for primes congruent to 1, 3, 9, 19, 25, or 27 (mod 28). A quick use of the Chinese Remainder Theorem now shows that both sets of conditions are satisfied for the primes modulo 168 listed in Theorem 12. Thus, these subprogressions of b (4n) are identically zero modulo 2. { 21 } As for the proof of Theorem 13, we just note that, with its single term involved, completing the square yields that reachable residues a modulo p2 satisfy: 9 a + 11 24−1 3b2 + c2 (mod p2). · ≡ 2 The theorem now follows along the previous lines. 8. Case m = 25 Our proofs for b25 are by dissection, with a similar flavor to those of Section 7. Proof of Theorem 14. We begin with the identity [17], equation (4) (based on [14], equation (13), or [5], p. 301). Namely, f f f 6 + qf 6. 1 5 ≡ 1 5 This gives us an even-odd dissection of B5 as: 6 f5 4 f5 f1 + q 2 . f1 ≡ f1 Thus, f25 f25 f5 B25 = = f1 f5 f1 6 10 6 4 4 6 4 f25 f5 5 4 f25 (10) f1 f5 + q f5 2 + q 2 + q f1 2 . ≡ f1 f1 f5 PARITY OF THE COEFFICIENTS OF CERTAIN ETA-QUOTIENTS 21 This easily yields that: ∞ f 2f 3 b (2n)qn f 2f 2 + q3 5 25 25 ≡ 1 5 f n=0 1 X and ∞ f 5 f 3 b (2n + 1)qn 5 + q2f 2 25 25 ≡ f 1 f n=0 1 5 X 10 2 8 4 4 f5 2 2 4 2 7 f1 f25 f1 f5 + q 2 + q f1 f5 f25 + q 2 . ≡ f1 f5 Note that in going from the first to the second line, the first two terms are the dissection 5 of f5 , while in the latter two terms we reserve factors q2f 2f 2 and expand f25 as the f1 1 25 f5 5-magnification of B5 just above. ∞ n Applying (8) again to the factors f25/f1 in n=0 b25(2n)q , we can now extract the even and odd terms to obtain the following: P ∞ f 6f (11) b (4n)qn f f + q2 5 25 + q4f 2f 4; 25 ≡ 1 5 f 1 25 n=0 1 X ∞ f 4 (12) b (4n + 2)qn qf 2f 3f + q4f 3 25 . 25 ≡ 1 5 25 5 f n=0 1 X ∞ n Using equation (3), we further decompose n=0 b25(4n)q as: ∞ P b (4n)qn f f + q4f 2f 4 25 ≡ 1 5 1 25 n=0 X ∞ ∞ ∞ ∞ 6 5 6 n2 2n2 5n2 10n2 +q f5 + q f25 q + q + q + q . n=1 n=1 n=1 n=1 ! X X X X Although there are ten terms to sum, each is congruent to a product of two quadratic series and so we have, by Lemma 19, that all of them are lacunary modulo 2. We further establish the claimed zero progressions by analyzing their residues modulo p2 for prime p. For the term f1f5 and any prime p> 5, we have that 1 5 a (3i2 i)+ (3j2 j) (mod p2), ≡ 2 − 2 − which implies 3 15 a +4−1 x2 + y2 (mod p2), ≡ 2 2 where 4−1 is taken modulo p2. By arguments similar to those of Section 7, if a 4−1 ≡ − (mod p) and x, y 0 (mod p), then 5 is a quadratic residue modulo p. 6≡ − If ( −5 )= 1 then a kp 4−1 (mod p2) unless k 0 (mod p), and so this term avoids p − 6≡ − ≡ those progressions. Therefore, we will find primes for which ( −5 )= 1. p − 22 WILLIAMJ.KEITHANDFABRIZIOZANELLO For the term 4 2 4 q f1 f25 , similar calculations yield that if a 4−1 (mod p) but not modulo p2, then 50 is a ≡ − − quadratic residue modulo p, which is equivalent to 2 being a quadratic residue. We take − primes for which this and the previous condition are simultaneously false. For the terms ∞ 6 An2 qf5 q , n=1 X where A 1, 2, 5, 10 , we find that we desire that A/5 not be a quadratic residue modulo ∈{ } − p. For the terms ∞ 6 6 An2 q f25 q , n=1 X we desire that A/25 not be a quadratic residue. − In total, we want all of 5, 2, and 1 to be simultaneously nonresidues modulo p, in − − − which case progressions kp 4−1 will be avoided modulo p2 for all k 0 (mod p). − 6≡ Note that this occurs for primes p 31 or 39 (mod 40). An example of this clause of the ≡ theorem is that b (4(312n + 31k + 240)) 0 for1 k < 31. 25 ≡ ≤ For the 4n + 2 clause of the Theorem, we employ Ramanujan’s identity ([32], p. 212): ∞ 5 n f5 p(5n + 4)q =5 6 . n=0 f1 X In particular, this tells us that 5 1 4 f25 (13) q 6 +(... ) , f1 ≡ f5 where the elided terms have powers that are not congruent to 4 (mod 5). ∞ n In n=0 b25(4n+2)q we now repeatedly expand f1f5 and its magnified forms, and replace the instanceP of 1/f1 with the right side of (13). We obtain: ∞ b (4n + 2)qn qf 12f 6 + q6f 12f 6 + q3f 18 + q8f 12f 6 25 ≡ 1 5 1 25 5 5 25 n=0 X 6 4 18 5 12 6 10 6 12 15 18 4 f25 +q (f5 + q f5 f25 + q f5 f25 + q f25 ) q + ... . · f 6 5 We now wish to extract those terms that are 3 (mod 5). Note that ∞ n+1 f 12 q4( 2 ). 1 ≡ n=0 X PARITY OF THE COEFFICIENTS OF CERTAIN ETA-QUOTIENTS 23 The numbers 4 n+1 are congruent to 2 (mod 5) if and only if n 2 (mod 5), and therefore 2 ≡ a little algebra