On strong infinite Sidon and $B_h$ sets and random sets of integers
David Fabian, Juanjo Ru\'e, Christoph Spiegel

TL;DR
This paper establishes new lower bounds for the growth of strong infinite Sidon and $B_h$ sets, and explores their density within random subsets of natural numbers, advancing previous theoretical bounds.
Contribution
It introduces the first non-trivial bounds for $eta$-strong infinite $B_h$ sets and improves bounds for $eta$-strong infinite Sidon sets, extending the understanding of their density in random sets.
Findings
New lower bounds for $eta$-strong Sidon sets when $0 \\leq \\alpha < 1$.
First non-trivial bounds for $eta$-strong infinite $B_h$ sets.
Enhanced understanding of the density of these sets in random subsets of natural numbers.
Abstract
A set of integers is an -strong Sidon set if the pairwise sums of its elements are far apart by a certain measure depending on , more specifically if for every satisfying . We obtain a new lower bound for the growth of -strong infinite Sidon sets when . We also further extend that notion in a natural way by obtaining the first non-trivial bound for -strong infinite sets. In both cases, we study the implications of these bounds for the density of, respectively, the largest Sidon or set contained in a random infinite subset of . Our theorems improve on previous results by Kohayakawa, Lee, Moreira and R\"odl.
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
TopicsLimits and Structures in Graph Theory · Advanced Topology and Set Theory · Complexity and Algorithms in Graphs
