Discrete spheres and arithmetic progressions in product sets
Abstract
We prove that if B is a set of N positive integers such that B· B contains an arithmetic progression of length M, then for some absolute C > 0, π(M) + C M2/32 M ≤ N, where π is the prime counting function. This improves on previously known bounds of the form N = (π(M)) and gives a bound which is sharp up to the second order term, as Pach and S\'andor gave an example for which N < π(M)+ O( M2/32 M ). The main new tool is a reduction of the original problem to the question of approximate additive decomposition of the 3-sphere in F3n which is the set of \0,1\ vectors with exactly three non-zero coordinates. Namely, we prove that such a set cannot have an additive basis of order two of size less than c n2 with absolute constant c > 0.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.