A solution to the Erd\H{o}s-S\'ark\"ozy-S\'os problem on asymptotic Sidon bases of order 3

DOI10.1112/S0010437X24007140MaRDI QIDQ6429893zbMATH OpenFDO

Authors Cédric Pilatte

Publication date 16 March 2023

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Mathematics Subject Classification ID

Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Arithmetic theory of algebraic function fields (11R58) Additive bases, including sumsets (11B13) Primes in congruence classes (11N13)

Abstract: A set $SsubsetmathbbN$ is a Sidon set if all pairwise sums $s_1+s_2$ (for $s_1,s_{2}inS$, $s_{1}leq{s}_2$) are distinct. A set $SsubsetmathbbN$ 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, ErdH{o}s, S'{a}rk"{o}zy and S'{o}s 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 $mathbb{F}_q[t]$-analogue of Montgomery's conjecture for convolutions of the von Mangoldt function.

Recommendations

• On Sidon sets and asymptotic bases
• Dense sumsets of Sidon sequences
• Sidon basis in polynomial rings over finite fields
• On Sidon sets which are asymptotic bases of order \(4\)
• Representation functions, Sidon sets and bases

This page was built for publication: A solution to the Erd\H{o}s-S\'ark\"ozy-S\'os problem on asymptotic Sidon bases of order 3

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6429893)