Pith. sign in

REVIEW 1 cited by

The kissing number in four dimensions

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv math/0309430 v3 pith:UPYF5XYK submitted 2003-09-26 math.MG

Oleg R. Musin This is my paper · ORCID
classification math.MG
keywords numberproblemdimensionskissingfoursizethreeanother
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The kissing number problem asks for the maximal number k(n) of equal size nonoverlapping spheres in n-dimensional space that can touch another sphere of the same size. This problem in dimension three was the subject of a famous discussion between Isaac Newton and David Gregory in 1694. In three dimensions the problem was finally solved only in 1953 by Sch\"utte and van der Waerden. In this paper we present a solution of a long-standing problem about the kissing number in four dimensions. Namely, the equality k(4)=24 is proved. The proof is based on a modification of Delsarte's method.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Variations on five-dimensional sphere packings

    math.MG 2024-12 accept novelty 7.0 of 10

    New non-isometric kissing configurations are constructed in dimensions 5 and 9, and the uniform 5D packings containing the known kissing configurations are classified.

Pith tools