The structure of sets with few sums along a graph
From MaRDI portal
Publication:855841
DOI10.1016/J.JCTA.2005.10.011zbMATH Open1105.05030OpenAlexW2025805784MaRDI QIDQ855841FDOQ855841
Authors: 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
Recommendations
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Gauss and Kloosterman sums; generalizations (11L05)
Cites Work
- A new proof of Szemerédi's theorem for arithmetic progressions of length four
- On linear combinatorics. I: Concurrency---an algebraic approach
- A combinatorial problem on polynomials
- 2N noncollinear points determine at least 2N directions
- A combinatorial problem on polynomials and rational functions
- Title not available (Why is that?)
- A polynomial bound in Freiman's theorem.
- A statistical theorem of set addition
- Title not available (Why is that?)
- On the Sets of Directions Determined by n Points
- Generalized arithmetical progressions and sumsets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Arithmetical progressions and the number of sums
- Title not available (Why is that?)
- On the combinatorics of projective mappings
- On linear combinatorics. III: Few directions and distorted lattices
- On linear combinatorics. II: Structure theorems via additive number theory
- On small sumsets in \((\mathbb{Z}/2\mathbb{Z})^n\)
- A note on the number of distinct distances
Cited In (3)
This page was built for publication: The structure of sets with few sums along a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855841)
