ID: 2109.04932

Energy estimates in sum-product and convexity problems

September 10, 2021

View on ArXiv
Akshat Mudgal
Mathematics
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 - o(1)}}.\] This generalises previous results of Bourgain--Chang on many-fold sumsets and product sets to the setting of many-fold energies, albeit with a weaker power saving, consequently confirming a speculation of Balog--Wooley. We further use our method to obtain new estimates for $s$-fold additive energies of $k$-convex sets, and these come arbitrarily close to the known lower bounds as $s$ becomes sufficiently large.

Similar papers 1

On higher energy decompositions and the sum-product phenomenon

March 13, 2018

88% 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 bound on the multiplicative energy of a sum set and extremal sum-product problems

October 5, 2014

87% Match
Oliver Roche-Newton, Dmitry Zhelezov
Combinatorics
Number Theory

In recent years some near-optimal estimates have been established for certain sum-product type estimates. This paper gives some first extremal results which provide information about when these bounds may or may not be tight. The main tool is a new result which provides a nontrivial upper bound on the multiplicative energy of a sum set or difference set.

Find SimilarView on arXiv

New results on sum-products in R

February 10, 2016

87% 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 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
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...

Some new results on higher energies

December 27, 2012

87% Match
Ilya D. Shkredov
Combinatorics

In the paper we develop the method of higher energies. New upper bounds for the additive energies of convex sets, sets A with small |AA| and |A(A+1)| are obtained. We prove new structural results, including higher sumsets, and develop the notion of dual popular difference sets.

Find SimilarView on arXiv

Energies and structure of additive sets

May 13, 2014

87% Match
Ilya D. Shkredov
Combinatorics
Number Theory

In the paper we prove that any sumset or difference set has large E_3 energy. Also, we give a full description of families of sets having critical relations between some kind of energies such as E_k, T_k and Gowers norms. In particular, we give criteria for a set to be a 1) set of the form H+L, where H+H is small and L has "random structure", 2) set equals a disjoint union of sets H_j, each H_j has small doubling, 3) set having large subset A' with 2A' is equal to a set with ...

Find SimilarView on arXiv

On iterated product sets with shifts II

June 5, 2018

86% Match
Brandon Hanson, Oliver Roche-Newton, Dmitrii Zhelezov
Number Theory
Classical Analysis and ODEs
Combinatorics

The main result of this paper is the following: for all $b \in \mathbb Z$ there exists $k=k(b)$ such that \[ \max \{ |A^{(k)}|, |(A+u)^{(k)}| \} \geq |A|^b, \] for any finite $A \subset \mathbb Q$ and any non-zero $u \in \mathbb Q$. Here, $|A^{(k)}|$ denotes the $k$-fold product set $\{a_1\cdots a_k : a_1, \dots, a_k \in A \}$. Furthermore, our method of proof also gives the following $l_{\infty}$ sum-product estimate. For all $\gamma >0$ there exists a constant $C=C(\gamma...

Find SimilarView on arXiv

Growth in Sumsets of Higher Convex Functions

November 5, 2021

86% Match
Peter J. Bradshaw
Number Theory
Combinatorics

The main results of this paper concern growth in sums of a $k$-convex function $f$. Firstly, we streamline the proof of a growth result for $f(A)$ where $A$ has small additive doubling, and improve the bound by removing logarithmic factors. The result yields an optimal bound for \[ |2^k f(A) - (2^k-1)f(A)|. \] We also generalise a recent result of Hanson, Roche-Newton and Senger, by proving that for any finite $A\subset \mathbb{R}$ \[ | 2^k f(sA-sA) - (2^k-1) f(sA-sA)| \g...

Find SimilarView on arXiv

On sets with small additive doubling in product sets

February 12, 2015

86% Match
Dmitry Zhelezov
Number Theory

Following the sum-product paradigm, we prove that for a set $B$ with polynomial growth, the product set $B.B$ cannot contain large subsets with size of order $|B|^2$ with small doubling. It follows that the additive energy of $B.B$ is asymptotically $o(|B|^6)$. In particular, we extend to sets of small doubling and polynomial growth the classical Multiplication Table theorem of Erd\H{o}s saying that $|[1..n]. [1..n]| = o(n^2)$.

Find SimilarView on arXiv