Related papers: The one-sided kissing number in four dimensions
How many unit $n-$dimensional spheres can simultaneously touch or kiss a central $n-$dimensional unit sphere? Beyond mathematics this question has implications for fields such as cryptography and the structure of biologic and chemical…
The maximum possible number of non-overlapping unit spheres that can touch a unit sphere in $n$ dimensions is called kissing number. The problem for finding kissing numbers is closely connected to the more general problems of finding bounds…
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…
The kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit spheres which simultaneously can touch a central unit sphere. Bachoc and Vallentin developed a method to find upper bounds for the kissing…
The kissing number $\tau(d)$ is the maximum number of pairwise non-overlapping unit spheres each touching a central unit sphere in the $d$-dimensional Euclidean space. In this note we report on how we discovered a new, previously unknown…
The kissing number of $\mathbb{R}^n$ is the maximum number of pairwise-nonoverlapping unit spheres that can simultaneously touch a central unit sphere. Mittelmann and Vallentin (2010), based on the semidefinite programming bound of Bachoc…
Let the kissing number $K(d)$ be the maximum number of non-overlapping unit balls in $\mathbb R^d$ that can touch a given unit ball. Determining or estimating the number $K(d)$ has a long history, with the value of $K(3)$ being the subject…
Recently A. Schrijver derived new upper bounds for binary codes using semidefinite programming. In this paper we adapt this approach to codes on the unit sphere and we compute new upper bounds for the kissing number in several dimensions.…
The kissing number k(3) is the maximal number of equal size nonoverlapping spheres in three dimensions that can touch another sphere of the same size. This number was the subject of a famous discussion between Isaac Newton and David Gregory…
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…
The so-called {\it kissing number} for hyperbolic surfaces is the maximum number of homotopically distinct systoles a surface of given genus $g$ can have. These numbers, first studied (and named) by Schmutz Schaller by analogy with lattice…
Contact numbers are natural extensions of kissing numbers. In this paper we give estimates for the number of contacts in a totally separable packing of n unit balls in Euclidean d-space for all n>1 and d>1.
We study the number and the length of systoles on complete finite area orientable hyperbolic surfaces. In particular, we prove upper bounds on the number of systoles that a surface can have (the so-called kissing number for hyperbolic…
A new upper bound $\kappa_T(K_n)\leq 2.9162^{(1+o(1))n}$ for the translative kissing number of the $n$-dimensional cross-polytope $K_n$ is proved, improving on Hadwiger's bound $\kappa_T(K_n)\leq 3^n-1$ from 1957. Furthermore, it is shown…
We prove that the kissing number in 19 dimensions is at least 11948, improving the bound of Cohn and Li by 256. By the odd-sign construction of Cohn and Li, it is enough to find a binary code of length 19 and minimum distance 5 inside the…
We prove that the kissing number in 48 dimensions among antipodal spherical codes with certain forbidden inner products is 52\,416\,000. Constructions of attaining codes as kissing configurations of minimum vectors in even unimodular…
L\'{a}szl\'{o} Fejes T\'{o}th and Alad\'{a}r Heppes proposed the following generalization of the kissing number problem. Given a ball in $\mathbb{R}^d$, consider a family of balls touching it, and another family of balls touching the first…
This paper provides upper and lower bounds on the kissing number of congruent radius $r > 0$ spheres in $\mathbb{H}^n$, for $n\geq 2$. For that purpose, the kissing number is replaced by the kissing function $\kappa(n, r)$ which depends on…
In this paper, we give some new lower bounds for the kissing number of $\ell_p$-spheres. These results improve the previous work due to Xu (2007). Our method is based on coding theory.
The Koebe circle packing theorem states that every finite planar graph can be realized as the nerve of a packing of (non-congruent) circles in R^3. We investigate the average kissing number of finite packings of non-congruent spheres in R^3…