ID: 1410.1156

A bound on the multiplicative energy of a sum set and extremal sum-product problems

October 5, 2014

View on ArXiv

Similar papers 2

On The Energy Variant of the Sum-Product Conjecture

July 18, 2016

86% Match
Misha Rudnev, Ilya D. Shkredov, Sophie Stevens
Combinatorics
Number Theory

We prove new exponents for the energy version of the Erd\H{o}s-Szemer\'edi sum-product conjecture, raised by Balog and Wooley. They match the previously established milestone values for the standard formulation of the question, both for general fields and the special case of real or complex numbers, and appear to be the best ones attainable within the currently available technology. Further results are obtained about multiplicative energies of additive shifts and a strengthen...

Find SimilarView on arXiv

On higher energy decompositions and the sum-product phenomenon

March 13, 2018

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

Discretized sum-product type problems: Energy variants and Applications

November 4, 2022

85% Match
Ali Mohammadi, Quy Pham, ... , Shen Chun-Yen
Classical Analysis and ODEs
Combinatorics
Number Theory

In this paper, we prove non-trivial estimates for the additive discretized energy of \[\sum_{c\in C} |\{(a_1, a_2, b_1, b_2)\in A^2\times B^2: |(a_1 +cb_1) - (a_2 + cb_2)|\le \delta\}|_{\delta},\] that depend on non-concentration conditions of the sets. As applications, we obtain a number of new results on the $\delta$-covering and on the Hausdorff dimensional version of the $A+cB$ problem. Our proofs introduce a novel approach that makes use of a combination of methods from ...

Find SimilarView on arXiv

New sum product type estimates

July 29, 2012

85% Match
Sergei V. Konyagin, Misha Rudnev
Combinatorics
Number Theory

New lower bounds involving sum, difference, product, and ratio sets for a set $A\subset \C$ are given. The estimates involving the sum set match, up to constants, the one obtained by Solymosi for the reals and are obtained by generalising his approach to the complex plane. The bounds involving the difference set are slightly weaker. They improve on the best known ones, including the case $A\subset \R$, which also due to Solymosi, by means of combining the use of the Szemer\'e...

Find SimilarView on arXiv

Some remarks on the asymmetric sum--product phenomenon

May 26, 2017

85% Match
Ilya D. Shkredov
Number Theory
Combinatorics

Using some new observations connected to higher energies, we obtain quantitative lower bounds on $\max\{|AB|, |A+C| \}$ and $\max\{|(A+\alpha)B|, |A+C|\}$, $\alpha \neq 0$ in the regime when the sizes of finite subsets $A,B,C$ of a field differ significantly.

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

A new sum-product estimate in prime fields

July 29, 2018

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

On the density of sumsets and product sets

February 7, 2019

84% Match
Norbert Hegyvári, François Hennecart, Péter Pál Pach
Number Theory
Combinatorics

In this paper some links between the density of a set of integers and the density of its sumset, product set and set of subset sums are presented.

Find SimilarView on arXiv

Variations on the Sum-Product Problem

December 22, 2013

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

Convexity and a sum-product type estimate

November 22, 2011

84% Match
Liangpan Li, Oliver Roche-Newton
Combinatorics

In this paper we further study the relationship between convexity and additive growth, building on the work of Schoen and Shkredov (\cite{SS}) to get some improvements to earlier results of Elekes, Nathanson and Ruzsa (\cite{ENR}). In particular, we show that for any finite set $A\subset{\mathbb{R}}$ and any strictly convex or concave function $f$, \[|A+f(A)|\gg{\frac{|A|^{24/19}}{(\log|A|)^{2/19}}}\] and \[\max\{|A-A|,\ |f(A)+f(A)|\}\gg{\frac{|A|^{14/11}}{(\log|A|)^{2/11}}}....

Find SimilarView on arXiv