On the few products, many sums problem

From MaRDI portal
Publication:2199504



Abstract: We prove new results on additive properties of finite sets A with small multiplicative doubling |AA|leqM|A| in the category of real/complex sets as well as multiplicative subgroups in the prime residue field. The improvements are based on new combinatorial lemmata, which may be of independent interest. Our main results are the inequality |A-A|^3|AA|^5 gtrsim |A|^{10}, over the reals, "redistributing" the exponents in the textbook Elekes sum-product inequality and the new best known additive energy bound mathsfE(A)lesssimM|A|49/20, which aligns, in a sense to be discussed, with the best known sum set bound |A+A|gtrsimM|A|8/5. These bounds, with M=1, also apply to multiplicative subgroups of mathbbFimesp, whose order is O(sqrtp). We adapt the above energy bound to larger subgroups and obtain new bounds on gaps between elements in cosets of subgroups of order Omega(sqrtp).


Let \(A\) be a finite set of real/complex numbers. Two of the main results of the paper say that (i) \(|A-A|^3\cdot |AA|^5\gg |A|^{10}/\log^{1/2}|A|\), (ii) if \(|AA|\le m|A|\) then \(E(A)\ll m^{8/5}|A|^{49/20}\log^{1/5}|A|\), where \(E(A)=\sum_x r^2_{A\pm A}(x)\) is the additive energy and \(r_{A\pm A}(x)=|\{(a,b)\in A\times A : a\pm b=x\}|\). Estimate (i) remains true if we replace \(AA\) by \(A/A\). If in (ii) we have \(m=1\) then the conclusion is true also for multiplicative subgroups \(\Gamma\subset \mathbb{F}^\times_p\) satisfying \(|\Gamma|\le \sqrt{p}\) (this reproves a result proved by the third author and \textit{I. V. V'yugin} [Sb. Math. 203, No. 6, 844--863 (2012; Zbl 1293.11018)]. They also prove (Theorem 6.5) an improved upper bound for \(E(\Gamma)\) if \(\Gamma\) is a multiplicative subgroups of \(\mathbb{F}^\times_p\) with \(p^{1/2}\le |\Gamma|\le p^{2/3}\) with help of which they prove a new estimate for the maximum gap \(H_p(t)\le p^{437/480 =o(1)}\) between elements of cosets of \(\Gamma\) for \(t\ge p^{1/2}\) and \(p\to\infty\). The proofs uses geometric incidence bounds from the Szemerédi-Trotter theorem as well as combinatorial arguments.



Cites work


Cited in
(27)








This page was built for publication: On the few products, many sums problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2199504)