Long arithmetic progressions in sum-sets and the number x-sum-free sets
DOI10.1112/S0024611504015059zbMATH Open1073.11008OpenAlexW2046580399MaRDI QIDQ4673045FDOQ4673045
Authors: Van Vu, Endre Szemerédi
Publication date: 29 April 2005
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/s0024611504015059
Recommendations
Asymptotic enumeration (05A16) Arithmetic progressions (11B25) Goldbach-type theorems; other additive questions involving primes (11P32) Inverse problems of additive number theory, including sumsets (11P70)
Cited In (13)
- Long arithmetic progressions in sumsets: Thresholds and bounds
- Approximate groups and doubling metrics
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- On a conjecture of Alon
- Near optimal bounds in Freiman's theorem
- Long regularly-spaced and convex sequences in dense sets of integers
- Classification theorems for sumsets modulo a prime
- Longest arithmetic progressions in reduced residue systems
- Blocks and progressions in subset sum sets
- Arithmetic progressions in sums of subsets of sparse sets
- Title not available (Why is that?)
- Structural approach to subset sum problems
- A bipartite version of the Erdős–McKay conjecture
This page was built for publication: Long arithmetic progressions in sum-sets and the number x-sum-free sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4673045)