In two previous papers [Proc. Amer. Math. Soc. 117 (1993), 877-884], [J. Numher Theory 44 (1993), 214-221], a reciprocity relation for the power residue symbol of odd prime exponent, between Jacobi sums, was conjectured then proved. This is here extended to the case of an arbitrary exponent, as a co
Averages of Real Character Sums
โ Scribed by M.V. Armon
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 150 KB
- Volume
- 77
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
โฆ Synopsis
Two mean-value estimates are proved for sums of real characters /(n) defined by Kronecker's symbol (Dรn), where D ranges over Q, the set of quadratic discriminants.
1999 Academic Press
1. INTRODUCTION AND STATEMENT OF RESULTS
Every real nonprincipal character / D (n) can be represented by the Kronecker symbol (Dรn) for n>0, where D is taken from the set Q of quadratic discriminants:
Each D # Q is uniquely expressible as dm 2 , where d # F, the set of fundamental discriminants,
so that / D is induced by the primitive character / d , where / d (n)=(dรn) for n>0. For fixed positive n, the values of (Dรn) coincide with the values of / n (D), where / n is a real character modulo n or 4n. Since / n (D) is defined for all D, this observation will allow us to sum (Dรn) over all D for a fixed n>0. Details and further information on the Kronecker symbol can be found in [3 5, 7, 10].
The first theorem is an extension to Kronecker symbols of a theorem of Montgomery and Vaughan [9] that bounds an average of sums of Legendre symbols. Its proof requires a few modifications of Montgomery and Vaughan's proof and is simplified somewhat by a result of .
๐ SIMILAR VOLUMES
Let f be a complex-valued function on a finite field F such that f(0)=0, f(1)=1, and |f(x)|=1 for x ] 0. H. Cohn asked if it follows that f is a nontrivial multiplicative character provided that ; x ยฅ F f(x) f(x+h)=-1 for h ] 0. We prove that this is the case for finite fields of prime cardinality u
Cohn's problem on character sums (see , p. 202) asks whether a multiplicative character on a finite field can be characterized by a kind of two level autocorrelation property. Let f be a map from a finite field F to the complex plane such that f (0)=0, f (1)=1, and | f (:)| =1 for all :{0. In this p
We evaluate the real character sum m n (mรn) where the two sums are of approximately the same length. The answer is surprising.