The Thickness of Infinite Sidon Sets

Abstract

Let γ 1. A set A of nonnegative integers is a Sidon set if for each d>0 there is at most one pair (a,b) ∈ A × A with d=a-b. If there are at most γ pairs, then A is a γ-Golomb ruler. We prove that if A is a γ-Golomb ruler, then \[n∞ |A[0,n)|n/ n 2 2 γ.\] There is a γ-Golomb ruler G with \[ n∞ |G[0,n)| n 12 γ.\]

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…