BURGESS INEQUALITY IN F p 2. Mei-Chu Chang
|
|
- Calvin Wiggins
- 5 years ago
- Views:
Transcription
1 BURGESS INEQUALITY IN F p 2 Mei-Chu Chang Abstract. Let be a nontrivial multiplicative character of F p 2. We obtain the following results.. Given ε > 0, there is δ > 0 such that if ω F p 2\F p and I, J are intervals of size p /4+ε, p sufficiently large, then X x I y J x + ωy < p δ I J. The statement is uniform in ω. 2. Given ε > 0, there is δ > 0 such that if x 2 +axy+by 2 is not a perfect square mod p, and if I, J [, p ] are intervals of size then for p sufficiently large, we have X x I,y J I, J > p 4 +ε, 0.9 x 2 + axy + by 2 < p δ I J, where δ = δε > 0 does not depend on the binary form. 0. Introduction. The paper contributes to two problems on incomplete character sums that go back to the work of Burgess and Davenport-Lewis in the sixties. Incomplete character sums are a challenge in analytic number theory. By incomplete, we mean that the summation is only over an interval I. Typical applications include the problem of the smallest Typeset by AMS-TEX
2 quadratic non-residue mod p and the distribution of primitive elements in a finite field. Recall that Burgess bound [B] on multiplicative character sums x I x in a prime field F p provides a nontrivial estimate for an interval I [, p ] of size I > p /4+ε, with any given ε > 0. Burgess result, which supercedes the Polya- Vinogradov inequality, was a major breakthrough and remains unsurpassed. It is conjectured that such result should hold as soon as I > p ε. The aim of this paper is to obtain the full generalization of Burgess theorem in F p 2. Thus Theorem 5. Given ε > 0, there is δ > 0 such that if ω F p 2\F p and I, J are intervals of size p /4+ε, p sufficiently large, then x + ωy < p δ I J 0. x I y J for a nontrivial multiplicative character. The importance of the statement is its uniformity in ω. Both Burgess [B2] and Karacuba [K] obtained the above statement under the assumption that ω satisfies a given quadratic equation ω 2 + aω + b = 0 mod p 0.2 with a, b Q. In the generality of Theorem 5, the best known result in F p 2 was due to Davenport and Lewis [DL], under the assumption I, J > p /3+ε. More generally, they consider character sums in F p n of the form x I,...,x n I n x ω + + x n ω n, 0.3 where I,..., I n [, p ] are intervals. It is shown in [DL] that provided for some ε > 0, x I,...,x n I n x ω + + x n ω n < p δε I I n 0.4 I i > p ρ+ε with ρ = ρ n = 2 n 2n
3 In [C2], newly developed sum-product techniques in finite fields were used to establish 0.4 under the hypothesis I i > p 2 5 +ε for some ε > Hence [C2] improves upon 0.5 provided n 5 and Theorem 5 in this paper provides the optimal result for n = 2. We will briefly recall Burgess method in the next section. It involves several steps. As in [C2], the novelty in our strategy pertains primarily to new bounds on multiplicative energy in finite fields see Section for definition. The other aspects of Burgess technique remain unchanged. We also did not try to optimize the inequality qualitatively, as our concern here was only to obtain a nontrivial estimate under the weakest assumption possible. The new estimates on multiplicative energy are given in Lemma 2 and Lemma 3 in Section. Contrary to the arguments in [C2] that depend on abstract sum-product theory in finite fields, the input in this paper is more classical. Lemma 2 is based on uniform estimates for the divisor function of an extension of Q of bounded degree. In Lemma 3, we use multiplicative characters to bound the energy EA, I = { x, x 2, t, t 2 A 2 I 2 : x t x 2 t 2 mod p }, 0.7 where A F p n is an arbitrary set and I [, p ] an interval. The underlying principle is actually related to Plunnecke-Ruzsa sum-set theory [TV] here in its multiplicative version, but in this particular case may be captured in a more classical way. Closely related to Theorem 5 is the problem of estimating character sums of binary quadratic forms over F p. x 2 + axy + by 2, 0.8 x I,y J where x 2 +axy +by 2 F p [x, y] is not a perfect square and a nontrivial multiplicative character of F p. Theorem. Given ε > 0, there is δ > 0 such that if x 2 + axy + by 2 is not a perfect square mod p, and if I, J [, p ] are intervals of size I, J > p 4 +ε, 0.9 then for p sufficiently large, we have x 2 + axy + by 2 < p δ I J, 0.0 x I,y J 3
4 where δ = δε > 0 does not depend on the binary form. This is an improvement upon Burgess result [B3], requiring the assumption I, J > p /3+ε. We will not discuss in this paper the various classical application of Theorem to primitive roots, quadratic residues, etc as the argument involved are not different from the ones in the literature.. Preliminaries and Notations. In what follows we will consider multiplications in R = F p d and R = F p F p. Denote by R the group of invertible elements of R. Let A, B be subsets of R. Denote. AB := {ab : a A and b B}. 2. ab := {a}b. Intervals are intervals of integers. 3. [a, b] := {n Z : a n b} 4. The multiplicative energy of A,..., A n R is defined as EA,..., A n := {a,..., a n, a,..., a n : a a n = a a n} with the understanding that all factors a i, a i are in A i R. Using multiplicative characters of R, one has 5. EA,..., A n = n R i= ξ i A i ξ i 2. Energy is always multiplicative energy in this paper. 6. Burgess Method. In this paper we will apply Burgess method several times. We outline the recipe here, considering intervals in F p 2. For details, see Section 2 of [C2]. Suppose we want to bound x I,y J x + ωy,. where I, J are intervals. We translate x, y by tu, tv T M, where M = I J is a box in F p 2, and T = [, T ] such that T I < p ε I and T J < p ε J for some small ε > 0. Therefore, it suffices to estimate the following sum T M t T u,v M x + tu + y + tvω..2 x I y J 4
5 Let wµ = {x, y, u, v I J M : µ = x+ωy u+ωv }. Then the double sum in.2 is bounded by µ F p 2 wµ t T t + µ µ F p 2. wµ } {{ } α µ F p 2. µ + t t T } {{ } β.3 where k is a large integer to be chosen. By Hölder s inequality and the definition of wµ, α [ wµ ] k [ wµ 2 ] = I J I J k E I + ωj, I + ωj. A key idea in Burgess approach is then to estimate.3 using Weil s theorem for multiplicative characters in F p n here n = 2, leading to the bound. β k T 2 p n + 2T p n 4k., So the remaining problem to bound the character sum. is reduced to the bounding of multiplicative energy E I + ωj, I + ωj. We will describe a new strategy. 2. Multiplicative energy of two intervals in F p 2. The first step in estimating the multiplicative energy is the following Lemma. Let ω F p 2\F p and Q = { [ x + ωy : x, y, 0 p/4]}. Then max {z, z 2 Q Q : ξ = z.z 2 } < exp c ξ F p 2. An essential point here is that the bound is uniform in ω. Also, the specific size of Q is important. Note that for our purpose, any estimate of the type p o would do as well. Proof. 5
6 For given ξ F p 2, assume that ξ can be factored as products of two elements in Q in at least two ways. We consider the set S of polynomials in Z[X] y y 2 y y 2X 2 + x y 2 + x 2 y x y 2 x 2y X + x x 2 x x 2, 2. where x i + ωy i, x i + ωy i Q for i =, 2, and in F p 2. x + ωy x 2 + ωy 2 = ξ = x + ωy x 2 + ωy Let gx = X 2 + ax + b F p [X] be the minimal polynomial of ω. Then it is clear that every fx in S, when considered as a polynomial in F p [X], is a scalar multiple of gx. Next, observe that, by definition of Q, the coefficients of 2. are integers bounded by 25 p 2. Therefore, since the coefficients of two non-zero polynomials 2. are proportional in F p, they are also proportional in Q. Thus the polynomials 2. are multiples of each other in Q[X] and therefore have a common root ω C. Since x + ωy x 2 + ωy 2 = x + ωy x 2 + ωy in Q ω whenever 2.2 holds, it suffices to show that if we fix some ξ Q ω, then {z, z 2 Q Q : ξ = z z 2 } < exp c, 2.4 where Q = { [ x + ωy : x, y, 0 p/4]}. This is easily derived from a divisor estimate. Let ux 2 + vx + w be a nonzero polynomial in S, then u ω 2 + v ω + w = 0. Note that η = u ω is an algebraic integer, since it satisfies Thus η 2 + vη + uw = 0. u 2 ξ = ux + ηy ux 2 + ηy 2 is a factorization of u 2 ξ in the integers of Qη. Since the height of these integers is obviously bounded by p, 2.4 is implied by the usual divisor bound in a quadratic number field which is uniform for extensions of given degree. This proves Lemma. As an immediate consequence of Lemma, we have the following. 6
7 Lemma 2. Let Q be as in Lemma. Then the multiplicative energy EQ, Q satisfies EQ, Q < exp c Q and Lemma 2. Let Q be as in Lemma and z, z 2 F p 2. Then Ez + Q, z 2 + Q < exp c Q Proof of Lemma 2. We have Ez + Q, z 2 + Q Q 2 + EQ + Q, z 2 + Q and by Cauchy-Schwarz. See [TV] Corollary 2.0. EQ + Q, z + Q EQ + Q, Q + Q 2 Ez + Q, z + Q 2. Hence 2.6 follows from Further amplification. The second ingredient is provided by Lemma 3. Let Q be as in Lemma, and let I = [, p /k ], where k Z +. z, z 2 F p 2. Then EI, z + Q, z 2 + Q < exp c Let p Proof. Denote the multiplicative characters of F p 2. Thus EI, z + Q, z 2 + Q = p 2 t 2 ξ + z 2 t I ξ Q }{{}}{{} A 2 B 2 7 ξ + z 2 ξ Q 2 } {{ } C
8 Here the sum over ξ Q is such that ξ + z i 0, for i =, 2. Hence by Hölder s inequality, = EI, z + Q, z 2 + Q { p 2 [ A 2 BC 2 k ] k } k { p 2 { p 2 A B 2 C 2} k } {{ } 3.3 { p 2 [ ] BC 2 2 k } k k k B 2 C 2} k. Since the second factor is equal to Ez +Q, z 2 +Q k, 2.6 applies and we obtain the bound 3.3 exp c Q 2 k. 3.4 Estimate 3.3 as 3.3 Q 2 k < exp c { p 2 t ξ + z 2} k t I ξ Q { p 2. Q 2 k t 2 ξ + z 2} k t Fp ξ Q = exp c Q 2 k EFp, Q + z k. 3.5 The second inequality is by definition of I and the divisor bound. Next, let z = a+ωb, with a, b F p and let Q = J + ωj, with J = [, p /4 ]. Then EF p, Q + z = {t, t 2, ξ, ξ 2 F 2 p Q 2 : t ξ + z = t 2 ξ 2 + z 0} = {t, t 2, x, x 2, y, y 2 F 2 p J 4 : t x + a + ωy + b = t 2 x2 + a + ωy 2 + b 0}. 3.6 Equating coefficients in 3.6, we have { t x + a = t 2 x 2 + a t y + b = t 2 y 2 + b. 8
9 Therefore, x + a y + b = x 2 + a y 2 + b. and the number of x, x 2, y, y 2 satisfying 3.6 is bounded by Ea + J, b + J, which is bounded by p /2, by [FI]. Hence, By 3.5 and 3.4, and EF p, Q + z p 3/ exp c Q 2 k p 3, EI, z + Q, z 2 + Q exp c Q 2 p 3. This proves Lemma 3. Lemma 4. Let I j = [a j, b j ], where b j a j p 4 for j =,..., 4. Denote Let I = [, p k ] with k Z +. Then R = I + ωi 2, and S = I 3 + ωi 4. EI, R, S < exp c p 3 R 2 S Proof. Subdivide R and S in translates of Q and apply Lemma 3. Thus the left side of 3. needs to be multiplied with R 2 S 2 Q Q which gives Proof of Theorem 5. We now establish the analogue of Burgess for progressions in F p 2. Theorem 5. Given ρ > 4, there is δ > 0 such that if ω F p 2\F p and I, J are intervals of size p ρ, then x + ωy < p δ I J 4. x I y J 9
10 for a nontrivial multiplicative character. This estimate is uniform in ω. Proof. Denote I 0 = [, p 4 ] and K = [, p κ ], where κ is the reciprocal of a positive integer and ρ > + 2κ We translate I+ωJ by KKI 0 +ωi 0 and estimate following the procedure sketched in = K 2 I 0 2 K 2 I 0 2 x,y I 0 s K x I,y J x I,y J x,y I 0 s K t K x + ωy + stx + ωy t + t K x + ωy. 4.3 sx + ωy With the notations from, we have α I 0 2 K I J k E K, I 0 + ωi 0, I + ωj exp c = exp I 0 2 K I J 3 k K 2 I 0 4 I 2 J 2 p c I 0 2 I J K 4k p, by Lemma 4, and β K 2 p k + K p. Hence, taking κ = k, 4.3 is bounded by I J p 4k 2 with any δ < 4k taking p large enough. 2 and the theorem is proved Remark 5.. In [DL], the result 4. was obtained under the assumption that ρ > 3. In general, it was shown in [DL] that if ω,..., ω d is a basis in F p d then x ω + + x d ω d < p δ I I d, 4.6 x i I i 0
11 provided I,..., I d are intervals in F p of size at least p ρ with d ρ > 2d For d 5, there is a better uniform result in [C2], namely ρ > ε. 4.8 As a consequence of Theorem 5, we have Corollary 6. Assume k F p is not a quadratic residue. Then x 2 + ky 2 < p δ I J 4.9 x I y J for nontrivial and I, J intervals of size at least p 4 +ε. Here δ = δε > 0 is uniform in k. Proof. Let ω = k. Since x 2 + ky 2 is irreducible modulo p, x 2 + ky 2 is a character mod p of x + ωy in the quadratic extension Qω. 5. Extension to F p d There is the following generalization of Lemma. Lemma 7. Let ω F p d be a generator over F p. Given 0 < σ < 2 and let { Q = x 0 + x ω + + x d ω d : x i [, p σ]} { [ Q = y 0 + y ω : y i, p σ]} 2. Then Proof. max {z, z Q Q : ξ = zz } < exp ξ F p d The proof is similar to that of Lemma. It uses the fact that if c d. 5. x 0 + x ω + + x d ω d y 0 + y ω = ξ = x x d ω d y 0 + y ω then the polynomial x 0 + x X + + x d X d y 0 + y X x 0 + x X + + x d X d y 0 + y X is irreducible in F p [X], or vanishes. Hence the analogues of Lemmas 2, 2 hold. Thus
12 Lemma 8. Let Q, Q be as in Lemma 7 and let z F p d. Then Ez + Q, Q < exp c d Q Q + Q We need the analogue of Lemma 3, but in a slightly more general setting. Lemma 9. Let Q, Q be as in Lemma 7 with Q Q and let I s = [, p ks ] for s =,..., r, with k s Z + and k + + k r <. Then EI,..., I r, z + Q, Q < exp c d = exp c d p +d 2σ+2 σp r s= ks Q Q s I s 2 σ. 5.3 Proof. The left of 5.3 equals p d r s= t 2 t Is ξ Q which we estimate by Hölder s inequality as r { p d s 2 t I s s= ξ Q ξ Q 2 } ks }{{} A ks s z + ξ 2 ξ ξ Q Here we denote t I s = t I s t, ξ Q = ξ Q By Lemma 8 B = Ez + Q, Q < exp c 2 { p d 2 ξ Q It is clear from the definition of multiplicative energy that A s Q 2 EI s,..., I }{{} s, z + Q k s Q 2 exp c ks EF p, z + Q. 2 ξ Q 2 } P ks } P {{} B k s 5.4 z + ξ etc. Q Q. 5.5.
13 To bound EF p, z + Q, we write z = a 0 + a ω + + a d ω d. Hence d EF p, z + Q = Θ i, 5.6 where i=0 { Θ 0 = t, t, x 0,..., x d, x 0,..., x d F 2 p [, p σ ] 2d : t + x + a ω + + x d + a d ω d 5.7 x 0 + a 0 x 0 + a 0 = t + x + a x 0 + a 0 and the other Θ i s are denoted similarly. Equating the coefficients of 5.7 and 5.8, we have t = t, ω + + x d + a d x 0 + a ω d } x i + a i = x i + a i x 0 + a 0 x 0 + a, for i =,..., d For i =, the number of solutions x 0, x 0, x, x in 5.9 is bounded by E[, p σ ] + a 0, [, p σ ] + a, which is bounded by p 2σ. The choices of t and x 2,..., x d is bounded by p p σd 2. Therefore, and EF p, z + Q dp +σd, A s Q 2 exp c ks p +σd. 5.0 Note that Q = p dσ and Q = p 2σ. Putting 5.4, 5.5 and 5.0 together, we have which is 5.3. EI,..., I r, z + Q, Q exp c d = exp c d = exp c d Q 2P ks p +σdp ks We now estimate a character sum over F p d. 3 Q Q P ks Q +P ks Q P ks p +σdp ks p +P ks 2σ+ P ks dσ++σdp ks,
14 Theorem 0. Let ω F p d be a generator over F p, and let J 0,..., J d be intervals of size at least p ρd+ε, where Denote Q = ρ d = d2 + 2d d { } x 0 + x ω + + x d ω d : x i J i, for i = 0,..., d Then q < p δ J 0 J d, 5.2 q Q where δ = δε > 0 is independent of ω. Proof. First we denote ρ d by ρ. Note that, by 5. 4 ρ Let Q 0 = { [ y 0 + y ω : y i, c d p ρ]} 2. Let further k,..., k r Z + satisfy 2ρ 2 2ε < k + + k r < 2ρ 2 ε, 5.4 where ε > 0 will be taken sufficiently small and r < rε. Let for s =,..., r. We then translate Q by I = [, p ε 2 ], and Is = [, p ks ] I r I s Q 0 s= and carry out Burgess argument as outlined in Section. The estimate of the left-hand side of 5.2 is q Q q p ε 2 +P ks + 2ρ αβ, 5.5 4
15 where α Q P k Q 0 p ks EQ, Q 0, I,..., I r Q P k Q 0 p ks exp c d Q Q 0 p 2 ρp ks, 5.6 and k Z + to be chosen. Claim. β k I 2 p d + 2 I p d 4k < p ε 4 + d + p ε 2 + d 4k, 5.7 Q Q 0 p 2 ρp ks < Q 2 Q 0 2 p 2P ks d 2 τ, for some τ > Proof of Claim. We will show dρ + 2ρ + 2 ρ k s < 2dρ + 2 2ρ + 2 k s d This is equivalent to dρ + 2ρ + 2ρ k s d 2 > 0. From 5.4, the choice of k,..., k r, and taking ε small enough, it suffices to show that namely, which is our assumption 5.. dρ + 2ρ + 2ρ2ρ 2 d 2 > 0, 4ρ 2 + d 3ρ d 2 2 Putting together, we have q q Q p ε 2 +P ks + 2ρ Q Q 0 p P ks = Q p ε 4 + d 2 τ + p τ. > 0, k Q 2 Q 0 2 p 2P ks d 2 τ p ε 4 + d 5 ε + p 2 + d 4k
16 Theorem 0 is proved, if we chose k > d/ε. Remark 0.. Returning to Remark., see 4.7, we note that ρ d < d 2d + with ρ 2 = 4, ρ 3 = 8, ρ 4 = 7 8, and ρ 5 = Character Sums of Binary Quadratic Forms. Following a similar approach, we show the following: Theorem. Given ε > 0, there is δ > 0 such that the following holds. Let p be a large prime and fx, y = x 2 + axy + by 2 which is not a perfect square mod p. Let I, J [, p ] be intervals of size Then x I,y J I, J > p 4 +ε. 6. fx, y < p δ I J 6.2 for a nontrivial multiplicative character mod p. This estimate is uniform in f. Result was shown by Burgess assuming I, J > p 3 +ε instead of 6.. Proof. There are two cases. Case. f is irreducible mod p. Then fx, y is a character mod p of x + ωy, with ω = 2 a + 2 a2 4b, in the quadratic extension Qω and the result then follows from Corollary 6 above. Case 2. fx, y is reducible in F p [x, y]. fx, y = x λ yx λ 2 y λ λ 2 mod p. We will estimate x I,y J x λ yx λ 2 y. The basis strategy is as in the F p 2-case cf. Theorem 5, but replacing F p 2 with coordinate-wise multiplication. 6 by F p F p
17 Let I 0 = [, 0 p 4 ] and K = [, p κ ], where κ = ε 4. We translate x, y by stx, sty with x, y I 0 and s, t K and estimate K 2 I 0 2 x I,y J x,y I 0 s K t K For z, z 2 F p F p, denote Hence t + x λ y t + sx λ y { ωz, z 2 = x, y, x, y, s I J I 0 I 0 K : 6.3 = K 2 I 0 2 z F p z 2 F p z = x λ 2y. 6.3 sx λ 2 y x λ y sx λ y, z 2 = x λ 2y sx λ 2 y }. ωz, z 2 t + z t + z 2, 6.4 t K which we estimate the usual way using Holder s inequality and Weil s theorem. The required property is a bound for some τ > 0 cf We may assume I, J < p. Let considered as subsets of F p F p. Hence 6.5 is equivalent to z,z 2 ωz, z 2 2 < I 2 J 2 K 2 p τ R = {x λ y, x λ 2 y : x I, y J} T = {x λ y, x λ 2 y : x, y I 0 } 6.5 S = {s, s : s K}, 6.6 ER, T, S < p τ I 2 J 2 K To establish 6.7, we prove the analogues of Lemmas -4. We first estimate ER, T. 7
18 Lemma 2. Let R and T be defined as in 6.6. Then ER, T < exp c R Writing R as a union of translates of T we have Thus it will suffice to show that R = α R T T + ξ α ER, T R 2 T 2 max ξ F p F p ET + ξ, T. max ET + ζ, T + ξ < exp c ζ,ξ F p F p T Using the same argument as in the proof of Lemma 2, it suffices to prove 6.9 for ζ = ξ = 0. Lemma 3. Let T be defined as in 6.6. Then ET, T < exp c T There is a stronger statement which is the analogue of Lemma. Lemma 4. Let T be defined as in 6.6. Then max ρ F p F p {z, z 2 T T : ρ = z z 2 } < exp c. 6. Proof. Writing z = x λ y, x λ 2 y, z 2 = x 2 λ y 2, x 2 λ 2 y 2 with x, x 2, y, y 2 I 0, we want to estimate the number of solutions in x, x 2, y, y 2 I 0 of { x λ y x 2 λ y 2 = ρ mod p x λ 2 y x 2 λ 2 y 2 = ρ 2 mod p 8 6.2
19 Let F be the set of quadruples x, x 2, y, y 2 I 4 0 such that 6.2 holds. If x, x 2, y, y 2, x, x 2, y, y 2 F, then λ, λ 2 are the distinct roots mod p of the polynomial y y y y 2X 2 + x y 2 + y x 2 x y 2 y x 2 X + x x 2 x x 2 = By the definition of I 0, the coefficients in 6.3 are integers bounded by 25 p 2. Since all non-vanishing polynomials 6.3 are proportional in F p [X], they are also proportional in Z[X]. Hence they have common roots λ, λ 2 and there are conjugate ρ, ρ 2 Q λ such that { x λ y x 2 λ y 2 = ρ x λ 2 y x 2 λ 2 y 2 = ρ for all x, x 2, y, y 2 F. As in Lemma, we use a divisor estimate in the integers of Q λ to show that there are at most exp c solutions of 6.4 in x λ y, x 2 λ y 2, x λ 2 y, x 2 λ 2 y 2. Since λ λ 2, these four elements of Q λ determine x, y, x 2, y 2. Therefore, F < exp c. This proves Lemma 4. Returning to 6.7, we proceed as in Lemma 3. Let κ = k Thus in the definition of K. ER, T, S = p 2 z 2 z 2 z 2 z S = 2 z R z 2 T [ p 2 z 2 2] k z S R T }{{} <6.5 k exp c 6.5 k 2 [ p 2 2 2] k R T }{{} ER,T k R 2 k 6.6 9
20 the last inequality is by Lemma 2, where 6.5 = p 2 z z 2 z 2 z S T 2 p 2 < exp z S z R z z c k T 2 p 2 z R 2 2 z 2 T 2 t 2 t 2 t F p x I y J x λ y 2 x λ 2 y = exp c T 2 ER,, 6.7 where = {t, t : t F p }. The multiplicative energy ER, in 6.7 equals the number of solutions in x, x, y, y, t, t I 2 J 2 F p 2 of 2 { tx λ y t x λ y mod p tx λ 2 y t x λ 2 y mod p 6.8 with the restriction that all factors are nonvanishing. Rewriting 6.8 as tx t x λ ty t y λ 2 ty t y mod p and since λ λ 2 mod p tx t x mod p ty = t y mod p. Hence xy x y mod p 6.9 and the number of solutions of 6.9 is bounded by since I, J < p. EI, J I J 6.20 Once x, x, y, y is specified, the number of solutions of 6.8 in t, t is at most p. 20
21 Hence 6.8 has at most p I J solutions and substitution in 6.7 gives the estimate 6.5 < exp c p R T Substituting of 6.2 in 6.6 gives ER, T S < exp c Recalling the definition of S, we have S = I 0 2 = p 2. p k R 2 2 k S k Also κ = k, and K = p k. Hence 6.22 = exp c p 2 2 k I J k = exp c K 2 I J 2 κ and 6.7 certainly holds. This proves Theorem Acknowledgement. The author would like to thank the referees for helpful comments. References [B]. D.A. Burgess, On character sums and primitive roots, Proc. London Math. Soc , [B2]., Character sums and primitive roots in finite fields, Proc. London Math. Soc , -35. [B3]., A note on character sums of binary quadratic forms, JLMS, , [C]. M.-C. Chang, Factorization in generalized arithmetic progressions and applications to the Erdos-Szemeredi sum-product problems, Geom. Funct. Anal. Vol , [C2]., On a question of Davenport and Lewis and new character sum bounds in finite fields, Duke Math. J.. [DL]. H. Davenport, D. Lewis, Character sums and primitive roots in finite fields, Rend. Circ. Matem. Palermo-Serie II-Tomo XII-Anno 963, [FI]. J. Friedlander, H. Iwaniec, Estimates for character sums, Proc. Amer. Math. Soc. 9, No 2, 993, [K]. A.A. Karacuba, Estimates of character sums, Math. USSR-Izvestija Vol , No., [TV]. T. Tao, V. Vu, Additive Combinatorics,, Cambridge University Press,
BURGESS INEQUALITY IN F p 2. Mei-Chu Chang. 0 Introduction
Geom. Funct. Anal. Vol. 9 2009 00 06 DOI 0.007/s00039-009-003-5 Published online November 2, 2009 2009 The Authors GAFA Geometric And Functional Analysis This article is published with open access at Springerlink.com
More informationOn Character Sums of Binary Quadratic Forms 1 2. Mei-Chu Chang 3. Abstract. We establish character sum bounds of the form.
On Character Sums of Binary Quadratic Forms 2 Mei-Chu Chang 3 Abstract. We establish character sum bounds of the form χ(x 2 + ky 2 ) < τ H 2, a x a+h b y b+h where χ is a nontrivial character (mod ), 4
More informationExpansions of quadratic maps in prime fields
Expansions of quadratic maps in prime fields Mei-Chu Chang Department of Mathematics University of California, Riverside mcc@math.ucr.edu Abstract Let f(x) = ax 2 +bx+c Z[x] be a quadratic polynomial with
More informationPRODUCT THEOREMS IN SL 2 AND SL 3
PRODUCT THEOREMS IN SL 2 AND SL 3 1 Mei-Chu Chang Abstract We study product theorems for matrix spaces. In particular, we prove the following theorems. Theorem 1. For all ε >, there is δ > such that if
More informationarxiv: v1 [math.nt] 4 Oct 2016
ON SOME MULTIPLE CHARACTER SUMS arxiv:1610.01061v1 [math.nt] 4 Oct 2016 ILYA D. SHKREDOV AND IGOR E. SHPARLINSKI Abstract. We improve a recent result of B. Hanson (2015) on multiplicative character sums
More informationShort character sums for composite moduli
Short character sums for composite moduli Mei-Chu Chang Department of Mathematics University of California, Riverside mcc@math.ucr.edu Abstract We establish new estimates on short character sums for arbitrary
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 informationOn the elliptic curve analogue of the sum-product problem
Finite Fields and Their Applications 14 (2008) 721 726 http://www.elsevier.com/locate/ffa On the elliptic curve analogue of the sum-product problem Igor Shparlinski Department of Computing, Macuarie University,
More informationArithmetic progressions in sumsets
ACTA ARITHMETICA LX.2 (1991) Arithmetic progressions in sumsets by Imre Z. Ruzsa* (Budapest) 1. Introduction. Let A, B [1, N] be sets of integers, A = B = cn. Bourgain [2] proved that A + B always contains
More informationARITHMETIC PROGRESSIONS IN CYCLES OF QUADRATIC POLYNOMIALS
ARITHMETIC PROGRESSIONS IN CYCLES OF QUADRATIC POLYNOMIALS TIMO ERKAMA It is an open question whether n-cycles of complex quadratic polynomials can be contained in the field Q(i) of complex rational numbers
More informationOn a multilinear character sum of Burgess
On a multilinear character sum of Burgess J. Bourgain IAS M. Chang UCR January 20, 2010 Abstract Let p be a sufficiently large prime and (L i ) 1 i n a nondegenerate system of linear forms in n variables
More informationDepartment of Mathematics University of California Riverside, CA
SOME PROBLEMS IN COMBINATORIAL NUMBER THEORY 1 Mei-Chu Chang Department of Mathematics University of California Riverside, CA 92521 mcc@math.ucr.edu dedicated to Mel Nathanson on his 60th birthday Abstract
More informationGROWTH IN GROUPS I: SUM-PRODUCT. 1. A first look at growth Throughout these notes A is a finite set in a ring R. For n Z + Define
GROWTH IN GROUPS I: SUM-PRODUCT NICK GILL 1. A first look at growth Throughout these notes A is a finite set in a ring R. For n Z + Define } A + {{ + A } = {a 1 + + a n a 1,..., a n A}; n A } {{ A} = {a
More informationChapter 8. P-adic numbers. 8.1 Absolute values
Chapter 8 P-adic numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics 58, Springer Verlag 1984, corrected 2nd printing 1996, Chap.
More informationCongruences involving product of intervals and sets with small multiplicative doubling modulo a prime
Congruences involving product of intervals and sets with small multiplicative doubling modulo a prime J. Cilleruelo and M. Z. Garaev Abstract We obtain a sharp upper bound estimate of the form Hp o(1)
More informationCONVOLUTION OF DISCRETE MEASURES ON LINEAR GROUPS
CONVOLUTION OF DISCRETE MEASURES ON LINEAR GROUPS 1 Mei-Chu Chang Abstract Let p, q R such that 1 < p < 2 and 2 p = 1 + 1 q. Define ( ) 1/p f p = max f(xy) p (*) x,g 1 y G 1 where G 1 is taken in some
More information= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2
8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose
More informationShort Kloosterman Sums for Polynomials over Finite Fields
Short Kloosterman Sums for Polynomials over Finite Fields William D Banks Department of Mathematics, University of Missouri Columbia, MO 65211 USA bbanks@mathmissouriedu Asma Harcharras Department of Mathematics,
More informationMATH 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 informationSolving a linear equation in a set of integers II
ACTA ARITHMETICA LXXII.4 (1995) Solving a linear equation in a set of integers II by Imre Z. Ruzsa (Budapest) 1. Introduction. We continue the study of linear equations started in Part I of this paper.
More informationExtension fields II. Sergei Silvestrov. Spring term 2011, Lecture 13
Extension fields II Sergei Silvestrov Spring term 2011, Lecture 13 Abstract Contents of the lecture. Algebraic extensions. Finite fields. Automorphisms of fields. The isomorphism extension theorem. Splitting
More informationPrime Divisors of Palindromes
Prime Divisors of Palindromes William D. Banks Department of Mathematics, University of Missouri Columbia, MO 6511 USA bbanks@math.missouri.edu Igor E. Shparlinski Department of Computing, Macquarie University
More informationDaniel M. Oberlin Department of Mathematics, Florida State University. January 2005
PACKING SPHERES AND FRACTAL STRICHARTZ ESTIMATES IN R d FOR d 3 Daniel M. Oberlin Department of Mathematics, Florida State University January 005 Fix a dimension d and for x R d and r > 0, let Sx, r) stand
More informationImmerse Metric Space Homework
Immerse Metric Space Homework (Exercises -2). In R n, define d(x, y) = x y +... + x n y n. Show that d is a metric that induces the usual topology. Sketch the basis elements when n = 2. Solution: Steps
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 informationElements of large order in prime finite fields
Elements of large order in prime finite fields Mei-Chu Chang Department of Mathematics University of California, Riverside mcc@math.ucr.edu Abstract Given f(x, y) Z[x, y] with no common components with
More informationPolynomials with nontrivial relations between their roots
ACTA ARITHMETICA LXXXII.3 (1997) Polynomials with nontrivial relations between their roots by John D. Dixon (Ottawa, Ont.) 1. Introduction. Consider an irreducible polynomial f(x) over a field K. We are
More informationMei-Chu Chang Department of Mathematics University of California Riverside, CA 92521
ERDŐS-SZEMERÉDI PROBLEM ON SUM SET AND PRODUCT SET Mei-Chu Chang Department of Mathematics University of California Riverside, CA 951 Summary. The basic theme of this paper is the fact that if A is a finite
More informationHomework 8 Solutions to Selected Problems
Homework 8 Solutions to Selected Problems June 7, 01 1 Chapter 17, Problem Let f(x D[x] and suppose f(x is reducible in D[x]. That is, there exist polynomials g(x and h(x in D[x] such that g(x and h(x
More informationON PERMUTATION POLYNOMIALS OF PRESCRIBED SHAPE
ON PERMUTATION POLYNOMIALS OF PRESCRIBED SHAPE AMIR AKBARY, DRAGOS GHIOCA, AND QIANG WANG Abstract. We count permutation polynomials of F q which are sums of m + 2 monomials of prescribed degrees. This
More informationAn Additive Characterization of Fibers of Characters on F p
An Additive Characterization of Fibers of Characters on F p Chris Monico Texas Tech University Lubbock, TX c.monico@ttu.edu Michele Elia Politecnico di Torino Torino, Italy elia@polito.it January 30, 2009
More informationSUM-PRODUCT ESTIMATES APPLIED TO WARING S PROBLEM MOD P
SUM-PRODUCT ESTIMATES APPLIED TO WARING S PROBLEM MOD P TODD COCHRANE AND CHRISTOPHER PINNER Abstract. Let γ(k, p) denote Waring s number (mod p) and δ(k, p) denote the ± Waring s number (mod p). We use
More informationFactorization in Integral Domains II
Factorization in Integral Domains II 1 Statement of the main theorem Throughout these notes, unless otherwise specified, R is a UFD with field of quotients F. The main examples will be R = Z, F = Q, and
More informationOn Systems of Diagonal Forms II
On Systems of Diagonal Forms II Michael P Knapp 1 Introduction In a recent paper [8], we considered the system F of homogeneous additive forms F 1 (x) = a 11 x k 1 1 + + a 1s x k 1 s F R (x) = a R1 x k
More informationMath 203A - Solution Set 1
Math 203A - Solution Set 1 Problem 1. Show that the Zariski topology on A 2 is not the product of the Zariski topologies on A 1 A 1. Answer: Clearly, the diagonal Z = {(x, y) : x y = 0} A 2 is closed in
More informationA COUNTEREXAMPLE TO AN ENDPOINT BILINEAR STRICHARTZ INEQUALITY TERENCE TAO. t L x (R R2 ) f L 2 x (R2 )
Electronic Journal of Differential Equations, Vol. 2006(2006), No. 5, pp. 6. ISSN: 072-669. URL: http://ejde.math.txstate.edu or http://ejde.math.unt.edu ftp ejde.math.txstate.edu (login: ftp) A COUNTEREXAMPLE
More informationMath 203A - Solution Set 1
Math 203A - Solution Set 1 Problem 1. Show that the Zariski topology on A 2 is not the product of the Zariski topologies on A 1 A 1. Answer: Clearly, the diagonal Z = {(x, y) : x y = 0} A 2 is closed in
More informationM ath. Res. Lett. 15 (2008), no. 2, c International Press 2008 SMOOTH HYPERSURFACE SECTIONS CONTAINING A GIVEN SUBSCHEME OVER A FINITE FIELD
M ath. Res. Lett. 15 2008), no. 2, 265 271 c International Press 2008 SMOOTH HYPERSURFACE SECTIONS CONTAINING A GIEN SUBSCHEME OER A FINITE FIELD Bjorn Poonen 1. Introduction Let F q be a finite field
More informationh-fold sums from a set with few products
h-fold sums from a set with few products Dedicated to the memory of György Elekes Ernie Croot Derrick Hart January 7, 2010 1 Introduction Before we state our main theorems, we begin with some notation:
More information(January 14, 2009) q n 1 q d 1. D = q n = q + d
(January 14, 2009) [10.1] Prove that a finite division ring D (a not-necessarily commutative ring with 1 in which any non-zero element has a multiplicative inverse) is commutative. (This is due to Wedderburn.)
More informationJ. Combin. Theory Ser. A 116(2009), no. 8, A NEW EXTENSION OF THE ERDŐS-HEILBRONN CONJECTURE
J. Combin. Theory Ser. A 116(2009), no. 8, 1374 1381. A NEW EXTENSION OF THE ERDŐS-HEILBRONN CONJECTURE Hao Pan and Zhi-Wei Sun Department of Mathematics, Naning University Naning 210093, People s Republic
More informationThe density of rational points on non-singular hypersurfaces, I
The density of rational points on non-singular hypersurfaces, I T.D. Browning 1 and D.R. Heath-Brown 2 1 School of Mathematics, Bristol University, Bristol BS8 1TW 2 Mathematical Institute,24 29 St. Giles,Oxford
More informationarxiv: v3 [math.co] 23 Jun 2008
BOUNDING MULTIPLICATIVE ENERGY BY THE SUMSET arxiv:0806.1040v3 [math.co] 23 Jun 2008 Abstract. We prove that the sumset or the productset of any finite set of real numbers, A, is at least A 4/3 ε, improving
More informationHigher-order Fourier analysis of F n p and the complexity of systems of linear forms
Higher-order Fourier analysis of F n p and the complexity of systems of linear forms Hamed Hatami School of Computer Science, McGill University, Montréal, Canada hatami@cs.mcgill.ca Shachar Lovett School
More informationBURGESS BOUND FOR CHARACTER SUMS. 1. Introduction Here we give a survey on the bounds for character sums of D. A. Burgess [1].
BURGESS BOUND FOR CHARACTER SUMS LIANGYI ZHAO 1. Introduction Here we give a survey on the bounds for character sums of D. A. Burgess [1]. We henceforth set (1.1) S χ (N) = χ(n), M
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 informationSMOOTH HYPERSURFACE SECTIONS CONTAINING A GIVEN SUBSCHEME OVER A FINITE FIELD
SMOOTH HYPERSURFACE SECTIONS CONTAINING A GIEN SUBSCHEME OER A FINITE FIELD BJORN POONEN 1. Introduction Let F q be a finite field of q = p a elements. Let X be a smooth quasi-projective subscheme of P
More informationGeneralized incidence theorems, homogeneous forms and sum-product estimates in finite fields arxiv: v2 [math.
Generalized incidence theorems, homogeneous forms and sum-product estimates in finite fields arxiv:0801.0728v2 [math.co] 31 Mar 2008 David Covert, Derrick Hart, Alex Iosevich, Doowon Koh, and Misha Rudnev
More informationPRACTICE PROBLEMS: SET 1
PRACTICE PROBLEMS: SET MATH 437/537: PROF. DRAGOS GHIOCA. Problems Problem. Let a, b N. Show that if gcd(a, b) = lcm[a, b], then a = b. Problem. Let n, k N with n. Prove that (n ) (n k ) if and only if
More informationStrongly nil -clean rings
J. Algebra Comb. Discrete Appl. 4(2) 155 164 Received: 12 June 2015 Accepted: 20 February 2016 Journal of Algebra Combinatorics Discrete Structures and Applications Strongly nil -clean rings Research Article
More informationComputing a Lower Bound for the Canonical Height on Elliptic Curves over Q
Computing a Lower Bound for the Canonical Height on Elliptic Curves over Q John Cremona 1 and Samir Siksek 2 1 School of Mathematical Sciences, University of Nottingham, University Park, Nottingham NG7
More informationNotes on the Bourgain-Katz-Tao theorem
Notes on the Bourgain-Katz-Tao theorem February 28, 2011 1 Introduction NOTE: these notes are taken (and expanded) from two different notes of Ben Green on sum-product inequalities. The basic Bourgain-Katz-Tao
More informationOn The Weights of Binary Irreducible Cyclic Codes
On The Weights of Binary Irreducible Cyclic Codes Yves Aubry and Philippe Langevin Université du Sud Toulon-Var, Laboratoire GRIM F-83270 La Garde, France, {langevin,yaubry}@univ-tln.fr, WWW home page:
More informationExponential and character sums with Mersenne numbers
Exponential and character sums with Mersenne numbers William D. Banks Dept. of Mathematics, University of Missouri Columbia, MO 652, USA bankswd@missouri.edu John B. Friedlander Dept. of Mathematics, University
More informationPerfect Power Riesel Numbers
Perfect Power Riesel Numbers Carrie Finch a, Lenny Jones b a Mathematics Department, Washington and Lee University, Lexington, VA 24450 b Department of Mathematics, Shippensburg University, Shippensburg,
More informationHow many units can a commutative ring have?
How many units can a commutative ring have? Sunil K. Chebolu and Keir Locridge Abstract. László Fuchs posed the following problem in 960, which remains open: classify the abelian groups occurring as the
More information#A34 INTEGERS 13 (2013) A NOTE ON THE MULTIPLICATIVE STRUCTURE OF AN ADDITIVELY SHIFTED PRODUCT SET AA + 1
#A34 INTEGERS 13 (2013) A NOTE ON THE MULTIPLICATIVE STRUCTURE OF AN ADDITIVELY SHIFTED PRODUCT SET AA + 1 Steven Senger Department of Mathematics, University of Delaware, Newark, Deleware senger@math.udel.edu
More informationPublic-key Cryptography: Theory and Practice
Public-key Cryptography Theory and Practice Department of Computer Science and Engineering Indian Institute of Technology Kharagpur Chapter 2: Mathematical Concepts Divisibility Congruence Quadratic Residues
More informationSCALE INVARIANT FOURIER RESTRICTION TO A HYPERBOLIC SURFACE
SCALE INVARIANT FOURIER RESTRICTION TO A HYPERBOLIC SURFACE BETSY STOVALL Abstract. This result sharpens the bilinear to linear deduction of Lee and Vargas for extension estimates on the hyperbolic paraboloid
More informationMath 120 HW 9 Solutions
Math 120 HW 9 Solutions June 8, 2018 Question 1 Write down a ring homomorphism (no proof required) f from R = Z[ 11] = {a + b 11 a, b Z} to S = Z/35Z. The main difficulty is to find an element x Z/35Z
More informationJean Bourgain Institute for Advanced Study Princeton, NJ 08540
Jean Bourgain Institute for Advanced Study Princeton, NJ 08540 1 ADDITIVE COMBINATORICS SUM-PRODUCT PHENOMENA Applications to: Exponential sums Expanders and spectral gaps Invariant measures Pseudo-randomness
More informationExplicit Bounds for the Burgess Inequality for Character Sums
Explicit Bounds for the Burgess Inequality for Character Sums INTEGERS, October 16, 2009 Dirichlet Characters Definition (Character) A character χ is a homomorphism from a finite abelian group G to C.
More informationARCS IN FINITE PROJECTIVE SPACES. Basic objects and definitions
ARCS IN FINITE PROJECTIVE SPACES SIMEON BALL Abstract. These notes are an outline of a course on arcs given at the Finite Geometry Summer School, University of Sussex, June 26-30, 2017. Let K denote an
More informationarxiv: v1 [math.ca] 15 Dec 2017
arxiv:705549v [mathca] 5 Dec 07 Finite field restriction estimates for the paraboloid in high even dimensions Alex Iosevich, Doowon Koh, and Mark Lewko Abstract We prove that the finite field Fourier extension
More informationFactorization of integer-valued polynomials with square-free denominator
accepted by Comm. Algebra (2013) Factorization of integer-valued polynomials with square-free denominator Giulio Peruginelli September 9, 2013 Dedicated to Marco Fontana on the occasion of his 65th birthday
More informationGaussian integers. 1 = a 2 + b 2 = c 2 + d 2.
Gaussian integers 1 Units in Z[i] An element x = a + bi Z[i], a, b Z is a unit if there exists y = c + di Z[i] such that xy = 1. This implies 1 = x 2 y 2 = (a 2 + b 2 )(c 2 + d 2 ) But a 2, b 2, c 2, d
More informationarxiv: v1 [math.co] 25 Oct 2018
AN IMPROVED BOUND FOR THE SIZE OF THE SET A/A+A OLIVER ROCHE-NEWTON arxiv:1810.10846v1 [math.co] 25 Oct 2018 Abstract. It is established that for any finite set of positive real numbers A, we have A/A+A
More information18. Cyclotomic polynomials II
18. Cyclotomic polynomials II 18.1 Cyclotomic polynomials over Z 18.2 Worked examples Now that we have Gauss lemma in hand we can look at cyclotomic polynomials again, not as polynomials with coefficients
More informationEquidivisible consecutive integers
& Equidivisible consecutive integers Ivo Düntsch Department of Computer Science Brock University St Catherines, Ontario, L2S 3A1, Canada duentsch@cosc.brocku.ca Roger B. Eggleton Department of Mathematics
More informationCullen Numbers in Binary Recurrent Sequences
Cullen Numbers in Binary Recurrent Sequences Florian Luca 1 and Pantelimon Stănică 2 1 IMATE-UNAM, Ap. Postal 61-3 (Xangari), CP 58 089 Morelia, Michoacán, Mexico; e-mail: fluca@matmor.unam.mx 2 Auburn
More informationA Remark on Sieving in Biased Coin Convolutions
A Remark on Sieving in Biased Coin Convolutions Mei-Chu Chang Department of Mathematics University of California, Riverside mcc@math.ucr.edu Abstract In this work, we establish a nontrivial level of distribution
More informationEGYPTIAN FRACTIONS WITH EACH DENOMINATOR HAVING THREE DISTINCT PRIME DIVISORS
#A5 INTEGERS 5 (205) EGYPTIAN FRACTIONS WITH EACH DENOMINATOR HAVING THREE DISTINCT PRIME DIVISORS Steve Butler Department of Mathematics, Iowa State University, Ames, Iowa butler@iastate.edu Paul Erdős
More informationChapter 1 Preliminaries
Chapter 1 Preliminaries 1.1 Conventions and Notations Throughout the book we use the following notations for standard sets of numbers: N the set {1, 2,...} of natural numbers Z the set of integers Q the
More informationA CONSTRUCTION FOR ABSOLUTE VALUES IN POLYNOMIAL RINGS. than define a second approximation V 0
A CONSTRUCTION FOR ABSOLUTE VALUES IN POLYNOMIAL RINGS by SAUNDERS MacLANE 1. Introduction. An absolute value of a ring is a function b which has some of the formal properties of the ordinary absolute
More informationSum-product estimates over arbitrary finite fields
Sum-product estimates over arbitrary finite fields Doowon Koh Sujin Lee Thang Pham Chun-Yen Shen Abstract arxiv:1805.08910v3 [math.nt] 16 Jul 2018 In this paper we prove some results on sum-product estimates
More informationMath 259: Introduction to Analytic Number Theory Exponential sums IV: The Davenport-Erdős and Burgess bounds on short character sums
Math 259: Introduction to Analytic Number Theory Exponential sums IV: The Davenport-Erdős and Burgess bounds on short character sums Finally, we consider upper bounds on exponential sum involving a character,
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
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 informationP -adic root separation for quadratic and cubic polynomials
P -adic root separation for quadratic and cubic polynomials Tomislav Pejković Abstract We study p-adic root separation for quadratic and cubic polynomials with integer coefficients. The quadratic and reducible
More informationSEMI-INVARIANTS AND WEIGHTS OF GROUP ALGEBRAS OF FINITE GROUPS. D. S. Passman P. Wauters University of Wisconsin-Madison Limburgs Universitair Centrum
SEMI-INVARIANTS AND WEIGHTS OF GROUP ALGEBRAS OF FINITE GROUPS D. S. Passman P. Wauters University of Wisconsin-Madison Limburgs Universitair Centrum Abstract. We study the semi-invariants and weights
More informationOn the power-free parts of consecutive integers
ACTA ARITHMETICA XC4 (1999) On the power-free parts of consecutive integers by B M M de Weger (Krimpen aan den IJssel) and C E van de Woestijne (Leiden) 1 Introduction and main results Considering the
More informationA combinatorial problem related to Mahler s measure
A combinatorial problem related to Mahler s measure W. Duke ABSTRACT. We give a generalization of a result of Myerson on the asymptotic behavior of norms of certain Gaussian periods. The proof exploits
More informationMATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION
MATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION 1. Polynomial rings (review) Definition 1. A polynomial f(x) with coefficients in a ring R is n f(x) = a i x i = a 0 + a 1 x + a 2 x 2 + + a n x n i=0
More informationAlgebraic Cryptography Exam 2 Review
Algebraic Cryptography Exam 2 Review You should be able to do the problems assigned as homework, as well as problems from Chapter 3 2 and 3. You should also be able to complete the following exercises:
More informationGroups, Rings, and Finite Fields. Andreas Klappenecker. September 12, 2002
Background on Groups, Rings, and Finite Fields Andreas Klappenecker September 12, 2002 A thorough understanding of the Agrawal, Kayal, and Saxena primality test requires some tools from algebra and elementary
More informationSUM-PRODUCT ESTIMATES APPLIED TO WARING S PROBLEM OVER FINITE FIELDS
#A68 INTEGERS 11 (011) SUM-PRODUCT ESTIMATES APPLIED TO WARING S PROBLEM OVER FINITE FIELDS Todd Cochrane 1 Department of Mathematics, Kansas State University, Manhattan, Kansas cochrane@math.ksu.edu James
More informationarxiv: v2 [math.nt] 9 Oct 2013
UNIFORM LOWER BOUND FOR THE LEAST COMMON MULTIPLE OF A POLYNOMIAL SEQUENCE arxiv:1308.6458v2 [math.nt] 9 Oct 2013 SHAOFANG HONG, YUANYUAN LUO, GUOYOU QIAN, AND CHUNLIN WANG Abstract. Let n be a positive
More informationON VALUES OF CYCLOTOMIC POLYNOMIALS. V
Math. J. Okayama Univ. 45 (2003), 29 36 ON VALUES OF CYCLOTOMIC POLYNOMIALS. V Dedicated to emeritus professor Kazuo Kishimoto on his seventieth birthday Kaoru MOTOSE In this paper, using properties of
More informationON THE CONTINUED FRACTION EXPANSION OF THE UNIQUE ROOT IN F(p) OF THE EQUATION x 4 + x 2 T x 1/12 = 0 AND OTHER RELATED HYPERQUADRATIC EXPANSIONS
ON THE CONTINUED FRACTION EXPANSION OF THE UNIQUE ROOT IN F(p) OF THE EQUATION x 4 + x 2 T x 1/12 = 0 AND OTHER RELATED HYPERQUADRATIC EXPANSIONS by A. Lasjaunias Abstract.In 1986, Mills and Robbins observed
More informationφ(xy) = (xy) n = x n y n = φ(x)φ(y)
Groups 1. (Algebra Comp S03) Let A, B and C be normal subgroups of a group G with A B. If A C = B C and AC = BC then prove that A = B. Let b B. Since b = b1 BC = AC, there are a A and c C such that b =
More informationDiscrete Math, Second Problem Set (June 24)
Discrete Math, Second Problem Set (June 24) REU 2003 Instructor: Laszlo Babai Scribe: D Jeremy Copeland 1 Number Theory Remark 11 For an arithmetic progression, a 0, a 1 = a 0 +d, a 2 = a 0 +2d, to have
More informationComputations/Applications
Computations/Applications 1. Find the inverse of x + 1 in the ring F 5 [x]/(x 3 1). Solution: We use the Euclidean Algorithm: x 3 1 (x + 1)(x + 4x + 1) + 3 (x + 1) 3(x + ) + 0. Thus 3 (x 3 1) + (x + 1)(4x
More informationFormal Groups. Niki Myrto Mavraki
Formal Groups Niki Myrto Mavraki Contents 1. Introduction 1 2. Some preliminaries 2 3. Formal Groups (1 dimensional) 2 4. Groups associated to formal groups 9 5. The Invariant Differential 11 6. The Formal
More informationHans Wenzl. 4f(x), 4x 3 + 4ax bx + 4c
MATH 104C NUMBER THEORY: NOTES Hans Wenzl 1. DUPLICATION FORMULA AND POINTS OF ORDER THREE We recall a number of useful formulas. If P i = (x i, y i ) are the points of intersection of a line with the
More informationON SPECTRAL CANTOR MEASURES. 1. Introduction
ON SPECTRAL CANTOR MEASURES IZABELLA LABA AND YANG WANG Abstract. A probability measure in R d is called a spectral measure if it has an orthonormal basis consisting of exponentials. In this paper we study
More informationPart II. Number Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler
More information1 Functions of Several Variables 2019 v2
1 Functions of Several Variables 2019 v2 11 Notation The subject of this course is the study of functions f : R n R m The elements of R n, for n 2, will be called vectors so, if m > 1, f will be said to
More informationNOTES ON ZHANG S PRIME GAPS PAPER
NOTES ON ZHANG S PRIME GAPS PAPER TERENCE TAO. Zhang s results For any natural number H, let P (H) denote the assertion that there are infinitely many pairs of distinct primes p, q with p q H; thus for
More informationOblique derivative problems for elliptic and parabolic equations, Lecture II
of the for elliptic and parabolic equations, Lecture II Iowa State University July 22, 2011 of the 1 2 of the of the As a preliminary step in our further we now look at a special situation for elliptic.
More informationSOME VARIANTS OF LAGRANGE S FOUR SQUARES THEOREM
Acta Arith. 183(018), no. 4, 339 36. SOME VARIANTS OF LAGRANGE S FOUR SQUARES THEOREM YU-CHEN SUN AND ZHI-WEI SUN Abstract. Lagrange s four squares theorem is a classical theorem in number theory. Recently,
More information