ID: 1712.00410

On the few products, many sums problem

December 1, 2017

View on ArXiv
Brendan Murphy, Misha Rudnev, Ilya D. Shkredov, Yurii N. Shteinikov
Mathematics
Combinatorics

We prove new results on additive properties of finite sets $A$ with small multiplicative doubling $|AA|\leq M|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 $\mathsf E(A)\lesssim_M |A|^{49/20}$, which aligns, in a sense to be discussed, with the best known sum set bound $|A+A|\gtrsim_M |A|^{8/5}$. These bounds, with $M=1$, also apply to multiplicative subgroups of $\mathbb F^\times_p$, whose order is $O(\sqrt{p})$. We adapt the above energy bound to larger subgroups and obtain new bounds on gaps between elements in cosets of subgroups of order $\Omega(\sqrt{p})$.

Similar papers 1

Brandon Hanson, Misha Rudnev, ... , Zhelezov Dmitrii
Number Theory
Combinatorics

It was asked by E. Szemer\'edi if, for a finite set $A\subset\mathbb{Z}$, one can improve estimates for $\max\{|A+A|,|A\cdot A|\}$, under the constraint that all integers involved have a bounded number of prime factors -- that is, each $a\in A$ satisfies $\omega(a)\leq k$. In this paper, answer Szemer\'edi's question in the affirmative by showing that this maximum is of order $|A|^{\frac{5}{3}-o(1)}$ provided $k\leq (\log|A|)^{1-\epsilon}$ for some $\epsilon>0$. In fact, this...

Slightly improved sum-product estimates in fields of prime order

July 12, 2009

89% Match
Liangpan Li
Number Theory
Combinatorics

Let $\mathbb{F}_p$ be the field of residue classes modulo a prime number $p$ and let $A$ be a nonempty subset of $\mathbb{F}_p$. In this paper we show that if $|A|\preceq p^{0.5}$, then \[ \max\{|A\pm A|,|AA|\}\succeq|A|^{13/12};\] if $|A|\succeq p^{0.5}$, then \[ \max\{|A\pm A|,|AA|\}\succapprox \min\{|A|^{13/12}(\frac{|A|}{p^{0.5}})^{1/12},|A|(\frac{p}{|A|})^{1/11}\}.\] These results slightly improve the estimates of Bourgain-Garaev and Shen. Sum-product estimates on differ...

Find SimilarView on arXiv

Variations on the sum-product problem II

March 28, 2017

89% Match
Brendan Murphy, Oliver Roche-Newton, Ilya Shkredov
Combinatorics
Number Theory

This is a sequel to the paper arXiv:1312.6438 by the same authors. In this sequel, we quantitatively improve several of the main results of arXiv:1312.6438, and build on the methods therein. The main new results is that, for any finite set $A \subset \mathbb R$, there exists $a \in A$ such that $|A(A+a)| \gtrsim |A|^{\frac{3}{2}+\frac{1}{186}}$. We give improved bounds for the cardinalities of $A(A+A)$ and $A(A-A)$. Also, we prove that $|\{(a_1+a_2+a_3+a_4)^2+\log a_5 : a_i...

Find SimilarView on arXiv

An upper bound on the multiplicative energy

June 5, 2008

89% Match
Jozsef Solymosi
Combinatorics

We prove that the sumset or the productset of any finite set of real numbers, $A,$ is at least $|A|^{4/3-\epsilon},$ improving earlier bounds. Our main tool is a new upper bound on the multiplicative energy, $E(A,A).$

Find SimilarView on arXiv

On additive bases of sets with small product set

June 7, 2016

89% Match
Ilya D. Shkredov, Dmitrii Zhelezov
Number Theory

We prove that finite sets of real numbers satisfying $|AA| \leq |A|^{1+\epsilon}$ with sufficiently small $\epsilon > 0$ cannot have small additive bases nor can they be written as a set of sums $B+C$ with $|B|, |C| \geq 2$. The result can be seen as a real analog of the conjecture of S\'ark\"ozy that multiplicative subgroups of finite fields of prime order are additively irreducible.

Find SimilarView on arXiv

Variations on the Sum-Product Problem

December 22, 2013

88% Match
Brendan Murphy, Oliver Roche-Newton, Ilya D. Shkredov
Combinatorics

This paper considers various formulations of the sum-product problem. It is shown that, for a finite set $A\subset{\mathbb{R}}$, $$|A(A+A)|\gg{|A|^{\frac{3}{2}+\frac{1}{178}}},$$ giving a partial answer to a conjecture of Balog. In a similar spirit, it is established that $$|A(A+A+A+A)|\gg{\frac{|A|^2}{\log{|A|}}},$$ a bound which is optimal up to constant and logarithmic factors. We also prove several new results concerning sum-product estimates and expanders, for example, s...

Find SimilarView on arXiv

An update on the sum-product problem

May 22, 2020

88% Match
Misha Rudnev, Sophie Stevens
Number Theory
Combinatorics

We improve the best known sum-product estimates over the reals. We prove that \[ \max(|A+A|,|AA|)\geq |A|^{\frac{4}{3} + \frac{2}{1167} - o(1)}\,, \] for a finite $A\subset \mathbb R$, following a streamlining of the arguments of Solymosi, Konyagin and Shkredov. We include several new observations to our techniques. Furthermore, \[ |AA+AA|\geq |A|^{\frac{127}{80} - o(1)}\,. \] Besides, for a convex set $A$ we show that \[ |A+A|\geq |A|^{\frac{30}{19}-o(1)}\,. \] This paper ...

Find SimilarView on arXiv

New results on sum-products in R

February 10, 2016

88% Match
Sergei Konyagin, Ilya D. Shkredov
Combinatorics
Number Theory

We improve a previous sum--products estimates in R, namely, we obtain that max{|A+A|,|AA|} \gg |A|^{4/3+c}, where c any number less than 5/9813. New lower bounds for sums of sets with small the product set are found. Also we prove some pure energy sum--products results, improving a result of Balog and Wooley, in particular.

Find SimilarView on arXiv

A new sum-product estimate in prime fields

July 29, 2018

88% Match
Changhao Chen, Bryce Kerr, Ali Mohammadi
Combinatorics
Number Theory

In this paper we obtain a new sum-product estimate in prime fields. In particular, we show that if $A\subseteq \mathbb{F}_p$ satisfies $|A|\le p^{64/117}$ then $$ \max\{|A\pm A|, |AA|\} \gtrsim |A|^{39/32}. $$ Our argument builds on and improves some recent results of Shakan and Shkredov which use the eigenvalue method to reduce to estimating a fourth moment energy and the additive energy $E^+(P)$ of some subset $P\subseteq A+A$. Our main novelty comes from reducing the estim...

Find SimilarView on arXiv

An improved bound on the sum-product estimate in $\mathbb{F}_{p}$

December 9, 2020

88% Match
Connor Paul Wilson
Combinatorics
Number Theory

We give an improved bound on the famed sum-product estimate in a field of residue class modulo $p$ ($\mathbb{F}_{p}$) by Erd\H{o}s and Szemeredi, and a non-empty set $A \subset \mathbb{F}_{p}$ such that: $$ \max \{|A+A|,|A A|\} \gg \min \left\{\frac{|A|^{15 / 14} \max \left\{1,|A|^{1 / 7} p^{-1 / 14}\right\}}{(\log |A|)^{2 / 7}}, \frac{|A|^{11 / 12} p^{1 / 12}}{(\log |A|)^{1 / 3}}\right\}, $$ and more importantly: $$\max \{|A+A|,|A A|\} \gg \frac{|A|^{15 / 14}}{(\log |A|)^{2 ...

Find SimilarView on arXiv