#A82 INTEGERS 16 (2016) ON A CUBIC MOMENT FOR SUMS OF HECKE EIGENVALUES
|
|
- Kelly Douglas
- 5 years ago
- Views:
Transcription
1 #A IEGERS 6 (06) O A CUBIC MOME FOR SUMS OF HECKE EIGEVALUES Khadija Mbarki Department of Mathematics, University of Monastir, Faculty of Sciences, Monastir, unisia mbarkikhadija@yahoo.fr Received: /6/5, Accepted: //6, Published: /3/6 Abstract Let f (n) be the n-th nmalized Fourier coe cient of the Fourier series associated with a holomphic cusp fm f f the full modular group of even weight k and let A f (x) := f (n). During the ELAZ 0 conference in Hildesheim, Germany, napplex K.-L. Kong (University of Hong Kong) presented his result, proved in his Master thesis, that Z (t) ( t) = C( ) 7/ + O " 7/ f some explicit > 0, C( ), where > 0 is fixed and (x) is the err term in the Dirichlet divis problem. A problem posed by Profess Ivić at this conference was to obtain a fmula analogous to the above fmula f the sum A f (x) and especially to discuss the sign of C( ) in the new setting. In this paper, we will solve Ivić s problem and prove that f any " > 0, we have Z A f (t)a f ( t) = C f ( ) 7/ + O," +", f some constant C f ( ) depending on only f, and defined by C f ( ) = / 3 + (i 0,i ){0,} n,m,l= p n+( ) i p p 0 m+( ) i l=0, (nml) 3/, where > 0 is a fixed constant. Our result is new and throws light on the behavi of the classical function A f (x).. Introduction Let k be an even integer and Hk be the set of all primitive cusp fms of weight k f the full modular group SL (Z). If f Hk, then it has the following Fourier expansion at the cusp : f(z) = + n= f (n)n (k )/ e inz (=(z) > 0).
2 IEGERS: 6 (06) By the they of Hecke operats, property: f (n) f (m) = f (n) is real and satisfies the multiplicative d (n,m) f mn d f all integers m and n. Besides, it is also known that f (n) satisfies the deep inequality: f (n) apple d(n) () f all n, where d(n) denotes the number of positive diviss of n (this is the Ramanujan-Petersson conjecture proved by Deligne (see [], [])). he sum of nmalized Fourier coe cients over natural numbers occurs in the study of many imptant problems in number they, such as the number of Hecke eigenvalues of same signs (see [5]). he sequence ( f (n)) is of great arithmetic interest. he generating series L(f, s) = + n= f (n) n s has many analytic properties which o er tools to help achieve this goal. Meover, Hecke (see [3], []) proved that L(f, s) is an entire function that satisfies the following functional equation, which is a special case of the Langlands functiality: where L(f, s) = ( ) k/ (s)l(f, s) if <(s) >, (3) (s) = ( s) Y j= s + applej s + applej and the parameters in the product are apple = k and apple = k+. One of the basic goals of number they is the foundation of asymptotic fmula, as accurate as possible, f the sum A f (x). Rankin (see [7]) showed that f any " > 0 and x, A f (x) f x 3 (log x) +", where = Wu (see [, hereom.]) got a better bound f A f (x), that is where = 0.5. A f (x) f x 3 (log x), In this paper, we shall evaluate the integral R A f (x)a f ( x)dx basing on the truncated Vonoi fmula f the sum A f (x) and we will investigate the sign of the constant C f ( ). he main result of this paper is the following. ()
3 IEGERS: 6 (06) 3 heem. Let f Hk and 0 < Q[p ], where > is a square-free natural number. If there exist integers t, r, s, a 0, b 0, d and d such that t, t odd r odd, t >< s even, gcd(r, s) = b 0 tr + t s a 0 () rs gcd(d, d ) = >: = h d a 0 b0 d tr + t s ± rs p i t, odd r, s odd, gcd(r, s) = >< b 0 tr + t s a 0 rs gcd(d, d ) h= >: = d a 0 b0 d tr + t s ± rs p i, then there exists a constant C f ( ) depending on only and f and defined by (5) C f ( ) = / 3 + (i 0,i ){0,} n,m,l= p n+( ) i p p 0 m+( ) i l=0 (nml) 3/ (6) such that f any " > 0, we have Z A f (t)a f ( t) = C f ( ) 7/ + O," +". Our main tool in the proof of heem is the Vonoi summation fmula. Lau and Wu (see [5, Lemma 3.]) established the truncated Vonoi fmula f A f (x). hey obtained the following result. Lemma. Let f Hk. hen f any A > 0 and " > 0, unifmly f apple M apple xa and x, we have A f (x) = x/ p napplem f (n) n 3/ cos p nx where the implied O-constant depends on A, " and k only. We will use (7) and write x / +O A,",k x " + + x / M A f (x) = B M (x) + O A,",k (x " ) + O A,",k x /+" M /, (), (7)
4 IEGERS: 6 (06) where B M (x) = x/ p napplem ow, we will study the sign of the coe f (n) n 3/ cos p nx. cient C f ( ) in the following theem. heem. Let k be an even integer and let f H k. Set S + := S := so that both S + and S A ± := {a ; f (a)? 0}, + r s l 00 A + + r s l 00 A are positive.! f r s l 00 f (l 00 ), and l 009/! f r s l 00 f (l 00 ), l 009/. Suppose that satisfies (). If d = a 0 b 0 d =, then 9 < C f ( ) > 0 if S + > S = C f ( ) < 0 if S + < S : ;. C f ( ) = 0 if S + = S. Suppose that satisfies (5). If d = and a 0 b 0 d =, then 9 < C f ( ) > 0 if S + > S = C f ( ) < 0 if S + < S : ;. C f ( ) = 0 if S + = S In particular, examples when C f ( ) = 0 are given in the following assertion. 3. If Q + p Q +, then C f ( ) = 0.. Some Lemmas he proof of heem is based on the following lemmas. Lemma. Let be a positive number in Q[ p ], where is a square-free positive integer and let i 0, i {0, }. We put := (i 0, i ) := p n + ( ) i0p m + ( ) i p l, (9)
5 IEGERS: 6 (06) 5 and c (, y) := c ( ) := >: (i 0,i ){0,} (i 0,i ){0,} nappley,mappley lappley =0 + n,m,l= =0 (nml) 3/ (0) (nml) 3/. () hen, we have the following assertions. (a) he equation = 0 is solvable f n, m, l if and only if there exist integers t, r, s, d, d, a 0 and b 0 such that t, t odd r odd, t >< s even, gcd(r, s) = b 0 tr + t s a 0 rs gcd(d, d ) = >< >: = d d a 0 b0 h tr + t s t, odd r, s odd, gcd(r, s) = b 0 tr + t s a 0 rs gcd(d, d ) = = d d a 0 b0 ± rs p i h tr + t s ± rs p (b) On the hypotheses of () and (5), the series c ( ) converges. (c) c (, y) c ( )," y 5/+". Proof. (a) Let = a a + b b p, where a, b Z, a, b and gcd(a, a ) = gcd(b, b ) = and let d i = gcd(a i, b i ). So, we have a i = d i a 0 i and b i = d i b 0 i, i {, }. ote that at most one of the equations (0, ) = 0 and (, ) = 0 is solvable in n, m and l. If the equation (0, ) = 0 is solvable f n, m, l, then by squaring both sides, we obtain a b (n + m) b a l = a b l p a b p nm. () By using the same procedure, we get a b b l p nm = (a b l) + (a b ) nm (a b (n + m) b a l). i.
6 IEGERS: 6 (06) 6 his shows that p nm is necessarily an integer. Also, it is easy to show that p mn is an integer. Hence, Fmula () leads to a b (n + m) b a l = p a b l r mn a b. Since is a square-free integer and p mn is an integer, then we have p is an irrational and p p a b l a b mn is an irrational zero. So, we get a (n + m) = a l and b l = b r mn. (3) his implies that a > 0 and b > 0. Meover, we know that a divides a l and b divides b l. Since gcd(a, a ) = gcd(b, b ) =, it follows that a and b divide l. herefe, there exists a positive integer l 0 such that l = a l 0 and b divides a l 0. hen l 0 = b d l, where l 00 = l a 0 b By considering (3) and (), we get. hus (n + m) = a b 0 l 00 = a 0 d b 0 l 00 and which is equivalent to l = a l 0 = a b d l 00 = a 0 b 0 d l 00. () r mn = b a 0 l 00 = a0 b 0 d l 00, (n + m) = a b 0 l 00 = a 0 d b 0 l 00 and mn = (b0 d a 0 l 00 ). By solving the last two equations f n, we obtain a 0 b 0 ± p (a 0 b0 ) (a 0 b0 ) n = d l 00 Since gcd(a 0, a 0 ) = gcd(b 0, b 0 ) =, we get gcd(a 0 b 0, a 0 b 0 ) =. otice that n is well-defined i.e the equation q (a 0 b0 ) (a 0 b0 ) = e. has solutions in 3 provided we have the following cases: If is odd, there exist integers t, r and s such that >< >: t, t odd r odd, s even, gcd(r, s) = a 0 b 0 = tr + t s a 0 b 0 = rs (5)
7 IEGERS: 6 (06) 7 > < However, if is even, then < : >: t, t odd r, s odd gcd(r, s) = a 0 b 0 = tr + t s a 0 b 0 = rs. t, r odd gcd(r, s) = a 0 b 0 = tr + t s a 0 b 0 = rs. (6) (7) ow, if (5) is valid, then n = d l 00 tr + t s ± (tr t s ). So, we have n = d l 00 tr and m = d l 00 t s, n = d l 00 t s and m = d l 00 tr. herefe b = d b 0 rs = d a and a 0 = d a 0 (tr = d + t s ) b. It follows that 0 = d (tr + t s ) b 0 d a 0 If (6) is valid, then + d rs apple a p 0 d = d b 0 d a 0 tr + b0 t s + rs p. n = d l 00 tr + t s ± tr t s. Assuming that l 00 and d are not both odd, then this implies that n = dl00 tr and that m = dl00 t s, n = dl00 t s and m = dl00 tr rs. hus b = d a 0 and a = d(tr + t s ) b. his leads to 0 = d tr + t s b 0 d a 0 + d rs apple a p 0 d = tr d b 0 d a 0 + t b0 + rs p. If (7) is true, we will obtain the same values of n and m as in (5), and therefe = d apple d a 0 tr + b0 t s + rs p. Subsequently, the numbers n, m and l are well-defined so that the equation (0, ) = 0 is solvable f n, m and l.
8 IEGERS: 6 (06) ow, if the equation (, ) = 0 is solvable then, by following the afementioned steps, we get a (n + m) = a l and b r mn = b l. Let b = b > 0. We replace b by b and we will obtain = d apple d a 0 tr + b0 t s rs p = d apple tr d a 0 + t b0 s rs p. (b) ow, assume that satisfies (); then < n = d l 00 tr m = d : l 00 t s l = a 0 b 0 d l 00 < : n = d l 00 t s m = d l 00 tr l = a 0 b 0 d l 00. () his is valid provided that Fmula () implies that = d d a 0 b0 apple tr + t s + rs p = d apple d a 0 tr + b0 t s rs p. c ( ) + f (d l 00 t s ) f (d l 00 tr ) f (a 0 b 0 d l 00 ) (d s r a 0 b0 d l 003 ) 3/ f (d t s ) f (d tr ) f (a 0 b 0 d ) (d s r a 0 b0 d ) 3/ + f (l 00 ) 3 l 009/. From (), we get f (l 00 ) " l 00" f any " > 0. hus, we have c ( ) " and therefe, the series c ( ) converges. If satisfies (5), then < n = (d tr )l 00 m = : (d t s )l 00 l = a 0 b 0 d l 00 < : n = (d t s )l 00 m = (d tr )l 00 l = a 0 b 0 d l 00, (9)
9 IEGERS: 6 (06) 9 this is valid provided that Fmula (9) implies that = d d a 0 b0 apple tr + t s + rs p = d apple tr d a 0 + t b0 s rs p. c ( ) + + f (d tr )l 00 f (d t s )l 00 f (a 0 b 0 d l 00 ) (d s r a 0 b0 d l 003 ) 3/ f d tr l 00 f d t s l 00 f (a 0 b 0 d (l 00 )) (d s r a 0 b0 d (l) 3 ) 3/ f (d t s ) f (d tr ) f (a 0 b 0 d ) (d s r a 0 b0 d ) 3/ 9/ + f (l 00 ) 3 l 009/ ". Hence, by Fmula (), the series c ( ) converges. (c) Recall that (see (0)) c (, y) = (i 0,i ){0,} nappley,mappley lappley =0 (nml) 3/. ote that if does not satisfy () and (5), then, based on the findings of (a), the equation = 0 is not solvable in n, m and l. hus, we obtain (i 0,i ){0,} + n,m,l= =0 (nml) 3/ = (i 0,i ){0,} nappley,mappley lappley =0 (nml) 3/ = 0, which is equivalent to c ( ) = c (, y) = 0. Suppose now that satisfies () (5).
10 IEGERS: 6 (06) 0 F instance, if satisfies (); then we have c ( ) c (, y) = = (i 0,i ){0,} (i 0,i ){0,} d l 00 tr >y d l 00 t s >y a 0 b0 dl00 >y + n>y m>y l>y =0 + n>y m>y l>y =0 (nml) 3/ (nml) 3/ f (d l 00 tr ) f (d l 00 t s ) f (a 0 b 0 d l 00 ) (d r s a 0 b0 d l 003 ) 3/ f (d tr ) f (d t s ) f (a 0 b 0 d ) (d r s a 0 b0 d ) 3/ d l 00 tr >y d l 00 t s >y a 0 b0 dl00 >y f (l 00 ) 3 l 009/. By using () and since we have d l 00 tr > y d l 00 t s > y a 0 b 0 d l 00 > y, then the last fmula implies that he other case is similar. c ( ) c (, y)," y 5/+". Lemma 3. Let be a positive number in Q[ p ], where > is a square-free integer. Let U i and V i f i =,, 3, be positive real numbers such that U i < V i b and at least two of the U i s are a f some positive real numbers a and b with a apple b. hen we have (a) U <napplev,u <mapplev, U 3<lappleV 3, 6=0 (nml) 3/ Z p t 3/ cos t," 5/+b/+" + 7/ a/+" and
11 IEGERS: 6 (06) (b) napplev,mapplev,lapplev 3 6=0 (nml) 3/ Z p t 3/ cos t," 5/+b/+", where is defined by (9). Proof. (a) ote that (0, 0) ( nml) /6. Also, by using the fact that f any t [, ], we have t 3/ 3/ and that p cos t 0 p, we get Z p t 3/ cos t 5/. (0) hus, U <napplev,u <mapplev, U 3<lappleV 3, 6=0 (nml) 3/," 5/," 5/ Z U <napplev,u <mapplev,u 3<lappleV 3 6=0 U <napplev,u <mapplev,u 3<lappleV 3 6=0 p t 3/ cos t (nml) 3/ (nml) /. ow, since U i < V i b f all i =,, 3, it follows that n, m and l are b and hence, by Fmula (), we obtain: f (n), f (m) and f (l) are " b+". herefe, 5/ U <napplev,u <mapplev,u 3<lappleV 3 6=0 (nml) / 5/+b/+". Suppose now that (i 0, i ) = (0, ) as the other case is similar. here exist integers, 0, M, M 0, L and L 0 such that U < < n apple 0 apple min(v, ), U < M < m apple M 0 apple min(v, M) and U 3 < L < l apple L 0 apple min(v 3, L). Let D = max(, M, L) and d = min(, M, L). F p D, we have {(n, m, l) : n, m M, l L, 0 < < }
12 IEGERS: 6 (06) So, we obtain U <napplev,u <mapplev,u 3<lappleV 3 6=0," D / ML + (nml) 3/ / L D "p ML. () d Z p t 3/ cos t <napple 0,M<mappleM 0, L<lappleL 0, 6=0 0 <napple 0,M<mappleM 0, L<lappleL 0, 0 " (nml) 3/ + <napple 0,M<mappleM 0, L<lappleL 0, / apple < 0 Z + p t 3/ cos t <napple 0,M<mappleM 0, L<lappleL 0,0< < / C A C + C + C 3. " (nml) 3/ Z p t 3/ cos t Since (0, ) < p D and by using Fmulas (0) and () with 0 apple < p D, we get C," 5/+b/+". Meover, we have L max(, M) D and d min(, M), in case (0, ) is between and /0. By using the same equations with / apple < 0 in Fmula (), we obtain C," 5/+b/+" + 7/ a/+". ow, by trivial estimation and by Fmula (), we have C 3," 5/+b/+" + 7/ a/+". Consequently, we get U <napplev,u <mapplev,u 3<lappleV 3 6=0 (nml) 3/ Z," 5/+b/+" + 7/ a/+". p t 3/ cos t
13 IEGERS: 6 (06) 3 (b) We use the same arguments as above f (i 0, i ) = (0, 0), and we get napplev,mapplev,lapplev 3 (0,0)6=0 (nml) 3/ F (i 0, i ) = (0, ), we have napplev,mapplev,lapplev 3 6=0 0 Z t 3/ cos (nml) 3/ <napple 0,M<mappleM 0,L<lappleL 0 0 Z " (nml) 3/ C 0 + C 0. + p t Z," 5 + b +". p t 3/ cos t <napple 0,M<mappleM 0,L<lappleL 0 < 0 p t 3/ cos t By the same token, we get C 0," 5/+b/+". Since using Fmula () with D 3 d / apple, we obtain herefe, we have napplev,mapplev,lapplev 3 6=0 (nml) 3/ < 0 C 0," 5/+b/+". Z t 3/ cos p t C A D 3 d / and by," 5 + b +". 3. Proof of heem In this section, we will use the results of the previous lemmas to prove heem. Let M =. From Fmula (), we have Z Z Z! A f (t)a f ( t) = (B M (t)) B M ( t) + O A,",k " B M (t) A f ( t) = Z! Z! +O A,",k " A f ( t) + O A,",k " A f (t) Z (B M (t)) B M ( t) + O,A,",k 3/+".
14 IEGERS: 6 (06) he last identity is due to Cauchy-Schwarz s inequality and the well-known meansquare results (see [6, heem.]) Z A f (t) 3, where f(t) g(t) means that f(t) g(t) and g(t) f(t). his can be established also by using (). Let B M,y (t) = t/ p and let M 0 = /6. We have hus, we get Z (B M (t)) B M ( t) = M<nappley f (n) n 3/ cos p nx B M (t) = B M0 (t) + B M0,M(t). Z (B M0 (t)) B M0 ( t) + Z Z Z Z Z B M0 (t)b M0,M(t)B M0 ( t) B M0 (t)b M0,M(t)B M0,M( t) (B M0,M(t)) B M0 ( t) (B M0,M(t)) B M0,M( t) = S + S + S 3 + S + S 5 + S 6. (B M0 (t)) B M0,M( t) he fmula cos(a) cos(b) cos(c) = [cos(a + b + c) + cos(a + b c) + cos(a b + c) + cos(a b c)] implies that cos p nt cos = p mt (i 0,i ){0,} cos cos p lt p t, ()
15 IEGERS: 6 (06) 5 where is defined by (9). By using Fmula (), the sum S is written as the following: S = / 3p + / 3p It follows that S / 3p + / 3p (i 0,i ){0,} (i 0,i ){0,} (i 0,i ){0,} napplem 0,mappleM 0 lapplem 0 =0 napplem 0,mappleM 0 lapplem 0 6=0 (i 0,i ){0,} napplem 0 mapplem 0 lapplem 0 6=0 By using Lemma 3, we get (i 0,i ){0,} napplem 0 mapplem 0 lapplem 0 6=0 napplem 0,mappleM 0 lapplem 0 =0 (nml) 3/ (nml) 3/ (nml) 3/ Z Z (nml) 3/ (nml) 3/ Z Z p t 3/ cos t t 3/ cos p t 3/ cos t Z t 3/ cos p t 3/ cos t..," /+". Recall that based on the hypotheses of () and (5), the series c ( ) converges absolutely. hen, we obtain / 3p (i 0,i ){0,} Lemma (c) leads to napplem 0,mappleM 0 lapplem 0 =0 (nml) 3/ Z t 3/ cos = / 3 c (, M 0 ) ( ) 7/ 7/ = / 3 [c ( ) + c (, M 0 ) c ( )] ( ) 7/ 7/ = / 3 c ( ) ( ) 7/ 7/ + O," 7/ c ( ) c (, M 0 ). c ( ) c (, M 0 )," M 5/+" 0," 5/+". Hence, we get / 3 c ( ) ( ) 7/ 7/ + O," 7/ c ( ) c (, M 0 )
16 IEGERS: 6 (06) 6 and therefe, F the sum S, we have = / 3 c ( ) ( ) 7/ 7/ + O," 37/+" S = / 3 c ( ) ( ) 7/ 7/ + O," 37/+". S = / ( p ) 3 Z t 3/ cos Fmula () implies that S = / 3p napplem 0 mapplem 0 M 0<lappleM p nt cos (i 0,i ){0,} napplem 0 mapplem 0 M 0 <lapplem Z (nml) 3/ p mt (nml) 3/ cos p lt p t 3/ cos t. / 3p (i 0,i ){0,} napplem 0 mapplem 0 M 0 <lapplem (nml) 3/ Z p t 3/ cos t / 3p (i 0,i ){0,} napplem 0 mapplem 0 M 0 <lapplem =0 (nml) 3/ Z t 3/ cos + / 3p (i 0,i ){0,} napplem 0 mapplem 0 M 0 <lapplem 6=0 (nml) 3/ Z p t 3/ cos t.
17 IEGERS: 6 (06) 7 By virtue of Lemma (c), we obtain (i 0,i ){0,} napplem 0,mappleM 0 M 0<lappleM =0 (nml) 3/ Z t 3/ cos," 7/ (i 0,i ){0,} + n,m,l= =0 (nml) 3/ (i 0,i ){0,}," 7/ c ( ) c (, M 0 )," 7/ c ( ) c (, M 0 )," 7/ M 5/+" 0," 37/+". napplem 0,mappleM 0,lappleM 0 =0 (nml) 3/ herefe, we get (i 0,i ){0,} napplem 0,mappleM 0 M 0<lappleM =0 (nml) 3/ Z t 3/ cos," 37/+". (3) In addition, we have / 3p = / 3p + / 3p (i 0,i ){0,} napplem 0 mapplem 0 M 0 <lapplem 6=0 (nml) 3/ (i 0,i ){0,} napplem 0,mappleM 0 M 0 <lapple(50m 0 / ) 6=0 (i 0,i ){0,} napplem 0,mappleM 0 (50M 0 / )<lapplem 6=0 Z (nml) 3/ (nml) 3/ p t 3/ cos t Z Z p t 3/ cos t p t 3/ cos t.
18 IEGERS: 6 (06) ow, by applying Lemma 3 (b), we obtain (i 0,i ){0,} napplem 0,mappleM 0 M 0 <lapple(50m 0 / ) 6=0 (nml) 3/," /+". Z p t 3/ cos t If (50M 0 / ) < l, then (i 0,i ){0,} napplem 0,mappleM 0 (50M 0 / )<lapplem 6=0 p l. Hence, by Lemma 3 (a), we get (nml) 3/ Z p t 3/ cos t," /+". It follows that S," /+". By using the same arguments as above, we obtain S 3," /+". F the sum S, we have S / 3p + / 3p (i 0,i ){0,} (i 0,i ){0,} napplem 0,mappleM 0 M 0 <lapplem =0 (nml) 3/ (nml) 3/ napplem 0 mapplem 0 M 0 <lapplem 6=0 Z Z t 3/ cos t 3/ cos p t. Lemma 3 (a) implies that (i 0,i ){0,} napplem 0,mappleM 0 M 0 <lapplem 6=0 (nml) 3/," 3/+" 7/ /+" +," /+". Z p t 3/ cos t hus, by Fmula (3) and the last bound, we get S," /+".
19 IEGERS: 6 (06) 9 By the same arguments applied on the sums S 5 and S 6, we deduce that S 5," /+" and S 6," /+". By summing up S to S 6 above, we obtain Z (B M (t)) B M ( t) = / 3 c ( ) ( ) 7/ 7/ + O," /+". herefe, we get the following fmula Z A f (t)a f ( t) = / 3 c ( ) ( ) 7/ 7/ + O," /+". Put = /, /,... After summing up, we find Let We finally get Z Z A f (t)a f ( t) = / 3 c ( ) 7/ + O," /+". C f ( ) := / 3 c ( ). A f (t)a f ( t) = C f ( ) 7/ + O," /+". Remark. If =, then we find the cubic moment f A f (x) : Z A 3 f (t) = O " /+". We just have to prove that C f () = 0 c () = 0. A simple way to get it is the use of the assertion 3 of heem with = Q +. Generally, if Q + p Q +, we have the same upper bound which means Z A f (t)a f ( t) = O," /+" and this is also a consequence of the assertion 3 of heem.. Sign of the Constant C f ( ) In this section, we are interested in the discussion of the sign of the constant C f ( ). Since C f ( ) = / c 3 ( ), it su ces then to discuss the sign of c ( ). F that, we shall prove heem.
20 IEGERS: 6 (06) 0 Proof.. If satisfies (), then by using the previous steps in the proof of Lemma, f all positive integers n, m and l such that p n ± p m = p l, we get < n = d tr l 00 < : m = d t s l 00 l = a 0 b 0 d l 00 : n = d t s l 00 m = d tr l 00 l = a 0 b 0 d l 00. In this case, we have = d apple tr d a 0 + t b0 s ± rs p. Suppose that d = d a 0 b 0 =. hen, becomes = tr + t s ± rs p. herefe, we obtain c ( ) = = + f (tr l 00 ) f t s l 00 f (l 00 ) (s r l 003 ) 3/ (s r ) 3/ + f (tr l 00 ) f t s l 00 f (l 00 ). l 009/ Accding to (), we have f (tr l 00 ) f t s l 00 = d gcd(tr l 00, t s l 00 ) f r s l 00 d. () But gcd(r, s) = gcd t, t =, since is a square-free integer. It follows that gcd tr, t s = and this implies that gcd tr l 00, t s l 00 = l 00. hus, Fmula () leads to f (tr l 00 ) f t s l 00 = f r s l00 d. (5) d l 00 By applying Fmula (), and since gcd r s l 00, l 00 d l 00 f r s l00 = f r s l 00 f (l 00 ). hus, Fmula () joined on to (5) results in f (tr l 00 ) f t s l 00 d = l 00, one can deduce that f (l 00 ) = f r s l 00 f (l 00 ). (6)
21 IEGERS: 6 (06) By using Fmula (6) and by the expression of c ( ) in our case, we have! + f r s l 00 f (l 00 ) c ( ) = (s r ) 3/ l 009/! + = 6 f r s l 00 f (l 00 ) (s r ) 3/ l 009/ r s l 00 A + = + (s r ) 3/ (S + S ). + r s l 00 A f r s l 00 f (l 00 ) l 009/! It follows that, if S + > S, then c ( ) > 0, and therefe, C f ( ) > 0. Besides, if S + < S, then c ( ) < 0, and therefe, C f ( ) < 0.. If satisfies (5), then we have < n = (d tr l 00 ) m = : d t s l 00 l = a 0 b 0 d l 00 < : n = d t s l 00 m = (d tr l 00 ) l = a 0 b 0 d l 00. ote that n and m are well-defined if l 00 and d are not both odd. Hence, we have = d apple tr d a 0 + t b0 s ± rs p. Suppose that d = and d a 0 b 0 =. So, the expression of becomes = tr + t s ± rs p and thus, c ( ) = (s r ) 3/ + f (tr l 00 ) f t s l 00 f (l 00 ). l 009/ By following the same procedure as in the proof of., we get: c ( ) = (s r ) 3/ (S + S ). We conclude also that, if S + > S, then C f ( ) > 0, and if not, then C f ( ) apple 0.
22 IEGERS: 6 (06) 3. If is a positive rational number and the equation p n + ( ) i 0 p m + ( ) i p l = 0, (i0, i ) {0, } is solvable in n, m and l, then by the result of Lemma (a), we have = d apple tr d a 0 + t b0 s ± rs p = d apple tr d a 0 + t b0 s ± rs p. p Since = a a + b b, then = a a, with gcd(a, a ) = and b = 0. It follows that gcd(b, b ) = gcd(0, b ) = b =. herefe, we obtain d = a > 0 and a 0 = b 0 = d =. hus, we get a = a 0 d =. Hence, we find that = a. So, we have tr + t s = tr + t s = rs = 0 rs = 0. ow, if satisfies (), then tr + t s =. his implies that tr = 0 t s = 0, and r = 0 s = 0. But, we have n = a tr l 00 m = a t s l 00 n = a t s l 00 m = a tr l 00. herefe, n = 0 m = 0. his contradicts the fact that n, m. If satisfies (5), then tr + t s = and therefe, tr = t s =. his leads to n = m = a l 00. Set l 00 = q to be even. hus, we have n = m = a q and l = l 00. he equation p n + ( ) i 0 p m + ( ) i p l = 0, (i0, i ) {0, } leads to p a q + ( ) i0p a q + ( ) i p a q = 0, (i 0, i ) {0, }. his is equivalent to p p i a q h + ( ) i0 + ( ) i = 0, (i 0, i ) {0, }. It is clear that f all (i 0, i ) {0, }, we have + ( ) i0 + ( ) i p 6= 0. Hence, the equation p n + ( ) i 0 p m + ( p ) i l = 0, (i0, i ) {0, }
23 IEGERS: 6 (06) 3 is not solvable in the case of = a = a a, which is a positive rational number, and therefe, c ( ) = 0 = C f ( ). ote that, in this case, we can also consider the fact that rs = 0 which implies that r = 0 s = 0, and since tr = t s =, we then get the contradiction. Suppose now that p Q + and that the equation p n + ( ) i 0 p m + ( ) i p l = 0, (i0, i ) {0, } is solvable in n, m and l. Lemma (a) yields = d d a 0 b0 apple tr + t s ± rs p = d apple tr d a 0 + t b0 s ± rs p. p p Since = a a + b b, then = b b. hus, a = 0, gcd(a, a ) = a =, d = bp > 0 and d = a 0 = b 0 =. Since d = gcd(a, b ) = b =, then = b. Hence, we obtain b tr + t s = 0 b tr + t s = 0 b rs = b b rs = b. In both cases, we have tr + t s = 0, and this is equivalent to tr = t s = 0. If satisfies (), then n = b tr l 00 m = b t s l 00 and if satisfies (5), then n = b tr l 00 m = b t s l 00 n = b t s l 00 m = b tr l 00 n = b t s l 00 m = b tr l 00. herefe, in both cases, n = m = 0. Meover, the equation p n + ( ) i 0 p m + ( ) i p l = 0, (i0, i ) {0, } is solvable, which implies that n = m = l = 0. his contradicts the fact that n, m and l. Hence, we get c ( ) = 0 = C f ( ). ote that we can show the contradiction when satisfies () by using the equality b rs = b, which is equivalent to rs = and this can not happen f positive integers r and s.
24 IEGERS: 6 (06) Acknowledgements. he auth would like to thank the anonymous referee s careful reading and comments which improved the exposition of the paper. hanks are also sent to Profess Alexander Ivić f many suggestions and f his valuable remarks that contributed to the improvement of this wk. References [] P. Deligne, La conjecture de Weil I, Publ. Math. Inst. Hautes Études Sci. (97), [] P. Deligne, La conjecture de Weil II, Publ. Math. Inst. Hautes Études Sci. 5 (9), 33-. [3] E. Hecke, Über modulfunktionen und die Dirichletscher reihen mit Eulercher produktentwicklung I, Math. Ann. () (937), -. [] E. Hecke, Über modulfunktionen und die Dirichletscher reihen mit Eulercher produktentwicklung II, Math. Ann. () (937), [5] Y.-K. Lau and J. Wu, he number of Hecke eigenvalues of same signs, Math. Z. 63 (009), [6] H. Lao, Mean square estimates f coe cients of symmetric power L functions, Acta Appl. Math. 0 (00), [7] R. A. Rankin, Sums of cusp fm coe cients, automphic fms and analytic number they (Montreal, PQ, 99), Univ. Montréal, Montreal, QC (990), 5-. [] J. Wu, Power sums of Hecke eigenvalues and application, Acta Arith. 37 (009),
MATH FINAL EXAM REVIEW HINTS
MATH 109 - FINAL EXAM REVIEW HINTS Answer: Answer: 1. Cardinality (1) Let a < b be two real numbers and define f : (0, 1) (a, b) by f(t) = (1 t)a + tb. (a) Prove that f is a bijection. (b) Prove that any
More informationMEAN SQUARE ESTIMATE FOR RELATIVELY SHORT EXPONENTIAL SUMS INVOLVING FOURIER COEFFICIENTS OF CUSP FORMS
Annales Academiæ Scientiarum Fennicæ athematica Volumen 40, 2015, 385 395 EAN SQUARE ESTIATE FOR RELATIVELY SHORT EXPONENTIAL SUS INVOLVING FOURIER COEFFICIENTS OF CUSP FORS Anne-aria Ernvall-Hytönen University
More informationSign changes of Fourier coefficients of cusp forms supported on prime power indices
Sign changes of Fourier coefficients of cusp forms supported on prime power indices Winfried Kohnen Mathematisches Institut Universität Heidelberg D-69120 Heidelberg, Germany E-mail: winfried@mathi.uni-heidelberg.de
More informationOn the number of dominating Fourier coefficients of two newforms
On the number of dominating Fourier coefficients of two newforms Liubomir Chiriac Abstract Let f = n 1 λ f (n)n (k 1 1)/2 q n and g = n 1 λg(n)n(k 2 1)/2 q n be two newforms with real Fourier coeffcients.
More informationA Pellian equation with primes and applications to D( 1)-quadruples
A Pellian equation with primes and applications to D( 1)-quadruples Andrej Dujella 1, Mirela Jukić Bokun 2 and Ivan Soldo 2, 1 Department of Mathematics, Faculty of Science, University of Zagreb, Bijenička
More informationAdvances in Applied Mathematics 48(2012), Constructing x 2 for primes p = ax 2 + by 2
Advances in Applied Mathematics 4(01, 106-10 Constructing x for primes p ax + by Zhi-Hong Sun School of Mathematical Sciences, Huaiyin Normal University, Huaian, Jiangsu 3001, P.R. China E-mail: zhihongsun@yahoo.com
More informationOn Rankin-Cohen Brackets of Eigenforms
On Rankin-Cohen Brackets of Eigenforms Dominic Lanphier and Ramin Takloo-Bighash July 2, 2003 1 Introduction Let f and g be two modular forms of weights k and l on a congruence subgroup Γ. The n th Rankin-Cohen
More informationOn Some Mean Value Results for the Zeta-Function and a Divisor Problem
Filomat 3:8 (26), 235 2327 DOI.2298/FIL6835I Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat On Some Mean Value Results for the
More informationTHE DENOMINATORS OF POWER SUMS OF ARITHMETIC PROGRESSIONS. Bernd C. Kellner Göppert Weg 5, Göttingen, Germany
#A95 INTEGERS 18 (2018) THE DENOMINATORS OF POWER SUMS OF ARITHMETIC PROGRESSIONS Bernd C. Kellner Göppert Weg 5, 37077 Göttingen, Germany b@bernoulli.org Jonathan Sondow 209 West 97th Street, New Yor,
More informationarxiv: v3 [math.nt] 28 Jul 2012
SOME REMARKS ON RANKIN-COHEN BRACKETS OF EIGENFORMS arxiv:1111.2431v3 [math.nt] 28 Jul 2012 JABAN MEHER Abstract. We investigate the cases for which products of two quasimodular or nearly holomorphic eigenforms
More informationON `-TH ORDER GAP BALANCING NUMBERS
#A56 INTEGERS 18 (018) ON `-TH ORDER GAP BALANCING NUMBERS S. S. Rout Institute of Mathematics and Applications, Bhubaneswar, Odisha, India lbs.sudhansu@gmail.com; sudhansu@iomaorissa.ac.in R. Thangadurai
More informationThe commutator subgroup and the index formula of the Hecke group H 5
J. Group Theory 18 (2015), 75 92 DOI 10.1515/jgth-2014-0040 de Gruyter 2015 The commutator subgroup and the index formula of the Hecke group H 5 Cheng Lien Lang and Mong Lung Lang Communicated by James
More informationElliptic Curves & Number Theory. R. Sujatha School of Mathematics TIFR
Elliptic Curves & Number Theory R. Sujatha School of Mathematics TIFR Aim: To explain the connection between a simple ancient problem in number theory and a deep sophisticated conjecture about Elliptic
More informationOn the lines passing through two conjugates of a Salem number
Under consideration for publication in Math. Proc. Camb. Phil. Soc. 1 On the lines passing through two conjugates of a Salem number By ARTŪRAS DUBICKAS Department of Mathematics and Informatics, Vilnius
More informationAbstract. Roma Tre April 18 20, th Mini Symposium of the Roman Number Theory Association (RNTA) Michel Waldschmidt
Roma Tre April 8 0, 08 4th Mini Symposium of the Roman umber Theory Association (RTA) Representation of integers by cyclotomic binary forms Michel Waldschmidt Institut de Mathématiques de Jussieu Paris
More informationDistribution of Fourier coefficients of primitive forms
Distribution of Fourier coefficients of primitive forms Jie WU Institut Élie Cartan Nancy CNRS et Nancy-Université, France Clermont-Ferrand, le 25 Juin 2008 2 Presented work [1] E. Kowalski, O. Robert
More informationA weak multiplicity-one theorem for Siegel modular forms
A weak multiplicity-one theorem for Siegel modular forms Rudolf Scharlau Department of Mathematics University of Dortmund 44221 Dortmund, Germany scharlau@math.uni-dortmund.de Lynne Walling Department
More information12x + 18y = 50. 2x + v = 12. (x, v) = (6 + k, 2k), k Z.
Math 3, Fall 010 Assignment 3 Solutions Exercise 1. Find all the integral solutions of the following linear diophantine equations. Be sure to justify your answers. (i) 3x + y = 7. (ii) 1x + 18y = 50. (iii)
More informationPARITY OF THE PARTITION FUNCTION. (Communicated by Don Zagier)
ELECTRONIC RESEARCH ANNOUNCEMENTS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 1, Issue 1, 1995 PARITY OF THE PARTITION FUNCTION KEN ONO (Communicated by Don Zagier) Abstract. Let p(n) denote the number
More informationSquares in products with terms in an arithmetic progression
ACTA ARITHMETICA LXXXVI. (998) Squares in products with terms in an arithmetic progression by N. Saradha (Mumbai). Introduction. Let d, k 2, l 2, n, y be integers with gcd(n, d) =. Erdős [4] and Rigge
More informationSIMULTANEOUS SIGN CHANGE OF FOURIER-COEFFICIENTS OF TWO CUSP FORMS
SIMULTANEOUS SIGN CHANGE OF FOURIER-COEFFICIENTS OF TWO CUSP FORMS SANOLI GUN, WINFRIED KOHNEN AND PURUSOTTAM RATH ABSTRACT. We consider the simultaneous sign change of Fourier coefficients of two modular
More informationArithmetic properties of the Ramanujan function
Proc. Indian Acad. Sci. (Math. Sci.) Vol. 116, No. 1, February 2006, pp. 1 8. Printed in India Arithmetic properties of the Ramanujan function FLORIAN LUCA 1 and IGOR E SHPARLINSKI 2 1 Instituto de Matemáticas,
More informationON THE LIMIT POINTS OF THE FRACTIONAL PARTS OF POWERS OF PISOT NUMBERS
ARCHIVUM MATHEMATICUM (BRNO) Tomus 42 (2006), 151 158 ON THE LIMIT POINTS OF THE FRACTIONAL PARTS OF POWERS OF PISOT NUMBERS ARTŪRAS DUBICKAS Abstract. We consider the sequence of fractional parts {ξα
More informationFive regular or nearly-regular ternary quadratic forms
ACTA ARITHMETICA LXXVII.4 (1996) Five regular nearly-regular ternary quadratic fms by William C. Jagy (Berkeley, Calif.) 1. Introduction. In a recent article [6], the positive definite ternary quadratic
More information#A61 INTEGERS 14 (2014) SHORT EFFECTIVE INTERVALS CONTAINING PRIMES
#A6 INTEGERS 4 (24) SHORT EFFECTIVE INTERVALS CONTAINING PRIMES Habiba Kadiri Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, Canada habiba.kadiri@uleth.ca Allysa
More informationPALINDROMIC SUMS OF PROPER DIVISORS. Paul Pollack Department of Mathematics, University of Georgia, Athens, Georgia
#A3 INTEGERS 5A (205) PALINDROMIC SUMS OF PROPER DIVISORS Paul Pollack Department of Mathematics, University of Georgia, Athens, Georgia pollack@math.uga.edu Received: 0/29/3, Accepted: 6/8/4, Published:
More information64 Garunk»stis and Laurin»cikas can not be satised for any polynomial P. S. M. Voronin [10], [12] obtained the functional independence of the Riemann
PUBLICATIONS DE L'INSTITUT MATHÉMATIQUE Nouvelle série, tome 65 (79), 1999, 63 68 ON ONE HILBERT'S PROBLEM FOR THE LERCH ZETA-FUNCTION R. Garunk»stis and A. Laurin»cikas Communicated by Aleksandar Ivić
More informationMULTIPLE HARMONIC SUMS AND MULTIPLE HARMONIC STAR SUMS ARE (NEARLY) NEVER INTEGERS
#A0 INTEGERS 7 (207) MULTIPLE HARMONIC SUMS AND MULTIPLE HARMONIC STAR SUMS ARE (NEARLY) NEVER INTEGERS Khodabakhsh Hessami Pilehrood The Fields Institute for Research in Mathematical Sciences, Toronto,
More informationNON-VANISHING OF THE PARTITION FUNCTION MODULO SMALL PRIMES
NON-VANISHING OF THE PARTITION FUNCTION MODULO SMALL PRIMES MATTHEW BOYLAN Abstract Let pn be the ordinary partition function We show, for all integers r and s with s 1 and 0 r < s, that #{n : n r mod
More informationRamanujan-type Congruences for Broken 2-Diamond Partitions Modulo 3
Ramanujan-type Congruences for Broken 2-Diamond Partitions Modulo 3 William Y.C. Chen 1, Anna R.B. Fan 2 and Rebecca T. Yu 3 1,2,3 Center for Combinatorics, LPMC-TJKLC Nankai University, Tianjin 300071,
More informationNOTES ON INTEGERS. 1. Integers
NOTES ON INTEGERS STEVEN DALE CUTKOSKY The integers 1. Integers Z = {, 3, 2, 1, 0, 1, 2, 3, } have addition and multiplication which satisfy familar rules. They are ordered (m < n if m is less than n).
More information#A14 INTEGERS 18A (2018) COMPUTATIONAL REDISCOVERY OF RAMANUJAN S TAU NUMBERS
#A14 INTEGERS 18A (2018) COMPUTATIONAL REDISCOVERY OF RAMANUJAN S TAU NUMBERS Yuri Matiyasevich 1 St.Petersburg Department of Steklov Institute of Mathematics St.Petersburg, Russia https://logic.pdmi.ras.ru/
More informationCongruent Number Problem and Elliptic curves
Congruent Number Problem and Elliptic curves December 12, 2010 Contents 1 Congruent Number problem 2 1.1 1 is not a congruent number.................................. 2 2 Certain Elliptic Curves 4 3 Using
More informationBinary quadratic forms and sums of triangular numbers
Binary quadratic forms and sums of triangular numbers Zhi-Hong Sun( ) Huaiyin Normal University http://www.hytc.edu.cn/xsjl/szh Notation: Z the set of integers, N the set of positive integers, [x] the
More information#A5 INTEGERS 18A (2018) EXPLICIT EXAMPLES OF p-adic NUMBERS WITH PRESCRIBED IRRATIONALITY EXPONENT
#A5 INTEGERS 8A (208) EXPLICIT EXAMPLES OF p-adic NUMBERS WITH PRESCRIBED IRRATIONALITY EXPONENT Yann Bugeaud IRMA, UMR 750, Université de Strasbourg et CNRS, Strasbourg, France bugeaud@math.unistra.fr
More informationMATH10040: Numbers and Functions Homework 1: Solutions
MATH10040: Numbers and Functions Homework 1: Solutions 1. Prove that a Z and if 3 divides into a then 3 divides a. Solution: The statement to be proved is equivalent to the statement: For any a N, if 3
More informationProofs Not Based On POMI
s Not Based On POMI James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University February 12, 2018 Outline 1 Non POMI Based s 2 Some Contradiction s 3
More informationRepresentations of integers as sums of an even number of squares. Özlem Imamoḡlu and Winfried Kohnen
Representations of integers as sums of an even number of squares Özlem Imamoḡlu and Winfried Kohnen 1. Introduction For positive integers s and n, let r s (n) be the number of representations of n as a
More informationTAMAGAWA NUMBERS OF ELLIPTIC CURVES WITH C 13 TORSION OVER QUADRATIC FIELDS
TAMAGAWA NUMBERS OF ELLIPTIC CURVES WITH C 13 TORSION OVER QUADRATIC FIELDS FILIP NAJMAN Abstract. Let E be an elliptic curve over a number field K c v the Tamagawa number of E at v and let c E = v cv.
More informationSolutions of the Diophantine Equation p x + (p+6) y = z 2 when p, (p + 6) are Primes and x + y = 2, 3, 4
Annals of Pure and Applied Mathematics Vol. 17, No. 1, 2018, 101-106 ISSN: 2279-087X (P), 2279-0888(online) Published on 3 May 2018 www.researchmathsci.g DOI: http://dx.doi.g/10.22457/apam.v17n1a11 Annals
More informationA Geometric Proof that e is Irrational and a New Measure of its Irrationality
A Geometric Proof that e is Irrational and a New Measure of its Irrationality Jonathan Sondow. INTRODUCTION. While there exist geometric proofs of irrationality for 2 [2], [27], no such proof for e, π,
More informationOn the equality case of the Ramanujan Conjecture for Hilbert modular forms
On the equality case of the Ramanujan Conjecture for Hilbert modular forms Liubomir Chiriac Abstract The generalized Ramanujan Conjecture for unitary cuspidal automorphic representations π on GL 2 posits
More informationOn the Error Term for the Mean Value Associated With Dedekind Zeta-function of a Non-normal Cubic Field
Λ44ΩΛ6fi Ψ ο Vol.44, No.6 05ffμ ADVANCES IN MAHEMAICS(CHINA) Nov., 05 doi: 0.845/sxjz.04038b On the Error erm for the Mean Value Associated With Dedekind Zeta-function of a Non-normal Cubic Field SHI Sanying
More informationarxiv:math/ v3 [math.co] 15 Oct 2006
arxiv:math/060946v3 [math.co] 15 Oct 006 and SUM-PRODUCT ESTIMATES IN FINITE FIELDS VIA KLOOSTERMAN SUMS DERRICK HART, ALEX IOSEVICH, AND JOZSEF SOLYMOSI Abstract. We establish improved sum-product bounds
More informationThe Langlands Program: Beyond Endoscopy
The Langlands Program: Beyond Endoscopy Oscar E. González 1, oscar.gonzalez3@upr.edu Kevin Kwan 2, kevinkwanch@gmail.com 1 Department of Mathematics, University of Puerto Rico, Río Piedras. 2 Department
More informationSOME FIXED POINT RESULTS FOR ADMISSIBLE GERAGHTY CONTRACTION TYPE MAPPINGS IN FUZZY METRIC SPACES
Iranian Journal of Fuzzy Systems Vol. 4, No. 3, 207 pp. 6-77 6 SOME FIXED POINT RESULTS FOR ADMISSIBLE GERAGHTY CONTRACTION TYPE MAPPINGS IN FUZZY METRIC SPACES M. DINARVAND Abstract. In this paper, we
More informationETA-QUOTIENTS AND ELLIPTIC CURVES
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 125, Number 11, November 1997, Pages 3169 3176 S 0002-9939(97)03928-2 ETA-QUOTIENTS AND ELLIPTIC CURVES YVES MARTIN AND KEN ONO (Communicated by
More informationSUM-PRODUCT ESTIMATES IN FINITE FIELDS VIA KLOOSTERMAN SUMS
SUM-PRODUCT ESTIMATES IN FINITE FIELDS VIA KLOOSTERMAN SUMS DERRICK HART, ALEX IOSEVICH, AND JOZSEF SOLYMOSI Abstract. We establish improved sum-product bounds in finite fields using incidence theorems
More informationSeries of Integers in Arithmetic Progression with a Common Property of Two Parts of Equal Sums
IOSR Journal of Mathematics (IOSR-JM) e-issn: 78-578, p-issn: 39-765X. Volume, Issue Ver. III (Mar. - Apr. 06), PP 37-4 www.iosrjournals.org Series of Integers in Arithmetic Progression with a Common Property
More informationLecture 12 : Hecke Operators and Hecke theory
Math 726: L-functions and modular forms Fall 2011 Lecture 12 : Hecke Operators and Hecke theory Instructor: Henri Darmon Notes written by: Celine Maistret Recall that we found a formula for multiplication
More informationRESEARCH STATEMENT OF LIANGYI ZHAO
RESEARCH STATEMENT OF LIANGYI ZHAO I. Research Overview My research interests mainly lie in analytic number theory and include mean-value type theorems, exponential and character sums, L-functions, elliptic
More informationA Motivated Introduction to Modular Forms
May 3, 2006 Outline of talk: I. Motivating questions II. Ramanujan s τ function III. Theta Series IV. Congruent Number Problem V. My Research Old Questions... What can you say about the coefficients of
More informationON THE POSITIVITY OF THE NUMBER OF t CORE PARTITIONS. Ken Ono. 1. Introduction
ON THE POSITIVITY OF THE NUMBER OF t CORE PARTITIONS Ken Ono Abstract. A partition of a positive integer n is a nonincreasing sequence of positive integers whose sum is n. A Ferrers graph represents a
More informationCharacter sums with Beatty sequences on Burgess-type intervals
Character sums with Beatty sequences on Burgess-type intervals William D. Banks Department of Mathematics University of Missouri Columbia, MO 65211 USA bbanks@math.missouri.edu Igor E. Shparlinski Department
More informationarxiv: v1 [math.nt] 22 Jun 2014
FIGURATE PRIMES AND HILBERT S 8TH PROBLEM TIANXIN CAI, YONG ZHANG, AND ZHONGYAN SHEN arxiv:140.51v1 [math.nt] 22 Jun 2014 Abstract. In this paper, by using the they of elliptic curves, we discuss several
More informationHECKE OPERATORS ON CERTAIN SUBSPACES OF INTEGRAL WEIGHT MODULAR FORMS.
HECKE OPERATORS ON CERTAIN SUBSPACES OF INTEGRAL WEIGHT MODULAR FORMS. MATTHEW BOYLAN AND KENNY BROWN Abstract. Recent works of Garvan [2] and Y. Yang [7], [8] concern a certain family of half-integral
More informationTHE STRUCTURE OF RAINBOW-FREE COLORINGS FOR LINEAR EQUATIONS ON THREE VARIABLES IN Z p. Mario Huicochea CINNMA, Querétaro, México
#A8 INTEGERS 15A (2015) THE STRUCTURE OF RAINBOW-FREE COLORINGS FOR LINEAR EQUATIONS ON THREE VARIABLES IN Z p Mario Huicochea CINNMA, Querétaro, México dym@cimat.mx Amanda Montejano UNAM Facultad de Ciencias
More information1. multiplication is commutative and associative;
Chapter 4 The Arithmetic of Z In this chapter, we start by introducing the concept of congruences; these are used in our proof (going back to Gauss 1 ) that every integer has a unique prime factorization.
More informationMath Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions
Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. A prime number
More informationON THE NUMBER OF PAIRS OF INTEGERS WITH LEAST COMMON MULTIPLE NOT EXCEEDING x H. JAGER
MATHEMATICS ON THE NUMBER OF PAIRS OF INTEGERS WITH LEAST COMMON MULTIPLE NOT EXCEEDING x BY H. JAGER (Communicated by Prof. J. PoPKEN at the meeting of March 31, 1962) In this note we shall derive an
More informationMATH 271 Summer 2016 Practice problem solutions Week 1
Part I MATH 271 Summer 2016 Practice problem solutions Week 1 For each of the following statements, determine whether the statement is true or false. Prove the true statements. For the false statement,
More informationCONGRUENCES FOR BROKEN k-diamond PARTITIONS
CONGRUENCES FOR BROKEN k-diamond PARTITIONS MARIE JAMESON Abstract. We prove two conjectures of Paule and Radu from their recent paper on broken k-diamond partitions. 1. Introduction and Statement of Results
More informationarxiv: v2 [math.nt] 8 Jun 2010
ON THE EAN SQUARE OF SHORT EXPONENTIAL SUS RELATED TO CUSP FORS ANNE-ARIA ERNVALL-HYTÖNEN arxiv:1005.3690v [math.nt] 8 Jun 010 Abstract. The purpose of the article is to estimate the mean square of a squareroot
More informationRamanujan-type congruences for broken 2-diamond partitions modulo 3
Progress of Projects Supported by NSFC. ARTICLES. SCIENCE CHINA Mathematics doi: 10.1007/s11425-014-4846-7 Ramanujan-type congruences for broken 2-diamond partitions modulo 3 CHEN William Y.C. 1, FAN Anna
More informationProofs Not Based On POMI
s Not Based On POMI James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University February 1, 018 Outline Non POMI Based s Some Contradiction s Triangle
More informationPACKING POLYNOMIALS ON SECTORS OF R 2. Caitlin Stanton Department of Mathematics, Stanford University, California
#A67 INTEGERS 14 (014) PACKING POLYNOMIALS ON SECTORS OF R Caitlin Stanton Department of Mathematics, Stanford University, California ckstanton@stanford.edu Received: 10/7/13, Revised: 6/5/14, Accepted:
More informationREGULARIZED PETERSSON INNER PRODUCTS FOR MEROMORPHIC MODULAR FORMS
REGULARIZED PETERSSON INNER PRODUCTS FOR MEROMORPHIC MODULAR FORMS BEN KANE Abstract. We investigate the history of inner products within the theory of modular forms. We first give the history of the applications
More informationSome problems on mean values and the universality of zeta and multiple zeta-functions
Some problems on mean values and the universality of zeta and multiple zeta-functions Kohji Matsumoto Abstract Here I propose and discuss several problems on analytic properties of some zeta-functions
More informationHecke-Operators. Alex Maier. 20th January 2007
Hecke-Operators Alex Maier 20th January 2007 Abstract At the beginning we introduce the Hecke-operators and analyse some of their properties. Then we have a look at normalized eigenfunctions of them and
More informationON SUMS OF PRIMES FROM BEATTY SEQUENCES. Angel V. Kumchev 1 Department of Mathematics, Towson University, Towson, MD , U.S.A.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #A08 ON SUMS OF PRIMES FROM BEATTY SEQUENCES Angel V. Kumchev 1 Department of Mathematics, Towson University, Towson, MD 21252-0001,
More informationExplicit Solutions of the Heat Equation
LECTURE 6 Eplicit Solutions of the Heat Equation Recall the -dimensional homogeneous) Heat Equation: ) u t a 2 u. In this lecture our goal is to construct an eplicit solution to the Heat Equation ) on
More informationg(x) = 1 1 x = 1 + x + x2 + x 3 + is not a polynomial, since it doesn t have finite degree. g(x) is an example of a power series.
6 Polynomial Rings We introduce a class of rings called the polynomial rings, describing computation, factorization and divisibility in such rings For the case where the coefficients come from an integral
More informationOn the distinctness of binary sequences derived from primitive sequences modulo square-free odd integers
On the distinctness of binary sequences derived from primitive sequences modulo square-free odd integers Qun-iong Zheng, Wen-Feng Qi and Tian Tian y August 2, 20 Abstract Let M be a square-free odd integer
More informationON THE POSSIBLE QUANTITIES OF FIBONACCI NUMBERS THAT OCCUR IN SOME TYPES OF INTERVALS
Acta Math. Univ. Comenianae Vol. LXXXVII, 2 (2018), pp. 291 299 291 ON THE POSSIBLE QUANTITIES OF FIBONACCI NUMBERS THAT OCCUR IN SOME TYPES OF INTERVALS B. FARHI Abstract. In this paper, we show that
More informationDifferential operators on Jacobi forms and special values of certain Dirichlet series
Differential operators on Jacobi forms and special values of certain Dirichlet series Abhash Kumar Jha and Brundaban Sahu Abstract We construct Jacobi cusp forms by computing the adjoint of a certain linear
More informationAN IDENTITY FOR SUMS OF POLYLOGARITHM FUNCTIONS. Steven J. Miller 1 Department of Mathematics, Brown University, Providence, RI 02912, USA.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 2008, #A15 AN IDENTITY FOR SUMS OF POLYLOGARITHM FUNCTIONS Steven J. Miller 1 Department of Mathematics, Brown University, Providence, RI 02912,
More informationARITHMETIC PROGRESSIONS OF SQUARES, CUBES AND n-th POWERS
ARITHMETIC PROGRESSIONS OF SQUARES, CUBES AND n-th POWERS L. HAJDU 1, SZ. TENGELY 2 Abstract. In this paper we continue the investigations about unlike powers in arithmetic progression. We provide sharp
More informationwith k = l + 1 (see [IK, Chapter 3] or [Iw, Chapter 12]). Moreover, f is a Hecke newform with Hecke eigenvalue
L 4 -NORMS OF THE HOLOMORPHIC DIHEDRAL FORMS OF LARGE LEVEL SHENG-CHI LIU Abstract. Let f be an L -normalized holomorphic dihedral form of prime level q and fixed weight. We show that, for any ε > 0, for
More informationPerfect Cuboid Inequalities
Perfect Cuboid Inequalities Abstract A new approach is given f resolving the Perfect Cuboid problem: proving many special cases impossible using inequality relationships. These results are directly applicable
More informationPARITY OF THE COEFFICIENTS OF KLEIN S j-function
PARITY OF THE COEFFICIENTS OF KLEIN S j-function CLAUDIA ALFES Abstract. Klein s j-function is one of the most fundamental modular functions in number theory. However, not much is known about the parity
More informationAdditive irreducibles in α-expansions
Publ. Math. Debrecen Manuscript Additive irreducibles in α-expansions By Peter J. Grabner and Helmut Prodinger * Abstract. The Bergman number system uses the base α = + 5 2, the digits 0 and, and the condition
More informationA Note on Jacobi Symbols and Continued Fractions
Reprinted from: The American Mathematical Monthly Volume 06, Number, pp 52 56 January, 999 A Note on Jacobi Symbols and Continued Fractions A. J. van der Poorten and P. G. Walsh. INTRODUCTION. It is well
More informationDue date: Monday, February 6, 2017.
Modern Analysis Homework 3 Solutions Due date: Monday, February 6, 2017. 1. If A R define A = {x R : x A}. Let A be a nonempty set of real numbers, assume A is bounded above. Prove that A is bounded below
More informationZAREMBA'S CONJECTURE AND SUMS OF THE DIVISOR FUNCTION
mathematics of computation volume 61, number 203 july 1993, pages 171-176 ZAREMBA'S CONJECTURE AND SUMS OF THE DIVISOR FUNCTION T. W. CUSICK Dedicated to the memory ofd. H. Lehmer Abstract. Zaremba conjectured
More informationAverage value of the Euler function on binary palindromes
Average value of the Euler function on binary palindromes William D. Banks Department of Mathematics, University of Missouri Columbia, MO 652 USA bbanks@math.missouri.edu Igor E. Shparlinski Department
More informationFlorian Luca Instituto de Matemáticas, Universidad Nacional Autonoma de México, C.P , Morelia, Michoacán, México
Florian Luca Instituto de Matemáticas, Universidad Nacional Autonoma de México, C.P. 8180, Morelia, Michoacán, México e-mail: fluca@matmor.unam.mx Laszlo Szalay Department of Mathematics and Statistics,
More information2k n. k=0. 3x 2 7 (mod 11) 5 4x 1 (mod 9) 2 r r +1 = r (2 r )
MATH 135: Randomized Exam Practice Problems These are the warm-up exercises and recommended problems take from the extra practice sets presented in random order. The challenge problems have not been included.
More informationProjects on elliptic curves and modular forms
Projects on elliptic curves and modular forms Math 480, Spring 2010 In the following are 11 projects for this course. Some of the projects are rather ambitious and may very well be the topic of a master
More informationPOLYGONAL-SIERPIŃSKI-RIESEL SEQUENCES WITH TERMS HAVING AT LEAST TWO DISTINCT PRIME DIVISORS
#A40 INTEGERS 16 (2016) POLYGONAL-SIERPIŃSKI-RIESEL SEQUENCES WITH TERMS HAVING AT LEAST TWO DISTINCT PRIME DIVISORS Daniel Baczkowski Department of Mathematics, The University of Findlay, Findlay, Ohio
More informationPERIODICITY OF SOME RECURRENCE SEQUENCES MODULO M
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #A42 PERIODICITY OF SOME RECURRENCE SEQUENCES MODULO M Artūras Dubickas Department of Mathematics and Informatics, Vilnius University,
More informationChakravala - a modern Indian method. B.Sury
Chakravala - a modern Indian method BSury Indian Statistical Institute Bangalore, India sury@isibangacin IISER Pune, India Lecture on October 18, 2010 1 Weil Unveiled What would have been Fermat s astonishment
More informationFERMAT S WORLD A TOUR OF. Outline. Ching-Li Chai. Philadelphia, March, Samples of numbers. 2 More samples in arithemetic. 3 Congruent numbers
Department of Mathematics University of Pennsylvania Philadelphia, March, 2016 Outline 1 2 3 4 5 6 7 8 9 Some familiar whole numbers 1. Examples of numbers 2, the only even prime number. 30, the largest
More information#A69 INTEGERS 13 (2013) OPTIMAL PRIMITIVE SETS WITH RESTRICTED PRIMES
#A69 INTEGERS 3 (203) OPTIMAL PRIMITIVE SETS WITH RESTRICTED PRIMES William D. Banks Department of Mathematics, University of Missouri, Columbia, Missouri bankswd@missouri.edu Greg Martin Department of
More informationMath Circle Beginners Group February 28, 2016 Euclid and Prime Numbers
Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. (a) Circle the prime
More informationAnalytic number theory for probabilists
Analytic number theory for probabilists E. Kowalski ETH Zürich 27 October 2008 Je crois que je l ai su tout de suite : je partirais sur le Zéta, ce serait mon navire Argo, celui qui me conduirait à la
More informationTHE TRIANGULAR THEOREM OF EIGHT AND REPRESENTATION BY QUADRATIC POLYNOMIALS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9939(XX)0000-0 THE TRIANGULAR THEOREM OF EIGHT AND REPRESENTATION BY QUADRATIC POLYNOMIALS WIEB BOSMA AND BEN
More information(k, l)-universality OF TERNARY QUADRATIC FORMS ax 2 + by 2 + cz 2
#A20 INTEGERS 18 (2018) (k, l)-universality OF TERNARY QUADRATIC FORMS ax 2 + by 2 + cz 2 Lerna Pehlivan Department of Mathematics and Statistics, Acadia University, Wolfville, Nova Scotia, Canada lerna.pehlivan@acadiau.ca
More informationConstructive bounds for a Ramsey-type problem
Constructive bounds for a Ramsey-type problem Noga Alon Michael Krivelevich Abstract For every fixed integers r, s satisfying r < s there exists some ɛ = ɛ(r, s > 0 for which we construct explicitly an
More informationDIVISIBILITY AND DISTRIBUTION OF PARTITIONS INTO DISTINCT PARTS
DIVISIBILITY AND DISTRIBUTION OF PARTITIONS INTO DISTINCT PARTS JEREMY LOVEJOY Abstract. We study the generating function for (n), the number of partitions of a natural number n into distinct parts. Using
More informationDecomposition of a recursive family of polynomials
Decomposition of a recursive family of polynomials Andrej Dujella and Ivica Gusić Abstract We describe decomposition of polynomials f n := f n,b,a defined by f 0 := B, f 1 (x := x, f n+1 (x = xf n (x af
More information