2022/02/02 by Robin Riblet, Riblet, Robin
Mathematics · #Advanced Topology and Set Theory #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #Mathematical Dynamics and Fractals #Number Theory (math.NT)
paper · pdf · doi:10.48550/arxiv.2202.01296
openalex publication_date 2022/02/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We study the maximum size of Sidon sets in unions of integers intervals. If A⊆ℕ is the union of two intervals and if | A |=n (where | A | denotes the cardinality of A), we prove that A contains a Sidon set of size at least 0, 876√(n). On the other hand, by using the small differences technique, we establish a bound of the maximum size of Sidon sets in the union of k intervals.