Related papers: A Densest ternary circle packing in the plane
The problem that we consider is the following: given an $n \times n$ array $A$ of positive numbers, find a tiling using at most $p$ rectangles (which means that each array element must be covered by some rectangle and no two rectangles must…
We determine putative optimal packings of regular spherical polygons via optimization on smooth manifolds. For several cases, we establish maximality by extending the Lov\'asz theta number to Cayley graphs on the special orthogonal group…
Apollonian circle packings arise by repeatedly filling the interstices between mutually tangent circles with further tangent circles. In Euclidean space it is possible for every circle in such a packing to have integer radius of curvature,…
We consider three-dimensional clusters of identical bubbles packed around a central bubble and calculate their energy and optimal shape. We obtain the surface area and bubble pressures to improve on existing growth laws for…
We investigate the packing and covering densities of linear and nonlinear binary codes, and establish a number of duality relationships between the packing and covering problems. Specifically, we prove that if almost all codes (in the class…
Given a finite simple triangulation, we estimate the sizes of circles in its circle packing in terms of Cannon's vertex extremal length. Our estimates provide control over the size of the largest circle in the packing. We use them, combined…
A packing of disks in the plane is a set of disks with disjoint interiors. This paper is a survey of some open questions about such packings. It is organized into five themes: compacity, conjugacy, density, uniformity and computability.
Given an Apollonian Circle Packing $\mathcal{P}$ and a circle $C_0 = \partial B(z_0, r_0)$ in $\mathcal{P}$, color the set of disks in $\mathcal{P}$ tangent to $C_0$ red. What proportion of the concentric circle $C_{\epsilon} = \partial…
Monodisperse circular disks have been collectively packed in confined geometries using a Monte Carlo method where the compaction is propelled by two- dimensional stochastic agitation. We have found that confinement (i.e., finite-size plus…
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 obtain an asymptotic formula for the number of circles of curvature at most T in any given bounded Apollonian circle packing. For an integral packing, we obtain the upper bounds for the number of circles with prime curvature as well as…
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$…
We describe a new numerical procedure for generating dense packings of disks and spheres inside various geometric shapes. We believe that in some of the smaller cases, these packings are in fact optimal. When applied to the previously…
We studied the geometrical and topological rules underlying the dispositions and the size distribution of non-overlapping, polydisperse circle-packings. We found that the size distribution of circles that densely cover a plane follows the…
This paper deals with the problem of circle packing, in which the largest radii circle is to be fit in a confined space filled with arbitrary circles of different radii and centers. A circle packing problem is one of a variety of cutting…
We investigate the morphologies and maximum packing density of thin wires packed into spherical cavities. Using simulations and experiments, we find that ordered as well as disordered structures emerge, depending on the amount of internal…
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…
Inspired by a question of Sarnak, we introduce the notion of a prime component in an Apollonian circle packing: a maximal tangency-connected subset having all prime curvatures. We also consider thickened prime components, which are…
Packings of hard polyhedra have been studied for centuries due to their mathematical aesthetic and more recently for their applications in fields such as nanoscience, granular and colloidal matter, and biology. In all these fields, particle…
In a projective plane $\Pi _{q}$ (not necessarily Desarguesian) of order $q,$ a point subset $S$ is saturating (or dense) if any point of $\Pi _{q}\setminus S$ is collinear with two points in$~S$. Using probabilistic methods, the following…