Cardinalities of g-difference sets
Abstract
Let ηg(n) be the smallest cardinality that A⊂eq Z can have if A is a g-difference basis for [n] (i.e, if, for each x∈ [n], there are at least g solutions to a1-a2=x ). We prove that the finite, non-zero limit n→ ∞ηg(n)n exists, answering a question of Kravitz. We also investigate a similar problem in the setting of a vector space over a finite field. Let αg(n) be the largest cardinality that A⊂eq [n] can have if, for all nonzero x, a1-a2=x has at most g solutions. We also prove that αg(n)=gn(1+og(1)) as n→∞.
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.