2012/09/03 by Cilleruelo, Javier
#Combinatorics (math.CO) #FOS: Mathematics #Number Theory (math.NT)
paper · doi:10.48550/arxiv.1209.0326
We present a new method to obtain infinite Sidon sequences, based on the discrete logarithm. We construct an infinite Sidon sequence A, with A(x)= x√ 2-1+o(1). Ruzsa proved the existence of a Sidon sequence with similar counting function but his proof was not constructive. Our method generalizes to Bh sequences: For all h≥ 3, there is a Bh sequence A such that A(x)=x√((h-1)2+1)-(h-1)+o(1).