Abstract
In this article, our main purpose is to introduce a new and generalized quadratic Gauss sum. By using analytic methods, the properties of classical Gauss sums, and character sums, we consider the calculating problem of its fourth power mean and give two interesting computational formulae for it.
Keywords:
the generalized quadratic Gauss sums; the fourth power mean; analytic method; computational formula MSC:
11L05; 11L40
1. Introduction
For any integer , let denote any Dirichlet character . Then the classical Gauss sum is defined as follows:
where m is any integer and .
If or is a primitive character , then it is easy to prove the identity , and is called the classical Gauss sum. Usually, we denote as .
The generalized quadratic Gauss is defined as
These sums have an important status in the research of analytic number theory. Many famous number theory problems are closely related to them. Therefore, these Gauss sums have been studied by many scholars, and they also have a series of interesting conclusions. For example, Zhang Wenpeng and Hu Jiayuan [] proved that for any prime p with and any third-order character , one has the equation
where d is uniquely determined by and .
Chen Li [] proved that for any prime p with and any sixth-order character , one gets the identity
where , d is the same as in the above.
Recently, the classical Gauss sum is also researched by Wang Tingting and Chen Guohui []. They proved that
satisfying the second-order linear recurrence Formula
where , , p is a prime with , be any twelfth-order character , and d is the same as before.
From the properties of the second-order linear recurrence sequence, we may easily calculate the general terms for any positive integer k. That is,
where .
For any odd prime p and any integer n with , Zhang Wenpeng [] obtained the identities
and
Many other papers related to classical Gauss sums, generalized quadratic Gauss sums, and character sums can also be found in references [,,,,,,,,,,,,,], we do not enumerate them one by one here.
In this paper, we introduce a generalized quadratic Gauss sum as follows:
where k is any positive integer and , .
In fact, if we take , then (2) becomes (1) with . So (2) is also a generalized quadratic Gauss sum, and (1) is a special case of (2). Therefore, is a further promotion and extension of .
We will consider the -th power mean of (2) in this paper. i.e.,
If is an odd prime and , then we will use the analytic method and the properties of classical Gauss sums to give an exact computational formula for (3). That is, we shall prove the following results:
Theorem 1.
Let p be a prime with . Then for any character , we have the identity
where denotes the principal character , and .
Theorem 2.
Let p be a prime with . Then for any character , we have the identity
and
where satisfies the estimate .
Theorem 3.
Let p be an odd prime, ψ be a fixed non-principal character . Then for any character , we have the upper bound estimate
From Theorem 1 and Theorem 2 we may immediately deduce the following:
Corollary 1.
Let p be an odd prime. Then for any odd character , we have the identity
Corollary 2.
Let p be an odd prime. Then for any non-principal character , we have the asymptotic formula
where satisfies the estimate .
Some notes:
If is a non-principal even character , then we cannot get the exact value of the sum
So, in this case, we can only get a sharp asymptotic formula for mean value (3).
It is clear that if is an odd prime and , maybe we can also give an accurate calculating formula for mean value (3). However, in this case, various discussions are required based on the different characters with , and the situation is more complicated, so we do not discuss it further here.
If and or , then from the result in [] and the method of proving Theorem 1 we can also give an accurate calculating formula for (3) with and .
For general integer q, does there exist a calculating formula similar to our theorems? These are open problems, which need to be further studied.
2. Several Simple Lemmas
To prove our theorems, we need two simple lemmas. In the process of proving our lemmas, we need to use some basic properties of classical Gaussian sums and character sums, all of which can be found in references [,,], so there is no need to repeat them here.
Lemma 1.
Let p be a prime. For any character with , if , then we have the identity
If , then we have the identity
where denotes the principal character .
Proof.
First, if , then we have . In fact, if , then from the definition of we have
which implies the identity .
On the other hand, for any integer k with , from the properties of the Legendre’s symbol (see Theorem 7.5.4 in []) we have
where denotes the Legendre’s symbol .
Now if , then we have
If and , then applying the properties of the reduced residue system and (4) we have
If and , then we have
Please note that the identity
Combining (7), (8) and we have
For any even character with , we have
Please note that if , then , and if , then . So, from (5), (6), (9) and (10) we may deduce Lemma 1 immediately. □
Lemma 2.
Let p be a prime. Then for any Dirichlet character , we have the identity
Proof.
It is clear that if , then we have
If and , then from (4) and the properties of the reduced residue system p we have
If and , then from (11) and the orthogonality of the characters we have
If and , then note that the identity
from the method of proving (12) we have
If and , then from (11) and the method of proving (12) we also have the identity
Similarly, if and , then from (11) and the method of proving (13) we have the identity
Now Lemma 2 follows from (12), (13), (14) and (15). □
3. Proofs of the Theorems
In this section, we shall complete the proofs of our theorems. First we prove Theorem 1. If , let be any character , if , then from Lemma 1 and Lemma 2 we have
If , then from Lemma 1 and Lemma 2 we have
Please note that if , then we have
If and , then we have the estimate
Combining (16)–(19) we may immediately deduce Theorem 1.
Similarly, we can use the method of proving Theorem 1 to prove Theorem 2. If and , then from Lemma 1 and Lemma 2 we have
or
If and , then form Lemma 1 and Lemma 2 we have
Combining (18)–(21) we complete the proof of Theorem 2.
For any characters and with , applying (19) and Lemma 1 we may immediately deduce the upper bound estimate
This completes the proof of Theorem 3.
4. Conclusions
The main results of this paper are Theorem 1, Theorem 2, and Corollary 1. They obtain some exact expressions for the fourth power mean (3) with and , an odd prime. For Corollary 1 in particular, the result is very simple and beautiful. These works have good references for further research on generalized multivariate quadratic Gauss sums. In addition, these theorems also profoundly reveal the regularity of the value distribution of this kind of new Gauss sum. In other words, its value is mainly concentrated on , where is the principal character .
For the general integer (or and ), we also proposed two open problems. These will contribute to the further study of these contents.
Author Contributions
All authors have equally contributed to this work. All authors read and approved the final manuscript.
Funding
This work is supported by the N. S. F. (11771351) and (11826205) of P. R. China.
Acknowledgments
The authors would like to thank the Editor and referees for their very helpful and detailed comments, which have significantly improved the presentation of this paper.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Zhang, W.P.; Hu, J.Y. The number of solutions of the diagonal cubic congruence equation modp. Math. Rep. 2018, 20, 73–80. [Google Scholar]
- Chen, L. On the classical Gauss sums and their some properties. Symmetry 2018, 10, 625. [Google Scholar] [CrossRef]
- Wang, T.T.; Chen, G.H. A note on the classical Gauss sums. Mathematics 2018, 6, 313. [Google Scholar] [CrossRef]
- Zhang, W.P. Moments of Generalized Quadratic Gauss Sums Weighted by L-functions. J. Number Theory 2002, 92, 304–314. [Google Scholar]
- Chen, Z.Y.; Zhang, W.P. On the fourth-order linear recurrence formula related to classical Gauss sums. Open Math. 2017, 15, 1251–1255. [Google Scholar]
- Berndt, B.C.; Evans, R.J. The determination of Gauss sums. Bull. Am. Math. Soc. 1981, 5, 107–128. [Google Scholar] [CrossRef]
- Bai, H.; Hu, J.Y. On the classical Gauss sum and the recursive properties. Adv. Differ. Equ. 2018, 2018, 387. [Google Scholar] [CrossRef]
- Shen, S.M.; Zhang, W.P. On the quartic Gauss sums and their recurrence property. Adv. Differ. Equ. 2017, 2017, 43. [Google Scholar] [CrossRef]
- Chen, L.; Hu, J.Y. A linear Recurrence Formula Involving Cubic Gauss Sums and Kloosterman Sums. Acta Math. Sin. 2018, 61, 67–72. [Google Scholar]
- Chowla, S.; Cowles, J.; Cowles, M. On the number of zeros of diagonal cubic forms. J. Number Theory 1977, 9, 502–506. [Google Scholar] [CrossRef]
- Berndt, B.C.; Evans, R.J. Sums of Gauss, Jacobi, and Jacobsthal. J. Number Theory 1979, 11, 349–389. [Google Scholar] [CrossRef]
- Zhang, W.P.; Yi, Y. On Dirichlet characters of polynomials. Bull. London Math. Soc. 2002, 34, 469–473. [Google Scholar]
- Zhang, W.P.; Yao, W.L. A note on the Dirichlet characters of polynomials. Acta Arith. 2004, 115, 225–229. [Google Scholar] [CrossRef]
- Zhang, H.; Zhang, W.P. The fourth power mean of two-term exponential sums and its application. Math. Rep. 2017, 19, 75–83. [Google Scholar]
- Bourgain, J.; Garaev, M.Z.; Konyagin, S.V.; Shparlinski, I.E. On the hidden shifted power problem. SIAM J. Comput. 2012, 41, 1524–1557. [Google Scholar] [CrossRef]
- Zhang, W.P.; Liu, H.N. On the general Gauss sums and their fourth power mean. Osaka J. Math. 2005, 42, 189–199. [Google Scholar]
- Weil, A. On some exponential sums. Proc. Natl. Acad. Sci. USA 1948, 34, 204–207. [Google Scholar] [CrossRef]
- Hua, L.K. Introduction to Number Theory; Science Press: Beijing, China, 1979. [Google Scholar]
- Apostol, T.M. Introduction to Analytic Number Theory; Springer: New York, NY, USA, 1976. [Google Scholar]
© 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).