The structure of sets with few sums along a graph

DOI10.1016/j.jcta.2005.10.011zbMath1105.05030OpenAlexW2025805784MaRDI QIDQ855841

György Elekes, Imre Z. Ruzsa

Publication date: 7 December 2006

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2005.10.011

zbMATH Keywords

sumsetFreiman theorem

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Gauss and Kloosterman sums; generalizations (11L05)

Related Items (2)

Product set estimates for non-commutative groups ⋮ On sets with small doubling property

Cites Work

• On linear combinatorics. III: Few directions and distorted lattices
• 2N noncollinear points determine at least 2N directions
• Arithmetical progressions and the number of sums
• A new proof of Szemerédi's theorem for arithmetic progressions of length four
• On linear combinatorics. I: Concurrency---an algebraic approach
• On linear combinatorics. II: Structure theorems via additive number theory
• Generalized arithmetical progressions and sumsets
• A statistical theorem of set addition
• A combinatorial problem on polynomials
• On the combinatorics of projective mappings
• A polynomial bound in Freiman's theorem.
• On small sumsets in \((\mathbb{Z}/2\mathbb{Z})^n\)
• A combinatorial problem on polynomials and rational functions
• On the Sets of Directions Determined by n Points
• A note on the number of distinct distances
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The structure of sets with few sums along a graph