English

On asymptotic formulae in some sum-product questions

Number Theory 2018-03-06 v2 Combinatorics

Abstract

In this paper we obtain a series of asymptotic formulae in the sum--product phenomena over the prime field Fp\mathbf{F}_p. In the proofs we use usual incidence theorems in Fp\mathbf{F}_p, as well as the growth result in SL2(Fp){\rm SL}_2 (\mathbf{F}_p) due to Helfgott. Here some of our applications:  \bullet~ a new bound for the number of the solutions to the equation (a1a2)(a3a4)=(a1a2)(a3a4)(a_1-a_2) (a_3-a_4) = (a'_1-a'_2) (a'_3-a'_4), ai,aiA\,a_i, a'_i\in A, AA is an arbitrary subset of Fp\mathbf{F}_p,  \bullet~ a new effective bound for multilinear exponential sums of Bourgain,  \bullet~ an asymptotic analogue of the Balog--Wooley decomposition theorem,  \bullet~ growth of p1(b)+1/(a+p2(b))p_1(b) + 1/(a+p_2 (b)), where a,ba,b runs over two subsets of Fp\mathbf{F}_p, p1,p2Fp[x]p_1,p_2 \in \mathbf{F}_p [x] are two non--constant polynomials,  \bullet~ new bounds for some exponential sums with multiplicative and additive characters.

Keywords

Cite

@article{arxiv.1802.09066,
  title  = {On asymptotic formulae in some sum-product questions},
  author = {Ilya D. Shkredov},
  journal= {arXiv preprint arXiv:1802.09066},
  year   = {2018}
}

Comments

61 pages