A solution to the Erdos-S\'ark\"ozy-S\'os problem on asymptotic Sidon bases of order 3
Abstract
A set S⊂ N is a Sidon set if all pairwise sums s1+s2 (for s1, s2∈ S, s1≤ s2) are distinct. A set S⊂ N is an asymptotic basis of order 3 if every sufficiently large integer n can be written as the sum of three elements of S. In 1993, Erdos, S\'ark\"ozy and S\'os asked whether there exists a set S with both properties. We answer this question in the affirmative. Our proof relies on a deep result of Sawin on the Fq[t]-analogue of Montgomery's conjecture for convolutions of the von Mangoldt function.
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.