Kissing number in non-Euclidean spaces of constant sectional curvature

DOI10.1090/mcom/3622zbMath1467.52027arXiv2003.05547OpenAlexW3107521815WikidataQ114094316 ScholiaQ114094316MaRDI QIDQ4999491

No author found.

Publication date: 7 July 2021

Published in: Mathematics of Computation (Search for Journal in Brave)

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

zbMATH Keywords

semidefinite programmingspherical geometryhyperbolic geometrykissing number

Mathematics Subject Classification ID

Semidefinite programming (90C22) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of packing and covering (05B40) Elementary problems in hyperbolic and elliptic geometries (51M09)

Uses Software

• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Contact numbers for congruent sphere packings in Euclidean 3-space
• Geodesic ball packings in \(S^{2} \times R\) space for generalized Coxeter space groups
• Towards a proof of the 24-cell conjecture
• Finite point-sets on S 2 with minimum distance as large as possible
• Spherical codes and designs
• New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
• On kissing numbers and spherical codes in high dimensions
• Contact graphs of unit sphere packings revisited
• Contact graphs of ball packings
• Horoball packings to the totally asymptotic regular simplex in the hyperbolic \(n\)-space
• The densest geodesic ball packing by a type of Nil lattices
• The kissing number in four dimensions
• Über eine Abschätzung des kürzesten Abstandes zweier Punkte eines auf einer Kugelfläche liegenden Punktsystems
• Das Problem der dreizehn Kugeln
• Foundations of Hyperbolic Manifolds
• New upper bounds for kissing numbers from semidefinite programming
• High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
• Packing of spheres in spaces of constant curvature
• Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry
• Exact Semidefinite Programming Bounds for Packing Problems
• Über die dichteste Horozyklenlagerung

This page was built for publication: Kissing number in non-Euclidean spaces of constant sectional curvature