Related papers: On a strong version of the Kepler conjecture

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…

The ball (or sphere) packing problem with equal balls, without any symmetry assumption, in a $3$-dimensional space of constant curvature was settled by B\"or\"oczky and Florian for the hyperbolic space $\HYP$ in \cite{BF64} and by proving…

Let $p$ be a positive number. Consider probability measure $\gamma_p$ with density $\varphi_p(y)=c_{n,p}e^{-\frac{|y|^p}{p}}$. We show that the maximal surface area of a convex body in $\mathbb{R}^n$ with respect to $\gamma_p$ is…

A very fundamental geometric problem on finite systems of spheres was independently phrased by Kneser (1955) and Poulsen (1954). According to their well-known conjecture if a finite set of balls in Euclidean space is repositioned so that…

This paper views the honeycomb conjecture and the Kepler problem essentially as extreme value problems and solves them by partitioning 2-space and 3-space into building blocks and determining those blocks that have the universal extreme…

Methodology is provided towards the solution of the minimum enclosing ball problem. This problem concerns the determination of the unique spherical surface of smallest radius enclosing a given bounded set in the d-dimensional Euclidean…

We study periodic tessellations of the Euclidean space with unequal cells arising from the minimization of perimeter functionals. Existence results and qualitative properties of minimizers are discussed for different classes of problems,…

We describe local similarities and global differences between minimal surfaces in Euclidean 3-space and constant mean curvature 1 surfaces in hyperbolic 3-space. We also describe how to solve global period problems for constant mean…

In this paper, we provide a lower bound for an area of the convex hull of points and a rectangle in a plane. We then apply this estimate to establish a lower bound for a universal cover problem. We showed that a convex universal cover for a…

In this paper we prove a theorem that provides an upper bound for the density of packings of congruent copies of a given convex body in $\mathbb{R}^n$; this theorem is a generalization of the linear programming bound for sphere packings. We…

The Kepler conjecture asserts that the density of a packing of congruent balls in three dimensions is never greater than $\pi/\sqrt{18}$. A computer assisted verification confirmed this conjecture in 1998. This article gives a historical…

Theoretical background is provided towards the mathematical foundation of the minimum enclosing ball problem. This problem concerns the determination of the unique spherical surface of smallest radius enclosing a given bounded set in the…

We prove that if a topological sphere smoothly embedded into $\mathbb{R}^3$ with normal curvatures absolutely bounded by $1$ is contained in an open ball of radius $2$, then the region it bounds must contain a unit ball. This result…

In this paper, we study the problem of hyperball (hypersphere) packings in $n$-dimensional hyperbolic space ($n \ge 4$). We prove that to each $n$-dimensional congruent saturated hyperball packing, there is an algorithm to obtain a…

We begin by studying the surface area of an ellipsoid in n-dimensional Euclidean space as the function of the lengths of the semi-axes. We write down an explicit formula as an integral over the unit sphere in n-dimensions and use this…

This article is concerned with the problem of placing seven or eight points on the unit sphere $\mathbb{S}^2$ in $\mathbb{R}^3$ so that the surface area of the convex hull of the points is maximized. In each case, the solution is given for…

Cooper and Long generalised Epstein and Penner's Euclidean cell decomposition of cusped hyperbolic manifolds of finite volume to non-compact strictly convex projective manifolds of finite volume. We show that Weeks' algorithm to compute…

An earlier paper describes a program to prove the Kepler conjecture on sphere packings. This paper carries out the second step of that program. A sphere packing leads to a decomposition of $R^3$ into polyhedra. The polyhedra are divided…

We study a long standing open problem by Ulam, which is whether the Euclidean ball is the unique body of uniform density which will float in equilibrium in any direction. We answer this problem in the class of origin symmetric n-dimensional…

Continuing the investigations of Harborth (1974) and the author (2002) we study the following two rather basic problems on sphere packings. Recall that the contact graph of an arbitrary finite packing of unit balls (i.e., of an arbitrary…