ProbXiv
Explorersign in
Problem archiveProblem record

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

Added
Links

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.