A short solution of the kissing number problem in dimension three

DOI10.1007/s00454-021-00311-6OpenAlexW3115540150MaRDI QIDQ2689252

Alexey Glazyrin

Publication date: 9 March 2023

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

linear programming boundssphere packingkissing number problem

Mathematics Subject Classification ID

Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Interpolation in approximation theory (41A05) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Spherical harmonics (33C55) Combinatorial aspects of packing and covering (05B40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spherical codes and designs
• New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
• The thirteen spheres: a new proof
• The problem of thirteen spheres -- a proof for undergraduates
• The kissing number in four dimensions
• The kissing problem in three dimensions
• Improved Delsarte bounds for spherical codes in small dimensions
• Das Problem der dreizehn Kugeln
• The Problem of the Thirteen Spheres

This page was built for publication: A short solution of the kissing number problem in dimension three