A divisor-profile lower bound and a polynomial-height near-Sidon theorem for squares
Statement
Problem 3.7 (Brought by B. Green and T. Tao). Take a finite subset of the squares of integers, |A| = N. What lower bound can you get on A + A? One can get better than cN via Freiman's theorem. B. Green comments: I am not sure who posed this. It is certainly implicit in a paper of Chang on Rudin's problem (are the squares a Λ( p) set?)
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.