A remark of Ruzsa's construction of an infinite Sidon set
Juan Pablo Maldonado
TL;DR
This paper provides a simplified proof of Ruzsa's probabilistic construction of an infinite Sidon set, a set of positive integers with unique pairwise sums, enhancing understanding of its structure.
Contribution
It offers a clearer, more accessible proof of Ruzsa's original construction of an infinite Sidon set, previously established through probabilistic methods.
Findings
Simplified proof of Ruzsa's construction
Enhanced understanding of Sidon set properties
Potential for broader applications in additive number theory
Abstract
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).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Limits and Structures in Graph Theory · Graph Labeling and Dimension Problems