Popular differences and generalized Sidon sets
Abstract
For a subset A ⊂eq [N], we define the representation function rA-A(d) := \#\(a,a') ∈ A × A : d = a - a'\ and define MD(A) := 1 ≤ d < D rA-A(d) for D>1. We study the smallest possible value of MD(A) as A ranges over all possible subsets of [N] with a given size. We give explicit asymptotic expressions with constant coefficients determined for a large range of D. We shall also see how this problem connects to a well-known problem about generalized Sidon sets.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.