相关论文: On the maximum size packings of disks with kissing…
In 1969, Fejes Toth conjectured that in Euclidean 3-space any packing of equal balls such that each ball is touched by twelve others consists of hexagonal layers. This article verifies this conjecture.
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 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…
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…
Let H be a closed half-space of n-dimensional Euclidean space. Suppose S is a unit sphere in H that touches the supporting hyperplane of H. The one-sided kissing number B(n) is the maximal number of unit nonoverlapping spheres in H that can…
The average kissing number of $\mathbb{R}^n$ is the supremum of the average degrees of contact graphs of packings of finitely many balls (of any radii) in $\mathbb{R}^n$. We provide an upper bound for the average kissing number based on…
In 1694, Gregory and Newton proposed the problem to determine the kissing number of a rigid material ball. This problem and its higher dimensional generalization have been studied by many mathematicians, including Minkowski, van der…
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…
Suppose one has a collection of disks of various sizes with disjoint interiors, a packing in the plane, and suppose the ratio of the smallest radius divided by the largest radius lies between $1$ and $q$. In his 1964 book Regular Figures…
In 1694, Gregory and Newton discussed the problem to determine the kissing number of a rigid material ball. This problem and its higher dimensional generalization have been studied by many mathematicians, including Minkowski, van der…
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…
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…
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 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…
A family of spherical caps of the 2-dimensional unit sphere $\mathbb{S}^2$ is called a totally separable packing in short, a TS-packing if any two spherical caps can be separated by a great circle which is disjoint from the interior of each…
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…
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.
John E. Littlewood posted the question {\em ``Is it possible in 3-space for seven infinite circular cylinders of unit radius each to touch all the others? Seven is the number suggested by counting constants.''} Boz\'oki, Lee, and R\'onyai…
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…
We prove that the kissing numbers in 17, 18, 19, 20, and 21 dimensions are at least 5730, 7654, 11692, 19448, and 29768, respectively. The previous records were set by Leech in 1967, and we improve on them by 384, 256, 1024, 2048, and 2048.…