Skip to main content
Springer logoLink to Springer
. 2022 Nov 2;1(4):809–828. doi: 10.1007/s44007-022-00030-1

Conjectures of Sun About Sums of Polygonal Numbers

Kathrin Bringmann 1,✉, Ben Kane 2
PMCID: PMC9767307  PMID: 36568874

Abstract

In this paper, we consider representations of positive integers as sums of generalized m-gonal numbers, which extend the formula for the number of dots needed to make up a regular m-gon. We mainly restrict to the case where the sums contain at most four distinct generalized m-gonal numbers, with the second m-gonal number repeated twice, the third repeated four times, and the last is repeated eight times. For a number of small choices of m, Sun conjectured that every positive integer may be written in this form. By obtaining explicit quantitative bounds for Fourier coefficients related to theta functions which encode the number of such representations, we verify that Sun’s conjecture is true for sufficiently large positive integers. Since there are only finitely many choices of m appearing in Sun’s conjecture, this reduces Sun’s conjecture to a verification of finitely many cases. Moreover, the bound beyond which we prove that Sun’s conjecture holds is explicit.

Keywords: Polygonal numbers, Theta functions, Modular forms, Quadratic forms

Introduction and Statement of Results

For m∈N≥3 and ℓ∈Z, let pm(ℓ) be the ℓ-th (generalized) m-gonal number

pm(ℓ):=12(m-2)ℓ2-12(m-4)ℓ.

For ℓ∈N, these count the number of dots contained in a regular polygon with m sides having ℓ dots on each side. For example, the special case m=3 corresponds to triangular numbers, m=4 gives squares, and m=5 corresponds to pentagonal numbers. There are several conjectures related to sums of polygonal numbers. Specifically, for α∈Nd,1 we are interested in the solvability of the Diophantine equation

∑1≤j≤dαjpm(ℓj)=n 1.1

with ℓj∈N0 or ℓj∈Z. We call such a sum universal if it is solvable for every n∈N. Fermat stated (his claimed proof was not found in his writings) that every positive integer is the sum of three triangular number, four squares, five pentagonal numbers, and in general at most m m-gonal numbers. In other words, he claimed that the sum ∑1≤j≤mpm(ℓj) is universal. His claim for squares (m=4) was proven by Lagrange in 1770, the claim for triangular numbers (m=3) was shown by Gauss in 1796, and the full conjecture was proven by Cauchy in 1813. Going in another direction, Ramanujan fixed m=4 and conjectured a full list of choices of α∈N4 for which the resulting sum is universal; this conjecture was later proven by Dickson [11]. Following this, the classification of universal quadratic forms was a central area of study throughout the twentieth century, culminating in the Conway–Schneeberger 15-theorem [3, 8] and the 290-theorem [4], which state that arbitrary quadratic forms whose cross terms are even (resp. are allowed to be odd) are universal if and only if they represent every integer up to 15 (resp. 290). Theorems of this type are now known as finiteness theorems. Namely, given an infinite set S⊆N, one determines a finite subset S0 of S such that a solution to (1.1) exists for every n∈S if and only if it exists for every n∈S0. Taking S=N, one obtains a condition for universality of a given sum of polygonal numbers. For example, choosing m=3 or m=6, (1.1) is solvable with ℓ∈Zd for all n∈N if and only if it is solvable for every n≤8 [6], for m=5 it is solvable with ℓ∈Zd for all n∈N if and only if it is solvable for every n≤109 [13], while it is solvable with ℓ∈N0d for all n∈N if and only if it is solvable for every n≤63 [14] and for m=8 it is solvable for ℓ∈Zd for all n∈N if and only if it is solvable for every n≤60 [15].

Here, we consider the question of universality in the case α=(1,2,4,8) as one varies m. Specifically, we have the following conjecture of Sun (see [21, Conjecture 5.4]).

Conjecture 1.1

For m∈{7,9,10,11,12,13,14} and ℓ∈Z4, the equation

pm(ℓ1)+2pm(ℓ2)+4pm(ℓ3)+8pm(ℓ4)=n 1.2

is solvable for every n∈N.

Remark

A proof of Conjecture 1.1 would give a classification of those m for which the sum (1.1) is universal in the case α=(1,2,4,8). By direct computation, one sees that pm(ℓ)∈{0,1} or pm(ℓ)≥m-3. Using this, one obtains that (1.2) is not solvable for n=16 for every m≥20. For m=16, m=17, m=18, and m=19, one finds directly that there is no solution for n=29, n=30, n=16, and n=17, respectively. Moreover, for m∈{3,6}, it is known by work of Liouville [18] that the sum is universal, for m=4, it was conjectured by Ramanujan and proven by Dickson [11] that the sum is universal, while for m=5 (resp. m=8), it was shown by Sun in [20] (resp. [21]) to be universal.

In this paper, we prove that Conjecture 1.1 is true for n sufficiently large.

Theorem 1.2

For m∈{7,9,10,11,12,13,14}, there exists an explicit constant Cm (defined in Table 2) such that (1.2) is solvable with ℓ∈Z4 for every n∈N≥Cm, with the restriction that n≢4mod16 if m=12.

Table 2.

Bounds on n for sm,2(m-2),(1,2,4,8)(n)>0 and rm,(1,2,4,8)>0

m Bound for sm,2(m-2),(1,2,4,8)(n)>0 Bound Cm for rm,2(m-2),(1,2,4,8)(n)>0
7 1.92·1082 4.8·1080
9 8.38·1085 1.5·1084
10 3.41·1087 5.33·1085
11 3.55·1088 4.93·1086
12 4.25·1089 5.31·1087
13 4.57·1090 5.19·1088
14 2.04·1091 2.13·1089

Remark

To prove Conjecture 1.1 for m=12, it suffices to show that (1.2) holds for all n∈N with n≢4mod16 (see Lemma 5.1). Hence, the restriction in Theorem 1.2 is natural.

By completing the square, one easily sees that representations of integers as sums of polygonal numbers are closely related to sums of squares with congruence conditions. In particular, setting

rm,α(n):=#ℓ∈Z4:∑1≤j≤4αjpm(ℓj)=n,sr,M,α(n):=#x∈Z4:∑1≤j≤4αjxj2=n,xj≡rmodM,

we have

rm,(1,2,4,8)(n)=sm,2(m-2),(1,2,4,8)8(m-2)n+15(m-4)2. 1.3

Hence, since Conjecture 1.1 is equivalent to proving that rm,(1,2,4,8)(n)>0 for every n∈N and m∈{7,9,10,11, 12,13,14}, the conjecture is equivalent to showing that for every n∈N, we have

sm,2(m-2),(1,2,4,8)8(m-2)n+15(m-4)2>0. 1.4

We investigate the numbers sr,M,α(n) by forming the generating function (setting q:=e2πiτ)

Θr,M,α(τ):=∑n≥0sr,M,α(n)qn.

It is well known that these functions are modular forms (see Lemma 2.1 for the precise statement). By the theory of modular forms, there is a natural decomposition

Θr,M,α=Er,M,α+fr,M,α, 1.5

where Er,M,α lies in the space spanned by Eisenstein series and fr,M,α is a cusp form. In order to prove Theorem 1.2, we obtain in the special case r=m, M=2(m-2), and α=(1,2,4,8) an explicit lower bound for the n-th Fourier coefficient ar,M,α(n) of Er,M,α in Corollary 4.2 and an explicit upper bound on the absolute value of the n-th Fourier coefficient br,M,α(n) of fr,M,α in the proof of Theorem 1.2.

The paper is organized as follows. In Sect. 2, we recall properties of the theta functions Θr,M,α, the actions of certain operators on modular forms, the decomposition of modular forms into Eisenstein series and cusp forms, and evaluate certain Gauss sums. In Sect. 3, we investigate the growth of the theta functions toward all cusps and use this to compute the Eisenstein series component of the decomposition (1.5). The Fourier coefficients of the Eisenstein series components are then explicitly computed and lower bounds are obtained in Sect. 4. We complete the paper by obtaining upper bounds on the coefficients of the cuspidal part of the decomposition (1.5) and prove Theorem 1.2 in Sect. 5.

Setup and Preliminaries

Modularity of the Generating Functions

In this subsection, we consider the modularity properties of the theta functions Θr,M,α. To set notation, for Γ1(N)⊆Γ⊆SL2(Z) (N∈N) and a character χ modulo N, let Mk(Γ,χ) be the space of modular forms of weight k with character χ. In particular, an element f in this space satisfies, for Inline graphic,

f|kγ(τ):=(cτ+d)-kf(γτ)=χ(d)f(τ).

Setting ΓN,L:=Γ0(N)∩Γ1(L), by [7, Theorem 2.4], we have the following.

Lemma 2.1

For α∈N4, we have

Θr,M,α∈M2Γ4lcm(α)M2,M,∏j=14αj·.

Operators on Non-holomorphic Modular Forms

For a translation-invariant function f with Fourier expansion (denoting τ=u+iv∈H)

f(τ)=∑n≥0cf,v(n)qn,

we define the sieving operator (M, m∈N)

f|SM,m(τ):=∑n≥0n≡mmodMcf,v(n)qn.

As usual, we also define the V-operator (δ∈N) by

f|Vδ(τ):=∑n≥0cf,δv(n)qδn.

We require the modularity properties of (non-holomorphic) modular forms under the operators SM,m and Vd. Arguing via commutator relations for matrices, a standard argument (for example, see the proof of [17, Lemma 2]), one obtains the following.

Lemma 2.2

Suppose that k∈Z, L,N∈N with L∣N, and f satisfies weight k modularity on ΓN,L.

  1. For d∈N, the function f|Vd satisfies weight k modularity on Γlcm(4,Nd),L.

  2. For m∈Z and M∈N, the function f|SM,m satisfies weight k modularity on Γ1(NM2).

It is useful to determine the commutator relations between the V-operator and sieving.

Lemma 2.3

Let m∈Z and M1,M2∈N be given and set d:=gcd(M1,M2) and μj:=Mjd. Then for any translation-invariant function f, we have

f|VM1|SM2,m=f|Sμ2,μ¯1md|VM1ifd∣m,0otherwise,

where μ¯1 is the inverse of μ1modμ2.

Proof

Recall that

fSM1,mVM2(τ)=∑n≡mmodM1cf,M2v(n)qM2n,fVM1SM2,m(τ)=∑ncf,M1v(n)qM1n|SM2,m(τ)=∑n≡mmodM2c~f,v(n)qn=∑n≡mmodM2M1∣ncf,M1vnM1qn,

where

c~f,v(n):=cf,M1vnM1ifM1∣n,0otherwise.

If d=gcd(M1,M2)∤m, then n≡mmodM2 and M1∣n are not consistent, and hence f|VM1|SM2,m vanishes identically.

We may hence assume that d∣m and we note that gcd(μ1,μ2)=1, obtaining

fVM1SM2,m(τ)=∑nd≡mdmodμ2M1∣ncf,M1vnM1qn=n↦M1n∑n≡μ¯1mdmodμ2cf,M1v(n)qM1n=fSμ2,μ¯1mdVM1(τ).

□

Decomposition Into Eisenstein Series and Cusp Forms

Comparing Fourier coefficients on both sides of (1.5), we have

sr,M,α(n)=ar,M,α(n)+br,M,α(n). 2.1

Theorem 1.2 is equivalent to showing (1.4) for n sufficiently large (with the restriction that n≢4mod16 for m=12). Roughly speaking, the approach in this paper to proving (1.4) is to prove that for n sufficiently large with n≡15(m-4)2mod8(m-2) (noting the congruence conditions in (1.4))

ar,M,α(n)>|br,M,α(n)|.

To obtain an upper bound for |br,M,α(n)|, we recall that Deligne [9] proved that for a normalized newform f(τ)=∑n≥1cf(n)qn of weight k on Γ0(N) with Nebentypus character χ (normalized so that cf(1)=1), we have

|cf(n)|≤σ0(n)nk-12, 2.2

where σk(n):=∑d∣ndk. To obtain an explicit bound for |cf(n)| for arbitrary f∈Sk(Γ1(N)), we combine (2.2) with a trick implemented by Blomer [5] and Duke [12]. For cusp forms f,g∈Sk(Γ), we define the Petersson inner product by

f,g:=1[SL2(Z):Γ]∫Γ\Hf(τ)g(τ)¯vkdudvv2.

Letting ‖f‖:=f,f denote the Petersson norm of f∈Sk(Γ), a bound for |cf(n)| in terms of ‖f‖ may be obtained. Specifically, suppose that f is a cusp form f of weight k∈N on ΓN,L (with L∣N) and character χ modulo N. Using Blomer’s method from [5], an explicit bound is obtained in [1, Lemma 4.1] for |cf(n)| as a function of N, L, and the Petersson norm ‖f‖. Denoting by φ Euler’s totient function, we recall a bound from the case k=2 below (see [1, (4.4)]).

Lemma 2.4

Suppose that f∈S2(ΓN,L,χ) with L∣N and χ a character modulo N. Then, we have the inequality

cf(n)≤6.95·1018·‖f‖N1+2.5·10-6∏p∣N1+1p12φ(L)n35.

By Lemma 2.4, in order to obtain an explicit bound for |br,M,α(n)|, it remains to estimate ‖fr,M,α‖, where fr,M,α is the cusp form appearing in the decomposition in (1.5). An explicit bound for ‖fr,M,α‖ was obtained in [16, Lemma 3.2]. To state the result, let α∈Zℓ. For the quadratic form Q=Qα given by

Qα(x):=∑j=1ℓαjxj2,

we define the level and the discriminant of Qα as

Nα=4lcm(α),Dα=2ℓ∏j=1ℓαj.

Lemma 2.5

Let ℓ≥4 be even, α∈Nℓ, r∈Z, and M∈N. Then,

‖fr,M,α‖2≤32ℓ-2ℓ2-2!2ℓ2-3πℓM2ℓ-4Nαℓ-2∏p∣M2Nα1-p-2×∑δ∣M2NαφM2Nαδφ(δ)M2Nαδgcd(M2,δ)M2ℓ×∑m=0ℓ2-2(2π)-mℓ2-2-m!(ℓ-m-2)!9Dα(ℓ-m-1)M2Nαπ+ℓ2.

Gauss Sums

Define the generalized quadratic Gauss sum (a,b∈Z, c∈N)

G(a,b;c):=∑ℓmodce2πicaℓ2+bℓ.

Background information and many properties of these sums may be found in [2]. To state the properties that we require, for d odd, we define

εd:=1ifd≡1mod4,iifd≡3mod4,

and we write [a]b for the inverse of a modulo b if gcd(a,b)=1.

Lemma 2.6

For a,b∈Z and c,d∈N, the following hold.

  1. If gcd(a,c)∤b, then G(a,b;c)=0, while if gcd(a,c)∣b then
    G(a,b;c)=gcd(a,c)Gagcd(a,c),bgcd(a,c);cgcd(a,c).
  2. If gcd(a,c)=1 and c is odd, then
    G(a,b;c)=εccace-2πi[4a]cb2c.
  3. If gcd(c,d)=1, then
    G(a,b;cd)=G(ac,b;d)G(ad,b;c).
  4. If gcd(a,c)=1, 4∣c, and b is odd, then G(a,b;c)=0.

  5. If a is odd, b is even, and r∈N≥2, then
    Ga,b;2r=2r2(1+i)-2raεae2πi2r-[a]2rb24.

We require an explicit evaluation of certain Gauss sums that naturally occur in the study of theta functions (see Lemma 3.1 below). Throughout the paper, for k,M∈N, and r∈Z with ord2(r)≤ord2(M), we write M=2μM0, r=2ϱr0 (with ϱ≤μ), and k=2κk0 with M0, r0, and k0 odd. We furthermore set g0:=gcd(M0,k0) and g1:=gcd(g0,k0g0).

Lemma 2.7

Suppose that h∈Z, k∈N with gcd(h,k)=1, ℓ∈N0, r∈Z, M∈N with gcd(M,r)∈{1,2,4}, and ϱ≤μ.

  1. If g1≠1 or ϱ<min(μ,κ-ℓ-μ)-1, then
    G2ℓhM2,2ℓ+1hrM;k=0.
  2. Suppose that g1=1 and ϱ≥min(μ,κ-ℓ-μ)-1. Setting δ:=min(ℓ+2ϱ,κ), we then have
    e2πi2ℓhr2kG2ℓhM2,2ℓ+1hrM;k=kg02κ2εk0g02ℓ+κhg0k0g0e2πihr022κ-δg02ℓ+2ϱ-δk0g02κ-δg0ifκ≤ℓ+2μorκ=ℓ+2μ+1andϱ=μ-1,2ℓ+2μ2(1+i)εhg0-2ℓ+κk0g0hg0e2πihr02g02κ-ℓ-2μk0g0g0ifκ≥ℓ+2μ+2andϱ=μ,0otherwise.

Proof

We evaluate G(a, b; c) for a:=2ℓhM2, b:=2ℓ+1hrM, and c:=k. By Lemma 2.6 (1), G(a,b;c)=0 unless gcd(a,c)∣b. Hence, we first compute, using the fact that gcd(h,k)=1, gcd(M0g0,k0g0)=1, and k0g0 is odd,

gcd(a,c)=2min(ℓ+2μ,κ)g0g2, 2.3

where g2:=gcd(M0,k0g0).

  1. A direct calculation gives that gcd(a,c)∣b if and only if g1=1 and ϱ≥min(μ,κ-ℓ-μ)-1, which implies the claim by Lemma 2.6 (1).

  2. Set γ:=min(ℓ+2μ,κ). Note that γ≤ℓ+μ+ϱ+1. From the calculation yielding (1), we see that g1=1 implies g2=1. Plugging g1=g2=1 into (2.3) yields gcd(a,c)=2γg0 and it is not hard to see that gcd(a,c)∣b. Therefore, Lemma 2.6 (1),(3) implies that
    G(a,b;c)=2γg0G2ℓ+2μ+κ-2γhM0M0g0,2ℓ+μ+ϱ+1-γhr0M0g0;k0g0×G2ℓ+2μ-γhM0M0g0k0g0,2ℓ+μ+ϱ+1-γhr0M0g0;2κ-γ.
    Since k0g0 is odd, we use Lemma 2.6 (2) to evaluate the first Gauss sum, yielding, after simplification,
    G(a,b;c)=2γεk0g0k0g02ℓ+κhg0k0g0e-2πihr02k0g02ℓ+2ϱ2κg0k0g0×G2ℓ+2μ-γhM0M0g0k0g0,2ℓ+μ+ϱ+1-γhr0M0g0;2κ-γ. 2.4

It remains to evaluate the final Gauss sum in (2.4). We use Lemma 2.6 (4) and Lemma 2.6 (5) to obtain

G2ℓ+2μ-γhM0M0g0k0g0,2ℓ+μ+ϱ+1-γhr0M0g0;2κ-γ=1ifκ≤ℓ+2μ,2ifκ=ℓ+2μ+1,ϱ=μ-1,2κ-ℓ-2μ2(1+i)-2ℓ+κhM0M0g0k0g0εhM0M0g0k0g0e-2πihr022κ-ℓ-2μk02κ-ℓ-2μifκ≥ℓ+2μ+2,ϱ=μ,0otherwise. 2.5

Plugging (2.5) into (2.4) and then simplifying yields that G(a, b; c) equals

εk0g0kg0hg0k0g02κ22ℓ+κk0g0e-2πihr02k0g02ℓ+2ϱ2κg0k0g0ifκ≤ℓ+2μorκ=ℓ+2μ+1,ϱ=μ-1,2ℓ+2μ2(1+i)εhM0M0g0k0g0-2ℓ+κhM0M0g0k0g02ℓ+κk0g0ifκ≥ℓ+2μ+2,ϱ=μ,×e-2πihr02k0g02ℓ+2μ2κg0k0g0e-2πihr022κ-ℓ-2μk02κ-ℓ-2μ0otherwise.

To obtain the claim, we multiply by e2πi2ℓhr2k and simplify by using the Chinese Remainder Theorem to combine the exponentials. For example, if κ≤ℓ+2μ or (κ=ℓ+2μ+1 and ϱ=μ-1), then the exponential becomes

e2πihr022κ-δk02ℓ+2ϱ-δ1-2κg02κg0k0g0.

Since gcd(g0,k0g0)=g1=1 and k0 is odd, to determine 1-2κg02κg0k0g0mod2κ-δk0 the Chinese Remainder Theorem implies that it suffices to compute

1-2κg02κg0k0g0≡1modg0,1-2κg02κg0k0g0≡0modk0g0,1-2κg02κg0k0g0≡1mod2κ-δ.

Thus,

1-2κg0g0k0g0≡k0g0k0g02κ-δg0mod2κ-δk0.

So the exponential simplifies in this case as e2πihr022κ-δg02ℓ+2ϱ-δ[k0g0]2κ-δg0.

The remaining case κ≥ℓ+2μ+2 and ϱ=μ follows by a similar but longer and more tedious calculation. □

Growth Toward the Cusps of Certain Modular Forms

In this section, we determine the growth toward the cusps of theta functions Θr,M,α and certain (non-holomorphic) Eisenstein series. The purpose of this calculation is to compare the growth in order to determine the unique Eisenstein series Er,M,α in (1.5) whose growth toward the cusps matches that of the theta function.

Growth of the Theta Functions at the Cusps

In order to obtain the Eisenstein series, we determine the growth of Θr,M,α toward all of the cusps, which follows by a straightforward calculation.

Lemma 3.1

Let m∈N≥3 and α∈N4 be given. For h∈Z and k∈N with gcd(h,k)=1, we have

-limz→0+z2Θr,M,αhk+izk=-14k2M4∏j=14αj∏j=14e2πir2hαjkGhαjM2,2hrαjM;k.

Proof

We have

Θr,M,α(τ)=∑x∈Zdxj≡rmodMq∑j=14αjxj2=∏j=14ϑ(r,M;2Mαjτ), 3.1

where

ϑ(r,M;τ):=∑n≡rmodMqn22M.

By definition,

ϑr,M;2Mαjhk+izk=∑n≡rmodMe2πiαjn2hk+izk.

Write n=r+Mα+Mkℓ (αmodk,ℓ∈Z) to obtain that this equals

∑αmodke2πiαj(r+Mα)2hk∑ℓ∈Ze-2π(r+Mα+Mkℓ)2αjkz=∑αmodke2πiαj(r+Mα)2hkϑ(r+Mα,Mk;2Mαjiz).

We now recall the modular inversion formula (see [19, (2.4)])

ϑr,M;-1τ=M-12(-iτ)12∑νmodMe2πiνkMϑ(ν,M;τ).

We use this with τ=i2Mαjz, r↦r+Mα, M↦Mk to obtain that

ϑ(r+Mα,Mk;2Mαjiz)=(Mk)-1212Mαjz12∑νmodMke2πiMk(r+Mα)νϑν,Mk;i2Mαjz.

Thus,

ϑr,M;2Mαjhk+izk=1M12kαjz∑αmodke2πiαj(r+Mα)2hk×∑νmodMke2πiMk(r+Mα)νϑν,Mk;i2Mαjz.

Now assume that z∈R+ and let z→0+. The contribution that is not exponentially decaying comes from ν=0 and gives

limz→0+zϑr,M;2Mαjhk+izk=1M12kαj∑αmodke2πiαj(r+Mα)2hk.

Note that

∑αmodke2πiαj(r+Mα)2hk=e2πiαjr2hk∑αmodke2πikαjM2α2+2rαjMαh=e2πiαjr2hkGhαjM2,2hrαjM;k.

Plugging back into (3.1) yields the claim. □

We next use Lemma 2.7 to evaluate the right-hand side of Lemma 3.1. Since the theta function Θr,M,α only depends on r modulo M, we may assume without loss of generality that

ϱ=ord2(r)≤ord2(M)=μ

by replacing r with r+M in Lemma 3.1 if ϱ>μ. A direct calculation gives the following.

Corollary 3.2

Suppose that h∈Z and k∈N with gcd(h,k)=1, α=(1,2,4,8), r∈Z, and M∈N with gcd(M,r)∈{1,2,4} and ord2(r)≤ord2(M). If g1≠1 or ϱ<min(μ,k-ℓ-μ)-1, then

-limz→0+z2Θr,M,αhk+izk=0.

If g1=1 and ϱ≥min(μ,k-ℓ-μ)-1, then, setting δ0:=min(κ,2ϱ),

-limz→0+z2Θr,M,αhk+izk=-22κ-4μ-5M04g02e2πihr022κ-δ0g022ϱ-δ015k0g02κ-δ0g0ifκ≤2μ,orκ=2μ+1andϱ=μ-1,g02M04e2πihr02g0152κ-2μk0g0g0ifκ≥2μ+5andϱ=μ,0otherwise.

Remark

Although the right-hand side of Corollary 3.2 splits into a number of cases, we obtain an explicit element of the cyclotomic field Q(ζ2jg0) for some j∈N0, where ζν:=e2πiν. To use Corollary 3.2 for practical purposes, one can evaluate the right-hand side of Corollary 3.2 with a computer as an element of Q(ζν)≅Q[x]/fν, where fν is the minimal polynomial of ζν over Q, which is well known to be

fν(x)=∏1≤k≤νgcd(k,ν)=1x-ζνk=∏d∣νxd-1μνd.

Here, μ denotes the Möbius μ-function.

Growth of Eisenstein Series Toward the Cusps

The goal of this section is to obtain the growth of certain weight two Eisenstein series toward the cusps. These are formed by applying certain sieving and V-operators to the (non-holomorphic but modular) weight two Eisenstein series

E^2(τ):=E2(τ)-3πv,whereE2(τ):=1-24∑n≥1σ(n)qn

with σ(n):=σ1(n). In light of Lemma 2.3, we may furthermore always assume without loss of generality that sieving is applied before the V-operator. The growth toward the cusps of such functions is given in the following lemma.

Lemma 3.3

Let m∈Z and M1,M2∈N. Then, for h∈Z and k∈N with gcd(h,k)=1, we have

-limz→0+z2E^2|SM1,m|VM2hk+izk=1M13M22∑jmodM1gcdhM1M2+jk,M1k2ζM1-jm.

Proof

For a translation-invariant function f, we use the presentation

f|SM1,m(τ)=1M1∑j=0M1-1ζM1-jmfτ+jM1.

Applying VM2 to this yields

f|SM1,m|VM2(τ)=1M1∑j=0M1-1ζM1-jmfM2τ+jM1.

Plugging in f=E^2 and using the weight two modularity of E^2, the claim follows by a standard calculation. □

Eisenstein Series Component

In this section, we determine the Eisenstein series component Er,M,α in (1.5).

Proposition 4.1

For n∈N, we have the following.

  1. For m=7, we have a7,10,(1,2,4,8)(n)=0 unless n≡15mod40, in which case we have
    a7,10,(1,2,4,8)(n)=1240σ(n)-σn5.
  2. For m=9, we have a9,14,(1,2,4,8)(n)=0 unless n≡39mod56, in which case we have
    a9,14,(1,2,4,8)(n)=1672σ(n).
  3. For m=10, we have a10,16,(1,2,4,8)(n)=0 unless n≡28mod64, in which case we have
    a10,16,(1,2,4,8)(n)=1256σn4.
  4. For m=11, we have a11,18,(1,2,4,8)(n)=0 unless n≡15mod72, in which case we have
    a11,18,(1,2,4,8)(n)=11728σ(n).
  5. For m=12, we have a12,20,(1,2,4,8)(n)=0 unless 80∣n, in which case we have
    a12,20,(1,2,4,8)(n)=1120σn16-σn32-σn80+σn160+8σn256-32σn512-8σn1280+32σn2560.
  6. For m=13, we have a13,22,(1,2,4,8)(n)=0 unless n≡71mod88, in which case we have
    a13,22,(1,2,4,8)(n)=12640σ(n).
  7. For m=14, we have
    a14,24,(1,2,4,8)(n)=1768σn4-σn12ifn≡60mod96,0otherwise.

Proof

(1) By comparing Fourier coefficients, we see that the identity is equivalent to

E7,10,(1,2,4,8)=-15760E2|1-V5|S40,15. 4.1

Lemma 2.1 and (1.5) give that

E7,10,1,2,4,8∈M2(Γ3200,10),

while Lemma 2.2 implies that

E2|1-V5|S40,15∈M2Γ11600.

Enumerating the cusps of Γ1(3200) (see [10, Proposition 3.8.3]), we then use a computer together with Lemma 3.3 and Corollary 3.2 to verify that the growth toward every cusp of both sides of (4.1) agrees, yielding the claim.

To see this in more details note that by [10, Proposition 3.8.3], two cusps ac and αγ are equivalent modulo the action of Γ1(N) if and only if there exists j∈Z such that (α,γ)≡±(a+jc,c)modN (for some choice of ±). As in [10, p. 102], by taking d:=gcd(c,N), we may write a set of representatives of the inequivalent cusps in the form adγ with d∣N, a running modulo d with gcd(a,d)=1, and 1≤γ≤⌈N2d⌉ with gcd(γ,Nd)=1. Since both sides of (4.1) are elements of M2(Γ1(3200)), we thus need to compute the constant term at every cusp hk with h,k∈Z, gcd(h,k)=1, and k=dγ with d∣3200 and 1≤γ≤1600d with gcd(γ,3200d)=1. For each such representative hk of the cusps of Γ1(3200), we use Lemma 3.3 together with a computer to evaluate

-15760limz→0+z2E2|S8,3|V5hk+izk-E2|S40,15hk+izk

as an element of Q(ζ40). Comparing this with Corollary 3.2 in the case r=7 and M=10, we then verify with a computer that

-15760limz→0+z2E2|S8,3|V5hk+izk-E2|S40,15hk+izk=-limz→0+z2Θ7,10,αhk+izk. 4.2

Since f7,10,(1,2,4,8) is a cusp form, we have

-limz→0+z2f7,10,αhk+izk=0

and hence

-limz→0+z2Θ7,10,αhk+izk=-limz→0+z2E7,10,αhk+izk.

Therefore, (4.2) implies that

E7,10,(1,2,4,8)+15760E2|(1-V5)S40,15

vanishes toward all cusps, and is hence a cusp form. Since it is also in the subspace of Eisenstein series, it is orthogonal to all cusp forms and therefore vanishes, implying (4.1), and hence the claim.

For the remaining cases, the argument is similar, but we provide the identities analogous to (4.1) for the convenience of the reader.

  • (2)
    The claim is equivalent to
    E9,14,(1,2,4,8)=-116128E2|S56,39.
  • (3)
    The claim is equivalent to
    E10,16,(1,2,4,8)=-16144E2|S16,7|V4.
  • (4)
    The claim is equivalent to
    E11,18,(1,2,4,8)=-141472E2|S72,15.
  • (5)
    The claim is equivalent to
    E12,20,(1,2,4,8)=-12880E2|S5,0-V5|1-V2+8V16-32V32|V16.
  • (6)
    The claim is equivalent to
    E13,22,(1,2,4,8)=-163360E2|S88,71.
  • (7)
    The claim is equivalent to
    E14,24,(1,2,4,8)=-118432E2|1-V3|S24,15|V4.
    □

As a corollary to Proposition 4.1, we obtain explicit lower bounds on the Fourier coefficients ar,M,α(n) in these special cases.

Corollary 4.2

Let n∈N.

  1. If n≡15mod40, then we have
    a7,10,(1,2,4,8)(n)≥n240.
  2. If n≡39mod56, then we have
    a9,14,(1,2,4,8)(n)≥n672.
  3. If n≡28mod64, then we have
    a10,16,(1,2,4,8)(n)≥n1024.
  4. If n≡15mod72, then we have
    a11,18,(1,2,4,8)(n)≥n1728.
  5. Assume that 80∣n and write n=2a5bc with gcd(10,c)=1. We have
    a12,20,(1,2,4,8)(n)≥5bc1202a-4if4≤a≤7,24ifa≥8.
  6. If n≡71mod88, then we have
    a13,22,(1,2,4,8)(n)≥n2640.
  7. If n≡60mod96, then we have
    a14,24,(1,2,4,8)(n)≥n3072.

Proof

For m≠12, the claims with the exception of (5) follow directly from Proposition 4.1. For (5), a direct simplification yields that the right-hand side of Proposition 4.1 (5) simplifies as

5bσ(c)1202a-4if4≤a≤7,24ifa≥8,

which gives the claim.□

Proof of Theorem 1.2

In this section, we prove Theorem 1.2. The constants Cm from the theorem statement may be found in Table 2.

Proof of Theorem 1.2

We require the case ℓ=4 of Lemma 2.5. Since the inner sum only has a single term namely m=0 in this case, Lemma 2.5 simplifies as

‖fr,M,α‖2≤2·36π4M4Nα2∏p∣M2Nα1-p-2×∑δ∣M2NαφM2Nαδφ(δ)M2Nαδgcd(M2,δ)M24227DαM2Nαπ+16. 5.1

For θr,M,(1,2,4,8), we obtain a lower bound for ar,M,(1,2,4,8)(n) (for n in an appropriate congruence class) from Corollary 4.2 (see the third column of Table 1 for a list of the bounds for individual choices of r and M).

Table 1.

Bounds for ar,M,(1,2,4,8), ‖fr,M,(1,2,4,8)‖, and |br,M,(1,2,4,8)|

r M Bound for ar,M,(1,2,4,8) Bound for ‖fr,M,(1,2,4,8)‖ Bound for |br,M,(1,2,4,8)|
7 10 n240 8.11·1014 3.41·1030n35
9 14 n672 1.03·1016 3.48·1031n35
10 16 n1024 3.2·1016 9.98·1031n35
11 18 n1728 6.1·1016 1.52·1032n35
12 20 n1920 1.49·1017 3.69·1032n35
13 22 n2640 2.55·1017 6.96·1032n35
14 24 n3072 5.63·1017 1.09·1033n35

Computing the constants in (5.1) explicitly for fixed M yields an upper bound for ‖fr,M,(1,2,4,8)‖2 (see the fourth column of Table 1 for the explicit bounds), which plugged into Lemma 2.4 yields an upper bound for |br,M,(1,2,4,8)(n)| (see the final column of Table 1 for the explicit bounds). Plugging the bounds for ar,M,(1,2,4,8)(n) and |br,M,(1,2,4,8)(n)| into (2.1), we see that sr,M,(1,2,4,8)(n)>0 for n sufficiently large in an appropriate congruence class (see Table 2 for the explicit constants).

We then conclude that rm,(1,2,4,8)>0 for n sufficiently large by using (1.3), yielding the claim. □

In order to explain why it is sufficient to assume that n≢4mod16 for m=12 in Theorem 1.2, we require the following lemma combined with (1.3).

Lemma 5.1

Let n∈N be given. If the equation

x12+2x22+4x32+8x42=n

is solvable with xj≡12mod20, then the equation

x12+2x22+4x32+8x42=256n

is also solvable with xj≡12mod20.

Acknowledgements

We thank the referees for helpful comments on an earlier version of the paper.

Funding

Open Access funding enabled and organized by Projekt DEAL.

Declarations

Conflict of interest

On behalf of all authors, the corresponding author, Kathrin Bringmann, states that there is no conflict of interest.

Footnotes

1

We denote vectors like α in bold and the j-th component of a vector α we write as αj throughout.

The first author has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant Agreement No. 101001179). The research of the second author was supported by a grant from the Research Grants Council of the Hong Kong SAR, China (Project Number HKU 17303618).

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Change history

1/23/2023

Missing Open Access funding information has been added in the Funding Note.

References

  • 1.Banerjee, S., Kane, B.: Finiteness theorems for universal sums of squares of almost prim. Trans. Amer. Math. Soc., to appear, arxiv:2106.05107
  • 2.Berndt B, Evans R, Williams K. Gauss and Jacobi Sums. New York: Wiley; 1998. [Google Scholar]
  • 3.Bhargava, M.: On the Conway–Schneeberger fifteen theorem. In: Quadratic Forms and Their Applications, Contemp. Math. 272 (200), 27–37
  • 4.Bhargava, M., Hanke, J.: Universal quadratic forms and the 290-theorem, Invent. Math., accepted for publication
  • 5.Blomer V. Uniform bounds for Fourier coefficients of theta-series with arithmetic applications. Acta Arith. 2004;114:1–21. doi: 10.4064/aa114-1-1. [DOI] [Google Scholar]
  • 6.Bosma W, Kane B. The triangular theorem of eight and representation by quadratic polynomials. Proc. Am. Math. Soc. 2013;141:1473–1486. doi: 10.1090/S0002-9939-2012-11419-4. [DOI] [Google Scholar]
  • 7.Cho B. On the number of representations of integers by quadratic forms with congruence conditions. J. Math. Anal. Appl. 2018;462:999–1013. doi: 10.1016/j.jmaa.2017.12.060. [DOI] [Google Scholar]
  • 8.Conway, J.: Universal quadratic forms and the fifteen theorem. In: “Quadratic Forms and Their Applications”, Contemp. Math. 272 (200), 23–26
  • 9.Deligne P. La conjecture de Weil I. Inst. Hautes Études Sci. Publ. Math. 1974;43:273–307. doi: 10.1007/BF02684373. [DOI] [Google Scholar]
  • 10.Diamond F, Shurman J. A First Course in Modular Forms. New York: Springer; 2005. [Google Scholar]
  • 11.Dickson L. Integers represented by positive ternary quadratic forms. Bull. Am. Math. Soc. 1927;33:63–70. doi: 10.1090/S0002-9904-1927-04312-9. [DOI] [Google Scholar]
  • 12.Duke W. On ternary quadratic forms. J. Number Theory. 2005;110:37–43. doi: 10.1016/j.jnt.2004.06.013. [DOI] [Google Scholar]
  • 13.Ju J. Universal sums of generalized pentagonal numbers. Ramanujan J. 2020;51:479–494. doi: 10.1007/s11139-019-00142-3. [DOI] [Google Scholar]
  • 14.Ju, J., Kim, D.: The pentagonal theorem of sixty-three and generalizations of Cauchy’s Lemma, preprint, arxiv:2010.16123
  • 15.Ju J, Oh B-K. Universal sums of generalized octagonal numbers. J. Number Theory. 2018;190:292–302. doi: 10.1016/j.jnt.2017.12.014. [DOI] [Google Scholar]
  • 16.Kamaraj, R., Kane, B., Tomiyasu, R.: Universal sums of heptagonal numbers, submitted for publication, arxiv:2203.14678
  • 17.Li W. Newforms and functional equations. Math. Ann. 1975;212:285–315. doi: 10.1007/BF01344466. [DOI] [Google Scholar]
  • 18.Liouville J. Nouveaux thèorémes concernant les nombres triangulaires. J. Math. Pures Appl. 1863;8:73–84. [Google Scholar]
  • 19.Shimura G. On modular forms of half integral weight. Ann. Math. 1973;97:440–481. doi: 10.2307/1970831. [DOI] [Google Scholar]
  • 20.Sun Z-W. On universal sums of polygonal numbers. Sci. China Math. 2015;58:1367–1396. doi: 10.1007/s11425-015-4994-4. [DOI] [Google Scholar]
  • 21.Sun Z-W. A result similar to Lagrange’s Theorem. J. Number Theory. 2016;162:190–211. doi: 10.1016/j.jnt.2015.10.014. [DOI] [Google Scholar]

Articles from La Matematica are provided here courtesy of Springer

RESOURCES