Improved Bounds on Sidon Sets via Lattice Packings of Simplices
Combinatorics
2020-08-13 v5 Computational Geometry
Information Theory
Group Theory
math.IT
Number Theory
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 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.
Cite
@article{arxiv.1610.01341,
title = {Improved Bounds on Sidon Sets via Lattice Packings of Simplices},
author = {Mladen Kovačević and Vincent Y. F. Tan},
journal= {arXiv preprint arXiv:1610.01341},
year = {2020}
}
Comments
9 pages, 2 figures