The kissing number in 48 dimensions for codes with certain forbidden distances is 52 416 000

DOI10.1007/S00025-024-02322-0MaRDI QIDQ6655413zbMATH OpenFDO

Authors Peter Boyvalenkov, Danila Cherkashin

Publication date 23 December 2024

Published in Results in Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00025-024-02322-0

Mathematics Subject Classification ID

Other designs, configurations (05B30) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Mathematical programming (90Cxx) Theory of error-correcting codes and error-detecting codes (94Bxx)

Cites work

• A fourth extremal even unimodular lattice of dimension 48
• A numerical study of Siegel theta series of various degrees for the 48-dimensional even unimodular extremal lattices
• A survey on spherical designs and algebraic combinatorics on spheres
• A survey on the kissing numbers.
• Computing distance distributions of spherical designs
• Discrete energy on rectifiable sets
• Extremal polynomials for obtaining bounds for spherical codes and designs
• scientific article; zbMATH DE number 3865377 (Why is no real title available?)
• scientific article; zbMATH DE number 3680654 (Why is no real title available?)
• scientific article; zbMATH DE number 3633251 (Why is no real title available?)
• scientific article; zbMATH DE number 1224949 (Why is no real title available?)
• scientific article; zbMATH DE number 1284419 (Why is no real title available?)
• Lower bounds for spherical designs
• Necessary conditions for existence of some designs in polynomial metric spaces
• New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
• New upper bounds for kissing numbers from semidefinite programming
• On upper bounds for code distance and covering radius of designs in polynomial metric spaces
• Positive definite functions on spheres
• Solving clustered low-rank semidefinite programs arising from polynomial optimization
• Spherical codes and designs
• The kissing number in four dimensions
• The sphere packing problem in dimension \(24\)
• The sphere packing problem in dimension 8

Cited in

(1)

• Sphere packings in Euclidean space with forbidden distances

This page was built for publication: The kissing number in 48 dimensions for codes with certain forbidden distances is 52 416 000

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6655413)