Corpus ID: 119313761

# New results on sum-products in R

@article{Konyagin2016NewRO,
title={New results on sum-products in R},
author={Sergei Konyagin and Ilya D. Shkredov},
journal={arXiv: Combinatorics},
year={2016}
}
• Published 10 February 2016
• Mathematics
• arXiv: Combinatorics
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.
Some remarks on the asymmetric sum-product phenomenon
• I. Shkredov
• Mathematics, Physics
• Moscow Journal of Combinatorics and Number Theory
• 2019
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 theExpand
An application of the sum-product phenomenon to sets having no solutions of several linear equations
We prove that for an arbitrary $\kappa \le \frac{1}{3}$ any subset of $\mathbf{F}_p$ avoiding $t$ linear equations with three variables has size less than $O(p/t^\kappa)$. We also find severalExpand
On the few products, many sums problem
• Mathematics
• Journal de Théorie des Nombres de Bordeaux
• 2019
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 primeExpand
N T ] 1 6 Ju l 2 01 8 Sum-product estimates over arbitrary finite fields
• 2018
In this paper we prove some results on sum-product estimates over arbitrary finite fields. More precisely, we show that for sufficiently small sets A ⊂ Fq we have |(A−A) + (A−A)| ≫ |A| 1 21 . ThisExpand
Some remarks on the Balog–Wooley decomposition theorem and quantities D+, D×
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 andExpand
Breaking the 6/5 threshold for sums and products modulo a prime
• Mathematics
• 2018
Let $A \subset \mathbb{F}_p$ of size at most $p^{3/5}$. We show $$|A+A| + |AA| \gtrsim |A|^{6/5 + c},$$ for $c = 4/305$. Our main tools are the cartesian product point--line incidence theorem ofExpand
On the energy variant of the sum-product conjecture
• Mathematics
• Revista Matemática Iberoamericana
• 2019
We prove new exponents for the energy version of the Erdős-Szemeredi sum-product conjecture, raised by Balog and Wooley. They match the previously established milestone values for the standardExpand
Difference sets are not multiplicatively closed
We prove that for any finite set A of real numbers its difference set D:=A-A has large product set and quotient set, namely, |DD|, |D/D| \gg |D|^{1+c}, where c>0 is an absolute constant. A similarExpand
Some remarks on sets with small quotient set
We prove, in particular, that for any finite set of real numbers A with |A/A| \ll |A| one has |A-A| > |A|^{5/3 - o(1)}. Also we show that |3A| > |A|^{2-o(1)} in the case.
An update on the sum-product problem
• Mathematics
• Mathematical Proceedings of the Cambridge Philosophical Society
• 2021
We improve the best known sum-product estimates over the reals. We prove that $\max(|A+A|,|A+A|)\geq |A|^{\frac{4}{3} + \frac{2}{1167} - o(1)}\,,$ for a finite $A\subset \mathbbExpand #### References SHOWING 1-10 OF 14 REFERENCES On sum sets of sets having small product set • Mathematics • 2015 We improve the sum–product result of Solymosi in R; namely, we prove that max{|A + A|, |AA|} ****** |A|4/3+c, where c > 0 is an absolute constant. New lower bounds for sums of sets with small productExpand Some new inequalities in additive combinatorics In the paper we find new inequalities involving the intersections$A\cap (A-x)$of shifts of some subset$A$from an abelian group. We apply the inequalities to obtain new upper bounds for theExpand Bounding multiplicative energy by the sumset Abstract We prove that the sumset or the productset of any finite set of real numbers, A, is at least | A | 4 / 3 − e , improving earlier bounds. Our main tool is a new upper bound on theExpand On sums of Szemer\'edi--Trotter sets We prove new general results on sumsets of sets having Szemer\'edi--Trotter type. This family includes convex sets, sets with small multiplicative doubling, images of sets under convex/concave mapsExpand On Additive Doubling and Energy • Mathematics, Computer Science • SIAM J. Discret. Math. • 2010 It is shown that there is a universal$\epsilon>0$so that any subset of an abelian group with subtractive doubling$K$must be polynomially related to a set with additive energy at least$\frac{1}{K^{1-\ep silon}}\$. Expand
On sums of Szemerédi-Trotter sets
We prove new general results on sumsets and difference sets for sets of the Szemerédi-Trotter type. This family includes convex sets, sets with small multiplicative doubling, images of sets underExpand
On sums and products of integers
• Mathematics
• 1983
Let 1 ≦ a 1 <... <a n be a sequence of integers Consider the integers of the form $$a_i + a_j ,\,a_i a_j ,\,1 \leqq i \leqq j \leqq n.$$ (1)
Sets with few distinct distances do not have heavy lines
• Computer Science, Mathematics
• Discret. Math.
• 2015
It is shown that no line can contain more than O ( n 43 / 52 polylog ( n ) points of P ) points, equivalent to distances in the Minkowski plane. Expand
Higher moments of convolutions
• Mathematics
• 2011
We study higher moments of convolutions of the characteristic function of a set, which generalize a classical notion of the additive energy. Such quantities appear in many problems of additiveExpand
Extremal problems in discrete geometry
• Mathematics, Computer Science
• Comb.
• 1983
Several theorems involving configurations of points and lines in the Euclidean plane are established, including one that shows that there is an absolute constantc3 so that whenevern points are placed in the plane not all on the same line, then there is one point on more thanc3n of the lines determined by then points. Expand