ID: 1312.6438

Variations on the Sum-Product Problem

December 22, 2013

View on ArXiv
Brendan Murphy, Oliver Roche-Newton, Ilya D. Shkredov
Mathematics
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, showing that $$|A(A+a)|\gg{|A|^{3/2}}$$ holds for a typical element of $A$.

Similar papers 1

Variations on the sum-product problem II

March 28, 2017

95% 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 update on the sum-product problem

May 22, 2020

93% 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

On the size of the set $AA+A$

January 31, 2018

90% Match
Oliver Roche-Newton, Imre Z. Ruzsa, ... , Shkredov Ilya D.
Combinatorics

It is established that there exists an absolute constant $c>0$ such that for any finite set $A$ of positive real numbers $$|AA+A| \gg |A|^{\frac{3}{2}+c}.$$ On the other hand, we give an explicit construction of a finite set $A \subset \mathbb R$ such that $|AA+A|=o(|A|^2)$, disproving a conjecture of Balog.

Find SimilarView on arXiv

A short proof of a near-optimal cardinality estimate for the product of a sum set

February 19, 2015

90% Match
Oliver Roche-Newton
Combinatorics

In this note it is established that, for any finite set $A$ of real numbers, there exist two elements $a,b \in A$ such that $$|(a+A)(b+A)| \gg \frac{|A|^2}{\log |A|}.$$ In particular, it follows that $|(A+A)(A+A)| \gg \frac{|A|^2}{\log |A|}$. The latter inequality had in fact already been established in an earlier work of the author and Rudnev (arXiv:1203.6237), which built upon the recent developments of Guth and Katz (arXiv:1011.4105) in their work on the Erd\H{o}s dist...

Find SimilarView on arXiv

On sum sets of convex functions

February 10, 2021

90% Match
Sophie Stevens, Audie Warren
Combinatorics
Number Theory

In this paper we prove new bounds for sums of convex or concave functions. Specifically, we prove that for all $A,B \subseteq \mathbb R$ finite sets, and for all $f,g$ convex or concave functions, we have $$|A + B|^{38}|f(A) + g(B)|^{38} \gtrsim |A|^{49}|B|^{49}.$$ This result can be used to obtain bounds on a number of two-variable expanders of interest, as well as to the asymmetric sum-product problem. We also adjust our technique to also prove the three-variable expans...

Find SimilarView on arXiv

New sum-product estimates for real and complex numbers

February 24, 2014

90% Match
Antal Balog, Oliver Roche-Newton
Combinatorics
Number Theory

A variation on the sum-product problem seeks to show that a set which is defined by additive and multiplicative operations will always be large. In this paper, we prove new results of this type. In particular, we show that for any finite set $A$ of positive real numbers, it is true that $$\left|\left\{\frac{a+b}{c+d}:a,b,c,d\in{A}\right\}\right|\geq{2|A|^2-1}.$$ As a consequence of this result, it is also established that $$|4^{k-1}A^{(k)}|:=|\underbrace{\underbrace{A\cdots{A...

Find SimilarView on arXiv

New results on sum-products in R

February 10, 2016

90% 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

On higher energy decompositions and the sum-product phenomenon

March 13, 2018

90% Match
George Shakan
Number Theory
Combinatorics

Let $A \subset \mathbb{R}$ be finite. We quantitatively improve the Balog-Wooley decomposition, that is $A$ can be partitioned into sets $B$ and $C$ such that $$\max\{E^+(B) , E^{\times}(C)\} \lesssim |A|^{3 - 7/26}, \ \ \max \{E^+(B,A) , E^{\times}(C, A) \}\lesssim |A|^{3 - 1/4}.$$ We use similar decompositions to improve upon various sum-product estimates. For instance, we show $$ |A+A| + |A A| \gtrsim |A|^{4/3 + 5/5277}.$$

Find SimilarView on arXiv

A better than $3/2$ exponent for iterated sums and products over $\mathbb R$

April 3, 2023

89% Match
Oliver Roche-Newton
Combinatorics
Number Theory

In this paper, we prove that the bound \[ \max \{ |8A-7A|,|5f(A)-4f(A)| \} \gg |A|^{\frac{3}{2} + \frac{1}{54}-o(1)} \] holds for all $A \subset \mathbb R$, and for all convex functions $f$ which satisfy an additional technical condition. This technical condition is satisfied by the logarithmic function, and this fact can be used to deduce a sum-product estimate \[ \max \{ |16A| , |A^{(16)}| \} \gg |A|^{\frac{3}{2} + c}, \] for some $c>0$. Previously, no sum-product estimate ...

Find SimilarView on arXiv

On sum sets of sets, having small product set

March 19, 2015

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

We improve a result of Solymosi on sum-products in R, namely, we prove that max{|A+A|,|AA|}\gg |A|^{4/3+c}, where c>0 is an absolute constant. New lower bounds for sums of sets with small product set are found. Previous results are improved effectively for sets A from R with |AA| \le |A|^{4/3}.

Find SimilarView on arXiv