Abstract
A set is a Sidon set if all pairwise sums (for,) are distinct. A set is an asymptotic basis of order 3 if every sufficiently large integer can be written as the sum of three elements of. In 1993, Erdos, Sárközy and Sós asked whether there exists a set with both properties. We answer this question in the affirmative. Our proof relies on a deep result of Sawin on the-Analogue of Montgomery's conjecture for convolutions of the von Mangoldt function.
Author supplied keywords
Cite
CITATION STYLE
Pilatte, C. (2024). A solution to the Erdos-Sárközy-Sós problem on asymptotic Sidon bases of order 3. Compositio Mathematica, 160(6), 1418–1432. https://doi.org/10.1112/S0010437X24007140
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.