Quick asymptotic upper bounds for lattice kissing numbers (Q4817664)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 2100946
Language Label Description Also known as
default for all languages
No label defined
    English
    Quick asymptotic upper bounds for lattice kissing numbers
    scientific article; zbMATH DE number 2100946

      Statements

      Quick asymptotic upper bounds for lattice kissing numbers (English)
      0 references
      0 references
      15 September 2004
      0 references
      kissing number
      0 references
      lattices
      0 references
      Mellin transform
      0 references
      The kissing number problem asks for the maximum number \(\tau_n\) of non-overlapping \(n\)-dimensional unit spheres touching another given unit sphere. The precise values of \(\tau_n\) are only known in dimensions \(2,3,8,24\), and by a recent result of Oleg Musin we also know \(\tau_4=24\). For large \(n\) the best upper bound is due to Kabatjansky-Levenštein: \(\tau_n\leq (1.3204...)^{n+o(1)}\). In the paper under review the author studies \(\lambda_n\), the maximum kissing number with respect to lattice arrangements. He proves the bound \(\lambda_n\leq (1.3592)^{n+o(1)}\), which is worse than the bound implied by the Kabatjansky-Levenštein bound, but the proof is rather short. Moreover, his method which is based on some new inequalities for Mellin transforms could have some potential for improvements.
      0 references

      Identifiers