Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Kissing number in non-Euclidean spaces of constant sectional curvature
HTML articles powered by AMS MathViewer

by Maria Dostert and Alexander Kolpakov HTML | PDF
Math. Comp. 90 (2021), 2507-2525

Abstract:

This paper provides upper and lower bounds on the kissing number of congruent radius $r > 0$ spheres in hyperbolic $\mathbb {H}^n$ and spherical $\mathbb {S}^n$ spaces, for $n\geq 2$. For that purpose, the kissing number is replaced by the kissing function $\kappa _H(n, r)$, resp. $\kappa _S(n, r)$, which depends on the dimension $n$ and the radius $r$.

After we obtain some theoretical upper and lower bounds for $\kappa _H(n, r)$, we study their asymptotic behaviour and show, in particular, that $\kappa _H(n,r) \sim (n-1) \cdot d_{n-1} \cdot B(\frac {n-1}{2}, \frac {1}{2}) \cdot e^{(n-1) r}$, where $d_n$ is the sphere packing density in $\mathbb {R}^n$, and $B$ is the beta-function. Then we produce numeric upper bounds by solving a suitable semidefinite program, as well as lower bounds coming from concrete spherical codes. A similar approach allows us to locate the values of $\kappa _S(n, r)$, for $n= 3, 4$, over subintervals in $[0, \pi ]$ with relatively high accuracy.

References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (2020): 05B40, 52C17, 51M09
  • Retrieve articles in all journals with MSC (2020): 05B40, 52C17, 51M09
Additional Information
  • Maria Dostert
  • Affiliation: Department of Mathematics, Royal Institute of Technology (KTH), SE-100 44 Stockholm, Sweden
  • MR Author ID: 1165370
  • ORCID: 0000-0002-0393-8286
  • Email: dostert@kth.se
  • Alexander Kolpakov
  • Affiliation: Institut de Mathématiques, Université de Neuchâtel, 2000 Neuchâtel, Suisse/ Switzerland; and Laboratory of combinatorial and geometric structures, Moscow Institute of Physics and Technology, Dolgoprudny, Russia
  • MR Author ID: 774696
  • Email: kolpakov.alexander@gmail.com
  • Received by editor(s): April 11, 2020
  • Received by editor(s) in revised form: October 9, 2020, and November 23, 2020
  • Published electronically: April 13, 2021
  • Additional Notes: The first author was partially supported by the Wallenberg AI, Autonomous Systems and Software Program (WASP) funded by the Knut and Alice Wallenberg Foundation. The second author was partially supported by the Swiss National Science Foundation (project no. PP00P2-170560) and the Russian Federation Government (grant no. 075-15-2019-1926).
  • © Copyright 2021 by the authors
  • Journal: Math. Comp. 90 (2021), 2507-2525
  • MSC (2020): Primary 05B40; Secondary 52C17, 51M09
  • DOI: https://doi.org/10.1090/mcom/3622
  • MathSciNet review: 4280309