Lattice points on circles, squares in arithmetic progressions and sumsets of squares
Abstract
Rudin conjectured that there are never more than c N(1/2) squares in an arithmetic progression of length N. Motivated by this surprisingly difficult problem we formulate more than twenty conjectures in harmonic analysis, analytic number theory, arithmetic geometry, discrete geometry and additive combinatorics (some old and some new) which each, if true, would shed light on Rudin's conjecture.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.