Related papers: Densest local sphere-packing diversity: General co…

As far as entanglement is concerned, two density matrices of $n$ particles are equivalent if they are on the same orbit of the group of local unitary transformations, $U(d_1)\times...\times U(d_n)$ (where the Hilbert space of particle $r$…

We derive fundamental asymptotic results for the expected covering radius $\rho(X_N)$ for $N$ points that are randomly and independently distributed with respect to surface measure on a sphere as well as on a class of smooth manifolds. For…

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…

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…

Density-based clustering methodology has been widely considered in the statistical literature for classifying Euclidean observations. However, this approach has not been contemplated for directional data yet. In this work, directional…

Let $\mathcal{P}$ be a packing of circular disks of radius $\rho>0$ in the Euclidean, spherical, or hyperbolic plane. Let $0\leq\lambda\leq\rho$. We say that $\mathcal{P}$ is a $\lambda$-separable packing of circular disks of radius $\rho$…

In this article we investigate the $N$-point min-max and the max-min polarization problems on the sphere for a large class of potentials in $\mathbb{R}^n$. We derive universal lower and upper bounds on the polarization of spherical designs…

We examine sequences of dense packings of n congruent non-overlapping disks inside a square which follow specific patterns as n increases along certain values, n = n(1), n(2),... n(k),.... Extending and improving previous work of Nurmela…

In this paper we study the locally optimal geodesic ball packings with equal balls to the $\mathbf{S}^2\!\times\!\mathbf{R}$ space groups having rotation point groups and their generators are screw motions. We determine and visualize the…

The packing density of the regular cross-polytope in Euclidean $n$-space is unknown except in dimensions $2$ and $4$ where it is 1. The only non-trivial upper bound is due to Gravel, Elser, and Kallus (2011) who proved that for $n=3$ the…

Jammed disordered packings of non-spherical particles show significant variation in the packing density as a function of particle shape for a given packing protocol. Rotationally symmetric elongated shapes such as ellipsoids,…

Packing problems have been a source of fascination for millenia and their study has produced a rich literature that spans numerous disciplines. Investigations of hard-particle packing models have provided basic insights into the structure…

The minimal spherical cap dispersion ${\rm disp}_{\mathcal{C}}(n,d)$ is the largest number $\varepsilon\in (0,1]$ such that, for every $n$ points on the $d$-dimensional Euclidean unit sphere $\mathbb{S}^d$, there exists a spherical cap with…

We present the algorithm for generating strictly saturated random sequential adsorption packings built of rounded polygons. It can be used to study various properties of such packings built of a wide variety of different shapes and in…

In this paper we consider the problem of packing a fixed number of identical circles inside the unit circle container, where the packing is complicated by the presence of fixed size circular prohibited areas. Here the objective is to…

We apply a recent one-dimensional algorithm for predicting random close packing fractions of polydisperse hard spheres [Farr and Groot, J. Chem. Phys. 133, 244104 (2009)] to the case of lognormal distributions of sphere sizes and mixtures…

Various solutions of the kinetic equation for the equilibrium of a gravitating sphere of uniform density with a quadratic gravitational potential and a linear dependence of gravitational force on radius are examined. New analytic solutions…

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…

Previously published packings of equal disks in an equilateral triangle have dealt with up to 21 disks. We use a new discrete-event simulation algorithm to produce packings for up to 34 disks. For each n in the range 22 =< n =< 34 we…

Let $L \subset {\Bbb R}^3$ be the union of unit balls, whose centres lie on the $z$-axis, and are equidistant with distance $2d \in [2, 2\sqrt{2}]$. Then a packing of unit balls in ${\Bbb R}^3$ consisting of translates of $L$ has a density…