Open Access

A new sum analogous to quadratic Gauss sums and its 2k th power mean

Journal of Inequalities and Applications20142014:102

https://doi.org/10.1186/1029-242X-2014-102

Received: 29 January 2014

Accepted: 18 February 2014

Published: 4 March 2014

Abstract

The main purpose of this paper is using the analytic methods and the properties of Gauss sums to study the computational problem of a new sum analogous to quadratic Gauss sums, and to give an interesting asymptotic formula for its 2k th power mean.

MSC:11L03, 11L05.

Keywords

a sum analogous to quadratic Gauss sums2k th power meanasymptotic formula

1 Introduction

Let q 3 be an integer, and let χ be a Dirichlet character modq. Then for any integer n, the famous Gauss sums G ( χ , n ) and quadratic Gauss sums G 2 ( χ , n ) are defined as follows:
G ( χ , n ) = a = 1 q χ ( a ) e ( n a q ) and G 2 ( χ , n ) = a = 1 q χ ( a ) e ( n a 2 q ) ,

where e ( y ) = e 2 π i y .

These two sums play a very important role in the study of analytic number theory, and many famous number theoretic problems are closely related to them. The distribution of primes, the Goldbach problem, and the properties of Dirichlet L-functions are some good examples. The arithmetic properties of G ( χ , n ) and G 2 ( χ , n ) can be found in [1, 2], and [3].

The upper bound estimate of G 2 ( χ , n ) has been studied by some authors, and one obtained many important results. For example, if q = p is a prime and ( p , m ) = 1 , then from Weil’s work [4] we can obtain the estimate
| a = 1 p χ ( a ) e ( f ( a ) p ) | p 1 2 ,

where f ( x ) is a polynomial. Related work can also be found in [57], and [8].

In this paper, we introduce a new sum G ( χ , m , n , c ; q ) , analogous to quadratic Gauss sums G 2 ( χ , n ) , as follows:
G ( χ , m , n , c ; q ) = a = 0 q 1 b = 0 q 1 χ ( a 2 + n a b 2 n b + c ) e ( m b 2 m a 2 q ) ,

where c, m, and n are any integers, χ is a non-principal Dirichlet character modq.

In this paper, we shall study the asymptotic properties of G ( χ , m , n , c ; q ) . As regards this problem, it seems that none has studied it yet, at least we have not seen any related results before. The problem is interesting, because it has a close relation with the Gauss sums, and it is also analogous to quadratic Gauss sums. Of course, it can also help us to further understand and study the quadratic Gauss sums.

The main purpose of this paper is using the analytic method and the properties of Gauss sums to study the 2k th power mean of G ( χ , m , n , c ; p ) , and to give a sharp asymptotic formula for it. That is, we shall prove the following two conclusions.

Theorem 1 Let p be an odd prime, χ be any non-principal character modp. Then for any integers c, m and n with ( c m n , p ) = 1 , we have the estimate
p p | a = 0 p 1 b = 0 p 1 χ ( a 2 b 2 + n a n b + c ) e ( m b 2 m a 2 p ) | p + p .
Theorem 2 Let p be an odd prime, χ be any non-principal character modp, k be any fixed positive integer. Then for any integers m and n with ( m n , p ) = 1 , we have the asymptotic formula
c = 1 p 1 | a = 0 p 1 b = 0 p 1 χ ( a 2 b 2 + n a n b + c ) e ( m b 2 m a 2 p ) | 2 k = { p 2 k + 1 + k 2 3 k 2 2 p 2 k + O ( p 2 k 1 ) , if  χ  is the Legendre symbol  mod p ; p 2 k + 1 + k 2 3 k 2 2 p 2 k + O ( p 2 k 1 2 ) , if  χ  is a complex character  mod p .

From Theorem 2 we can also deduce the following two corollaries.

Corollary 1 Let p be an odd prime, χ be any non-real character modp. Then for any integers m and n with ( m n , p ) = 1 , we have the asymptotic formula
c = 1 p 1 | a = 0 p 1 b = 0 p 1 χ ( a 2 b 2 + n a n b + c ) e ( m b 2 m a 2 p ) | 6 = p 7 p 6 + O ( p 11 2 ) .
Corollary 2 Let p be an odd prime, χ be any non-real character modp. Then for any integers m and n with ( m n , p ) = 1 , we have the asymptotic formula
c = 1 p 1 | a = 0 p 1 b = 0 p 1 χ ( a 2 b 2 + n a n b + c ) e ( m b 2 m a 2 p ) | 8 = p 9 + p 8 + O ( p 15 2 ) .
For general integer q 3 , whether there exists an asymptotic formula for the 2k th power mean
c = 0 q 1 | a = 0 q 1 b = 0 q 1 χ ( a 2 + n a b 2 n b + c ) e ( m b 2 m a 2 q ) | 2 k

is an interesting open problem, where m and n are any integers with ( m n , q ) = 1 .

2 Proof of the theorems

To complete the proofs of our theorems, we need the following simple conclusion.

Lemma Let p be an odd prime, χ be any non-principal character modp. Then for any integers c, m, and n with ( c m n , p ) = 1 , we have the identity
| a = 0 p 1 b = 0 p 1 χ ( a 2 b 2 + n a n b + c ) e ( m b 2 m a 2 p ) | = p | 1 χ ¯ ( m c ) e ( m c p ) τ ( χ ¯ ) | .
Proof If ( n , p ) = 1 , then from the properties of Gauss sums and quadratic residue modp we have
a = 0 p 1 e ( n a 2 p ) = 1 + a = 1 p 1 e ( n a 2 p ) = 1 + a = 1 p 1 ( 1 + ( a p ) ) e ( n a p ) = a = 0 p 1 e ( n a p ) + a = 1 p 1 ( a p ) e ( n a p ) = ( n p ) a = 1 p 1 ( a p ) e ( a p ) = ( n p ) τ ( χ 2 ) ,
(1)

where χ 2 = ( p ) denotes the Legendre symbol.

Since χ is a non-principal Dirichlet character modp, from (1), for the properties of Gauss sums and a complete residue system modp we have
a = 0 p 1 b = 0 p 1 χ ( a 2 b 2 + n a n b + c ) e ( m b 2 m a 2 p ) = 1 τ ( χ ¯ ) a = 0 p 1 b = 0 p 1 r = 1 p 1 χ ¯ ( r ) e ( r ( a 2 + b 2 + n a n b + c ) p ) e ( m b 2 m a 2 p ) = 1 τ ( χ ¯ ) r = 1 p 1 χ ¯ ( r ) a = 0 p 1 b = 0 p 1 e ( ( r m ) a 2 + r n a ( r m ) b 2 n r b + c r p ) = 1 τ ( χ ¯ ) r = 1 p 1 ( r m , p ) = 1 χ ¯ ( r ) a = 0 p 1 b = 0 p 1 e ( 4 ¯ ( r m ) ( ( 2 a + r m ¯ n r ) 2 ( 2 b + r m ¯ n r ) 2 ) + r c p ) = 1 τ ( χ ¯ ) r = 1 p 1 ( r m , p ) = 1 χ ¯ ( r ) a = 0 p 1 b = 0 p 1 e ( ( r m ) ( a 2 b 2 ) + r c p ) = τ 2 ( χ 2 ) τ ( χ ¯ ) r = 1 p 1 ( r m , p ) = 1 χ ¯ ( r ) ( r m p ) 2 e ( r c p ) = τ 2 ( χ 2 ) τ ( χ ¯ ) ( r = 1 p 1 χ ¯ ( r ) e ( r c p ) χ ¯ ( m ) e ( m c p ) ) = τ 2 ( χ 2 ) ( χ ( c ) χ ¯ ( m ) e ( m c p ) τ ( χ ¯ ) ) ,
(2)

where n ¯ denotes the solution of the congruence equation n x 1 mod p .

For any non-principal character χ mod p , note that | τ ( χ ) | = p ; from (2) we may immediately complete the proof of our lemma. □

Now we use this lemma to prove our theorems. First we prove Theorem 1. In fact from the lemma and the absolute value inequality | a | | b | | a b | | a | + | b | we have the estimate
p p = p p | τ ( χ ¯ ) | | a = 0 p 1 b = 0 p 1 χ ( a 2 b 2 + n a n b + c ) e ( m b 2 m a 2 p ) | p + | p χ ¯ ( c m ) e ( m c p ) | | τ ( χ ¯ ) | = p + p .

This proves Theorem 1.

To prove Theorem 2, from the lemma we have
| a = 0 p 1 b = 0 p 1 χ ( a 2 b 2 + n a n b + c ) e ( m b 2 m a 2 p ) | 2 = p 2 ( 1 + 1 p ) p 2 ( χ ¯ ( m c ) e ( m c p ) τ ( χ ¯ ) χ ( m c ) e ( m c p ) τ ( χ ¯ ) ¯ ) .
(3)
So for any positive integer k 1 , from (3) and the binomial theorem we have
c = 1 p 1 | a = 0 p 1 b = 0 p 1 χ ( a 2 b 2 + n a n b + c ) e ( m b 2 m a 2 p ) | 2 k = c = 1 p 1 ( p 2 ( 1 + 1 p ) p 2 ( χ ¯ ( m c ) e ( m c p ) τ ( χ ¯ ) + χ ( m c ) e ( m c p ) τ ( χ ¯ ) ¯ ) ) k = p 2 k ( 1 + 1 p ) k ( p 1 ) c = 1 p 1 ( χ ¯ ( m c ) e ( m c p ) τ ( χ ¯ ) + χ ( m c ) e ( m c p ) τ ( χ ¯ ) ¯ ) × k p 2 k ( 1 + 1 p ) k 1 + k ( k 1 ) 2 p 2 k ( 1 + 1 p ) k 2 × c = 1 p 1 ( χ ¯ ( m c ) e ( m c p ) τ ( χ ¯ ) + χ ( m c ) e ( m c p ) τ ( χ ¯ ) ¯ ) 2 + k ( k 1 ) ( k 2 ) 6 p 2 k × ( 1 + 1 p ) k 3 c = 1 p 1 ( χ ¯ ( m c ) e ( m c p ) τ ( χ ¯ ) + χ ( m c ) e ( m c p ) τ ( χ ¯ ) ¯ ) 3 + O ( p 2 k 1 ) .
(4)
If χ = χ 2 is the Legendre symbol, note that we have the trigonometric identities
c = 1 p 1 χ ¯ 2 ( m c ) e ( 2 m c p ) τ 2 ( χ ¯ ) = c = 1 p 1 e ( 2 m c p ) τ 2 ( χ ¯ ) = 1 τ 2 ( χ ¯ ) = O ( 1 p ) , c = 1 p 1 χ 2 ( m c ) e ( 2 m c p ) τ 2 ( χ ¯ ) ¯ = c = 1 p 1 e ( 2 m c p ) τ 2 ( χ ¯ ) ¯ = 1 τ 2 ( χ ¯ ) ¯ = O ( 1 p ) , c = 1 p 1 χ ¯ ( m c ) e ( m c p ) τ ( χ ¯ ) χ ( m c ) e ( m c p ) τ ( χ ¯ ) ¯ = p 1 p
and
c = 1 p 1 ( χ ¯ ( m c ) e ( m c p ) τ ( χ ¯ ) + χ ( m c ) e ( m c p ) τ ( χ ¯ ) ¯ ) 3 = 1 τ 3 ( χ ¯ ) c = 1 p 1 χ ¯ 3 ( c ) e ( 3 c p ) + 3 p τ ( χ ¯ ) c = 1 p 1 χ ¯ ( c ) e ( c p ) + 1 τ ( χ ¯ ) ¯ 3 c = 1 p 1 χ 3 ( c ) e ( 3 c p ) + 3 p τ ( χ ¯ ) ¯ c = 1 p 1 χ ( c ) e ( c p ) = O ( 1 p ) ,
and from (4) we may immediately get the asymptotic formula
c = 1 p 1 | a = 0 p 1 b = 0 p 1 χ ( a 2 b 2 + n a n b + c ) e ( m b 2 m a 2 p ) | 2 k = p 2 k ( 1 + 1 p ) k ( p 1 ) 2 k p 2 k ( 1 + 1 p ) k 1 + k ( k 1 ) 2 p 2 k ( 1 + 1 p ) k 2 p 1 p + O ( p 2 k 1 ) = p 2 k + 1 + k 2 3 k 2 2 p 2 k + O ( p 2 k 1 ) .
(5)
If χ is any non-real character modp, then note that the identities
c = 1 p 1 χ ¯ 2 ( m c ) e ( 2 m c p ) τ 2 ( χ ¯ ) = χ 2 ( 2 ) τ ( χ ¯ 2 ) τ 2 ( χ ¯ ) = O ( 1 p ) , c = 1 p 1 χ 2 ( m c ) e ( 2 m c p ) τ 2 ( χ ¯ ) ¯ = χ ¯ 2 ( 2 ) τ ( χ 2 ) τ 2 ( χ ¯ ) ¯ = O ( 1 p ) , c = 1 p 1 χ ¯ ( m c ) e ( m c p ) τ ( χ ¯ ) χ ( m c ) e ( m c p ) τ ( χ ¯ ) ¯ = p 1 p ,
and
c = 1 p 1 ( χ ¯ ( m c ) e ( m c p ) τ ( χ ¯ ) + χ ( m c ) e ( m c p ) τ ( χ ¯ ) ¯ ) 3 = O ( 1 p 3 2 c = 1 p 1 1 ) = O ( 1 p ) .
From (4) we may immediately get the asymptotic formula
c = 1 p 1 | a = 0 p 1 b = 0 p 1 χ ( a 2 b 2 + n a n b + c ) e ( m b 2 m a 2 p ) | 2 k = p 2 k + 1 + k 2 3 k 2 2 p 2 k + O ( p 2 k 1 2 ) .
(6)
Now combining (5) and (6) we have the asymptotic formula
c = 1 p 1 | a = 0 p 1 b = 0 p 1 χ ( a 2 b 2 + n a n b + c ) e ( m b 2 m a 2 p ) | 2 k = { p 2 k + 1 + k 2 3 k 2 2 p 2 k + O ( p 2 k 1 ) , if  χ  is the Legendre symbol  mod p ; p 2 k + 1 + k 2 3 k 2 2 p 2 k + O ( p 2 k 1 2 ) , if  χ  is a complex character  mod p .

This completes the proof of our theorems.

Declarations

Acknowledgements

The authors would like to thank the referees for their very helpful and detailed comments, which have significantly improved the presentation of this paper. This work is supported by the P.S.F. (2013JZ001) and N.S.F. (11371291) of P.R. China.

Authors’ Affiliations

(1)
College of Teacher’s Education, Honghe University
(2)
Department of Mathematics, Northwest University

References

  1. Apostol TM: Introduction to Analytic Number Theory. Springer, New York; 1976.MATHGoogle Scholar
  2. Chengdong P, Chengbiao P: Goldbach Conjecture. Science Press, Beijing; 1992.MATHGoogle Scholar
  3. Ireland K, Rosen M: A Classical Introduction to Modern Number Theory. Springer, New York; 1982:204-207.View ArticleMATHGoogle Scholar
  4. Weil A: On some exponential sums. Proc. Natl. Acad. Sci. USA 1948, 34: 204-207. 10.1073/pnas.34.5.204MathSciNetView ArticleMATHGoogle Scholar
  5. Wenpeng Z: On the fourth power mean of the general Kloosterman sums. Indian J. Pure Appl. Math. 2004, 35: 237-242.MathSciNetMATHGoogle Scholar
  6. Cochrane T, Pinner C: A further refinement of Mordell’s bound on exponential sums. Acta Arith. 2005, 116: 35-41. 10.4064/aa116-1-4MathSciNetView ArticleMATHGoogle Scholar
  7. Evans JW, Gragg WB, LeVeque RJ: On least squares exponential sum approximation with positive coefficients. Math. Comput. 1980,34(149):203-211. 10.1090/S0025-5718-1980-0551298-6MathSciNetView ArticleMATHGoogle Scholar
  8. Williams KS:Exponential sums over GF ( 2 n ) . Pac. J. Math. 1972, 40: 511-519. 10.2140/pjm.1972.40.511View ArticleMathSciNetMATHGoogle Scholar

Copyright

© Xiancun and Xiaoxue; licensee Springer. 2014

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly credited.