Related papers: Decomposition method related to saturated hyperbal…
In previous work a probabilistic approach to controlling difficulties of density in hyperbolic space led to a workable notion of optimal density for packings of bodies. In this paper we extend an ergodic theorem of Nevo to provide an…
The Delaunay tessellation of a locally finite subset of hyperbolic space is constructed using convex hulls in Euclidean space of one higher dimension. For finite and lattice-invariant sets it is proven to be a polyhedral decomposition, and…
A three-dimensional orthoscheme is defined as a tetrahedron whose base is a right-angled triangle and an edge joining the apex and a non-right-angled vertex is perpendicular to the base. A generalization, called complete orthoschemes, of…
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…
Let X be a space of constant curvature and P be a convex polyhedron in X. A Coxeter decomposition of the polyhedron P is a decomposition of P into finitely many Coxeter polyhedra, such that any two polyhedra having a common facet are…
We study of the relation between the geometry of sets in complex hyperbolic space and Hilbert spaces with complete Pick kernels. We focus on the geometry associated with assembling sets into larger sets and of assembling Hilbert spaces into…
It is conjectured that every cusped hyperbolic 3-manifold has a decomposition into positive volume ideal hyperbolic tetrahedra (a "geometric" triangulation of the manifold). Under a mild homology assumption on the manifold we construct…
Packing spheres efficiently in large dimension $d$ is a particularly difficult optimization problem. In this paper we add an isotropic interaction potential to the pure hard-core repulsion, and show that one can tune it in order to maximize…
Superballs represent a class of particles whose shapes are defined by ${|x|}^{2p}+{|y|}^{2p}+{|z|}^{2p} \le R^{2p}$, with $p\in(0,\infty)$ being the "deformation parameter". $0<p<0.5$ represents a family of hexapodlike (concave…
Dense polyhedron packings are useful models of a variety of condensed matter and biological systems and have intrigued scientists mathematicians for centuries. Recently, organizing principles for the types of structures associated with the…
In this paper we obtain new upper bounds on volumes of right-angled polyhedra in hyperbolic space $\mathbb{H}^3$ in three different cases: for ideal polyhedra with all vertices on the ideal hyperbolic boundary, for compact polytopes with…
In this paper we construct a new family of lattice packings for superballs in three dimensions (unit balls for the $l^p_3$ norm) with $p \in (1, 1.58]$. We conjecture that the family also exists for $p \in (1.58, \log_2 3 =…
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 present a new numerical scheme to study systems of non-convex, irregular, and punctured particles in an efficient manner. We employ this method to analyze regular packings of odd-shaped bodies, not only from a nanoparticle but also both…
Define the superball with radius $r$ and center ${\boldsymbol 0}$ in $\mathbb{R}^n$ to be the set $$ \left\{{\boldsymbol x}\in\mathbb{R}^n:\sum_{j=1}^{m}\left(x_{k_j+1}^2+x_{k_j+2}^2+\cdots+x_{k_{j+1}}^2\right)^{p/2}\leq…
We introduce a new method to reconstruct 3D objects using a set of volumetric primitives, i.e., superquadrics. The method hierarchically decomposes a target 3D object into pairs of superquadrics recovering finer and finer details. While…
Coxeter decompositions of hyperbolic simplices where studied in math.MG/0212010 and math.MG/0210067. In this paper we use the methods of these works to classify Coxeter decompositions of bounded convex pyramids and triangular prisms in the…
We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…
We study translative arrangements of centrally symmetric convex domains in the plane (resp., of congruent balls in the Euclidean $3$-space) that neither pack nor cover. We define their soft density depending on a soft parameter and prove…
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…