ID: 1803.04637

On higher energy decompositions and the sum-product phenomenon

March 13, 2018

View on ArXiv
George Shakan
Mathematics
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}.$$

Similar papers 1

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

Some remarks on the Balog-Wooley decomposition theorem and quantities D^+, D^\times

May 1, 2016

90% Match
Ilya D. Shkredov
Combinatorics
Number Theory

In the paper we study two characteristics D^+ (A), D^\times (A) of a set A which play important role in recent results concerning sum-product phenomenon. Also we obtain several variants and improvements of the Balog-Wooley decomposition theorem. In particular, we prove that any finite subset of real numbers can be split into two sets with small quantities D^+ and D^\times.

Find SimilarView on arXiv

An upper bound on the multiplicative energy

June 5, 2008

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

Variations on the Sum-Product Problem

December 22, 2013

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

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

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

Asymmetric estimates and the sum-product problems

May 20, 2020

89% Match
Boqing Xue
Number Theory

We show two asymmetric estimates, one on the number of collinear triples and the other on that of solutions to $(a_1+a_2)(a_1^{\prime\prime\prime}+a_2^{\prime\prime\prime})=(a_1^\prime+a_2^\prime)(a_1^{\prime\prime}+a_2^{\prime\prime})$. As applications, we improve results on difference-product/division estimates and on Balog-Wooley decomposition: For any finite subset $A$ of $\mathbb{R}$, \[ \max\{|A-A|,|AA|\} \gtrsim |A|^{1+105/347},\quad \max\{|A-A|,|A/A|\} \gtrsim |A|^{1+...

Find SimilarView on arXiv

Energy estimates in sum-product and convexity problems

September 10, 2021

88% Match
Akshat Mudgal
Combinatorics
Number Theory

We prove a new class of low-energy decompositions which, amongst other consequences, imply that any finite set $A$ of integers may be written as $A = B \cup C$, where $B$ and $C$ are disjoint sets satisfying \[ |\{ (b_1, \dots, b_{2s}) \in B^{2s} \ | \ b_1 + \dots + b_{s} = b_{s+1} + \dots + b_{2s}\}| \ll_{s} |B|^{2s - (\log \log s)^{1/2 - o(1)}} \] and \[ |\{ (c_1, \dots, c_{2s}) \in C^{2s} \ | \ c_1 \dots c_{s} = c_{s+1} \dots c_{2s} \}| \ll_{s} |C|^{2s - (\log \log s)^{1/2...

Find SimilarView on arXiv
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...

On the few products, many sums problem

December 1, 2017

87% Match
Brendan Murphy, Misha Rudnev, ... , Shteinikov Yurii N.
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 a...

Find SimilarView on arXiv