On the tightest packing of sums of vectors

DOI10.1016/S0195-6698(83)80017-1zbMath0525.05016OpenAlexW2062661325MaRDI QIDQ594101

Jerrold R. Griggs, Jeffrey C. Lagarias, Andrew M. Odlyzko, James B. Shearer

Publication date: 1983

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0195-6698(83)80017-1

zbMATH Keywords

collection of vectorspacking of vector-sums

Mathematics Subject Classification ID

Combinatorial probability (60C05) Combinatorial aspects of packing and covering (05B40)

Related Items

The Littlewood-Offord problem in high dimensions and a conjecture of Frankl and Füredi, From the Littlewood-Offord problem to the Circular Law: Universality of the spectral distribution of random matrices, A sharp inverse Littlewood-Offord theorem

Cites Work

• Unnamed Item
• Unnamed Item
• The Littlewood-Offord problem: Tightest packing and an M-part Sperner theorem
• Some new results on the Littlewood-Offord problem
• Spherical codes and designs
• A note on coverings
• On a lemma of Littlewood and Offord