Improved Bounds on Sidon Sets via Lattice Packings of Simplices

DOI10.1137/16M1099182zbMath1384.11017arXiv1610.01341OpenAlexW3099610956MaRDI QIDQ5371016

Vincent Y. F. Tan, Mladen Kovačević

Publication date: 24 October 2017

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.01341

zbMATH Keywords

simplexlattice packingpacking densitylattice coveringSidon setadditive basis\(h\)-basis\( B_h \) set

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Special sequences and polynomials (11B83) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Lattice packing and covering (number-theoretic aspects) (11H31) Additive bases, including sumsets (11B13) Combinatorial aspects of packing and covering (05B40) Abelian groups (20K99)

Related Items

Sidon sets for linear forms, Lattice packings of cross‐polytopes from Reed–Solomon codes and Sidon sets, No cubic integer polynomial generates a Sidon sequence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theorems in the additive theory of numbers
• On lattice coverings by simplices
• On finite Sidon sequences
• Continuity properties of Voronoi domains
• A complete annotated bibliography of work related to Sidon sequences
• Packings of<tex>R^n</tex>by certain error spheres
• Error-Correcting Codes and<tex>$B_h$</tex>-Sequences
• On the Size of Finite Sidon Sequences
• Convex and Discrete Geometry
• Perfect Codes in the Lee Metric and the Packing of Polyominoes
• The densest lattice packing of tetrahedra
• Introduction to Coding Theory