On problems of Erdős and Rudin.

DOI10.1016/S0022-1236(03)00073-9zbMath1046.11012OpenAlexW2084903571MaRDI QIDQ1427633

Mei-Chu Chang

Publication date: 14 March 2004

Published in: Journal of Functional Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-1236(03)00073-9

zbMATH Keywords

squaressumsetproduct setErdős-Szemerédi conjecture\(\lambda\)-\(p\) conjectureBalog-Szemerédi theoremFreiman Theoremoperations along graphsRudin conjecture

Mathematics Subject Classification ID

Algebraic combinatorics (05E99) Other combinatorial number theory (11B75) Special sequences and polynomials (11B83) Trigonometric and exponential sums (general theory) (11L03) Lacunary series of trigonometric and other functions; Riesz products (42A55)

Related Items

Product set estimates for non-commutative groups ⋮ The Elekes-Szabó problem and the uniformity conjecture ⋮ The structure theory of set addition revisited ⋮ Sums and products along sparse graphs ⋮ Near optimal bounds in Freiman's theorem ⋮ Sums, Products, and Dilates on Sparse Graphs ⋮ The Uniformity Conjecture in Additive Combinatorics

Cites Work

• Squares in arithmetic progressions
• A new proof of Szemerédi's theorem for arithmetic progressions of length four
• A polynomial bound in Freiman's theorem.
• On the number of sums and products
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item