Improved Bounds on Sidon Sets via Lattice Packings of Simplices
Mladen Kova\v{c}evi\'c, Vincent Y. F. Tan

TL;DR
This paper establishes precise asymptotic bounds for Sidon sets in Abelian groups by linking their properties to lattice packings of simplices, improving known bounds and providing geometric characterizations.
Contribution
It introduces a novel connection between Sidon sets and lattice packings of simplices, leading to exact asymptotic formulas and improved bounds for the minimal group order containing such sets.
Findings
Exact asymptotic formula for (h,n) as h
Improved bounds on (h,n) for cases where lattice packing density is unknown
Geometric characterization of bases of order h via lattice coverings
Abstract
A set (or Sidon set of order ) in an Abelian group is any subset of with the property that all the sums are different up to the order of the summands. Let denote the order of the smallest Abelian group containing a set of cardinality . It is shown that \[ \lim_{h \to \infty} \frac{ \phi(h,n) }{ h^n } = \frac{1}{n! \delta_L(\triangle^n)} , \] where is the lattice packing density of an -simplex in Euclidean space. This determines the asymptotics exactly in cases where this density is known () and gives improved bounds on in the remaining cases. The corresponding geometric characterization of bases of order in finite Abelian groups in terms of lattice coverings by simplices is also given.
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.
