A power saving for square-difference-free setsResearch Paper
A set is square-difference-free if no two of its elements differ by a perfect square with . The Furstenberg–Sárközy theorem says such sets have density tending to zero; the question is how fast. Writing for the largest size of a square-difference-free subset of , the problem is a prototype for polynomial…