Cardinalities of $g$-difference sets
Eric Schmutz, Michael Tait

TL;DR
This paper investigates the minimal and maximal sizes of sets in the integers and finite fields that satisfy specific difference properties, establishing the existence of certain limits and asymptotic formulas.
Contribution
It proves the existence of the limit of the normalized minimal size of g-difference bases and derives asymptotic behavior for the maximal size of sets with bounded difference solutions.
Findings
The limit of η_g(n)/√n exists as n→∞.
α_g(n) asymptotically equals √(gn) as n→∞.
Provides new bounds and asymptotic formulas for difference set cardinalities.
Abstract
Let be the smallest cardinality that can have if is a -difference basis for (i.e, if, for each , there are {\em at least} solutions to ). We prove that the finite, non-zero limit exists, answering a question of Kravitz. We also investigate a similar problem in the setting of a vector space over a finite field. Let be the largest cardinality that can have if, for all nonzero , has {\em at most} solutions. We also prove that as .
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
Topicsgraph theory and CDMA systems
