2015
DOI: 10.1134/s0081543815040185
|View full text |Cite
|
Sign up to set email alerts
|

On sums of Szemerédi-Trotter sets

Abstract: 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 under convex/concave maps and others.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
40
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 30 publications
(40 citation statements)
references
References 13 publications
0
40
0
Order By: Relevance
“…Again, it is necessary to check the conditions of Lemma , where C > 0 is an absolute constant. Indeed, by the previous arguments the inequality |A + λA| ≤ M|A| gives us the required bound for the thirdenergy and the common energy, see Lemma 23 and Lemma 25, and exactly such kind of statements are needed in the eigenvalues approach from [43]. Nevertheless, the methods in [43] are less elementary (although give slightly better bounds), so we prefer to give a more transparent proof in the current paper.…”
Section: Proof Of Theoremmentioning
confidence: 90%
“…Again, it is necessary to check the conditions of Lemma , where C > 0 is an absolute constant. Indeed, by the previous arguments the inequality |A + λA| ≤ M|A| gives us the required bound for the thirdenergy and the common energy, see Lemma 23 and Lemma 25, and exactly such kind of statements are needed in the eigenvalues approach from [43]. Nevertheless, the methods in [43] are less elementary (although give slightly better bounds), so we prefer to give a more transparent proof in the current paper.…”
Section: Proof Of Theoremmentioning
confidence: 90%
“…Dealing with the "few sums, many products" side of the coin has been much more successful; this was first done by Elekes and Ruzsa [9]. Its counterpart proves to be much harder; it is referred by some authors as the weak Erdős-Szemerédi conjecture, with the best known estimate stated as [17,Theorem 12], originating in [24].…”
Section: 12mentioning
confidence: 99%
“…Improvements have been made to (2), which highlights the advantage of allowing B to vary in Definition 1.5. Sh1,Theorem 11] , [KoRu,Corollary 10], see also [ScSh], [MRS2,Theorem 13], see also [Sh3]] Let A ⊂ R. Then…”
Section: Definition 15 Letmentioning
confidence: 99%
“…Solymosi's argument with Shkredov's work in additive combinatorics [Sh1,Sh3] to increase Solymosi's exponent. In a more recent paper [KoSh2], the same authors proved δ = 4/3 + 5/9813 is admissible in Conjecture 1.1.…”
mentioning
confidence: 99%