2011/03/29 by Juan Pablo Maldonado, Maldonado, Juan Pablo
Computer Science · Engineering · Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory #Number Theory (math.NT) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1103.5732
openalex publication_date 2011/03/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A Sidon set is a set of the positive integers such that the sums of two pairs is not repeated. I. Ruzsa gave a probabilistic construction of an infinite Sidon set. In this work we present the details of a simplified proof of this construction as suggested in a paper of I. Ruzsa and J. Cilleruelo (Real and -padic Sidon sequences, Acta Sci. Math (Szeged) 70 (2004), 505-510).