Papers
Topics
Authors
Recent
Search
2000 character limit reached

Improved Bounds on Sidon Sets via Lattice Packings of Simplices

Published 5 Oct 2016 in math.CO, cs.CG, cs.IT, math.GR, math.IT, and math.NT | (1610.01341v5)

Abstract: A $ B_h $ set (or Sidon set of order $ h $) in an Abelian group $ G $ is any subset $ {b_0, b_1, \ldots,b_{n}} $ of $ G $ with the property that all the sums $ b_{i_1} + \cdots + b_{i_h} $ are different up to the order of the summands. Let $ \phi(h,n) $ denote the order of the smallest Abelian group containing a $ B_h $ set of cardinality $ n + 1 $. It is shown that [ \lim_{h \to \infty} \frac{ \phi(h,n) }{ hn } = \frac{1}{n! \delta_L(\trianglen)} , ] where $ \delta_L(\trianglen) $ is the lattice packing density of an $ n $-simplex in Euclidean space. This determines the asymptotics exactly in cases where this density is known ($ n \leq 3 $) and gives improved bounds on $ \phi(h,n) $ in the remaining cases. The corresponding geometric characterization of bases of order $ h $ in finite Abelian groups in terms of lattice coverings by simplices is also given.

Citations (12)

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.