Related papers: Decomposition method and upper bound density relat…
The present work surveys problems in $n$-dimensional space with $n$ large. Early development in the study of packing and covering in high dimensions was motivated by the geometry of numbers. Subsequent results, such as the discovery of the…
We introduce and study certain notions which might serve as substitutes for maximum density packings and minimum density coverings. A body is a compact connected set which is the closure of its interior. A packing $\cal P$ with congruent…
We prove sphere packing density bounds in hyperbolic space (and more generally irreducible symmetric spaces of noncompact type), which were conjectured by Cohn and Zhao and generalize Euclidean bounds by Cohn and Elkies. We work within the…
Supergroups of some hyperbolic space groups are classified as a continuation of our former works. Fundamental domains will be integer parts of truncated tetrahedra belonging to families F1 - F4, for a while, by the notation of E. Moln\'{a}r…
In this article we obtain linear programming bounds for the maximal sphere packing density of commutative spaces. A special case of our results solves a conjecture by Cohn and Zhao on linear programming bounds for sphere packings in…
We present a new lower bound on the Bowen-Radin maximal density of radius-R ball packings in the m-dimensional hyperbolic space, improving on the basic covering bound by factor \Omega(m(R+\ln m)) as m tends to infinity. This is done by…
After having investigated the packings derived by horo- and hyperballs related to simple frustum Coxeter orthoscheme tilings we consider the corresponding covering problems (briefly hyp-hor coverings) in $n$-dimensional hyperbolic spaces…
Four packings of hyperbolic 3-space are known to yield the optimal packing density of $0.85328\dots$. They are realized in the regular tetrahedral and cubic Coxeter honeycombs with Schl\"afli symbols $\{3,3,6 \}$ and $\{4,3,6\}$. These…
This paper provides the currently best known upper bound on the density of a packing in three-dimensional Euclidean space of two types of spheres whose size ratio is the largest one that allows the insertion of a small sphere in each…
The sphere packing problem asks for the densest packing of unit balls in d-dimensional Euclidean space. This problem has its roots in geometry, number theory and it is part of Hilbert's 18th problem. In 1958 C. A. Rogers proved a…
The average distance of the equal hard spheres is introduced to evaluate the density of a given arrangement. The absolute smallest value is two radii because the spheres can not be closer to each other than their diameter. The absolute…
Determining the minimum density of a covering of $\mathbb{R}^{n}$ by Euclidean unit balls as $n\to\infty$ is a major open problem, with the best known results being the lower bound of $\left(\mathrm{e}^{-3/2}+o(1)\right)n$ by Coxeter, Few…
We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds…
Koszul type Coxeter simplex tilings exist in hyperbolic $n$-space $\mathbb{H}^n$ up to $ n = 9$, and their horoball packings achieve the highest known regular ball packing densities for $n = 3, 4, 5$. In this paper we determine the optimal…
In a variety of settings we provide a method for decomposing a 3-manifold $M$ into pieces. When the pieces have the appropriate type of hyperbolicity, then the manifold $M$ is hyperbolic and its volume is bounded below by the sum of the…
The problem of packing a system of particles as densely as possible is foundational in the field of discrete geometry and is a powerful model in the material and biological sciences. As packing problems retreat from the reach of solution by…
The sphere packing problem asks for the greatest density of a packing of congruent balls in Euclidean space. The current best upper bound in all sufficiently high dimensions is due to Kabatiansky and Levenshtein in 1978. We revisit their…
We consider a volume maximization program to construct hyperbolic structures on triangulated 3-manifolds, for which previous progress has lead to consider angle assignments which do not correspond to a hyperbolic metric on each simplex. We…
We generate non-lattice packings of spheres in up to 22 dimensions using the geometrical constraint satisfaction algorithm RRR. Our aggregated data suggest that it is easy to double the density of Ball's lower bound, and more tentatively,…
Using graph-theoretic methods we give a new proof that for all sufficiently large $n$, there exist sphere packings in $\R^n$ of density at least $cn2^{-n}$, exceeding the classical Minkowski bound by a factor linear in $n$. This matches up…