Related papers: Calculating the sequences behind a hexagonal latti…
The densest local packing (DLP) problem in d-dimensional Euclidean space Rd involves the placement of N nonoverlapping spheres of unit diameter near an additional fixed unit-diameter sphere such that the greatest distance from the center of…
A Euclidean (or hyperbolic) circle packing on a closed triangulated surface with prescribed inversive distance is locally determined by its cone angles. We prove this by applying a variational principle.
We produce an explicit parameterization of well-rounded sublattices of the hexagonal lattice in the plane, splitting them into similarity classes. We use this parameterization to study the number, the greatest minimal norm, and the highest…
In this paper we define the notion of infinite or bounded fibre-like geodesic cylinder in $\widetilde{\mathbf{S}\mathbf{L}_2\mathbf{R}}$ space, develop a method to determine its volume and total surface area. We prove that the common part…
We provide the first known upper bounds for the packing dimension of weighted singular and weighted $\omega$-singular matrices. We also prove upper bounds for these sets when intersected with fractal subsets. The latter results, even in the…
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…
Peter Doyle conjectured that locally univalent circle packings on the hexagonal lattice only consist of regular hexagonal packings and Doyle spirals, which is called the Doyle conjecture. In this paper, we prove a rigidity theorem for Doyle…
We prove explicit stability estimates for the sphere packing problem in dimensions 8 and 24, showing that, in the lattice case, if a lattice is $\sim \varepsilon$ close to satisfying the optimal density, then it is, in a suitable sense,…
Fully packed loop models describe the statistics of closely packed nested polygons on the square lattice. Many exact results can be obtained for these models, even for finite geometries, using their close relationship to alternating-sign…
A two-dimensional granular packing under horizontally circular shaking exhibits various collective motion modes depending on the strength of the oscillation and the global packing density. For intermediate packing density and oscillation…
We investigate the weakening of elastic materials through randomly distributed circles and cracks numerically and compare the results to predictions from homogenization theories. We find a good agreement for the case of randomly oriented…
In this note, we show that the half-plane capacity of a subset of the upper half-plane is comparable to a simple geometric quantity, namely the euclidean area of the hyperbolic neighborhood of radius one of this set. This is achieved by…
We review results about the density of typical lattices in $R^n.$ They state that such density is of the order of $2^{-n}.$ We then obtain similar results for random packings in $R^n$: after taking suitably a fraction $\nu$ of a typical…
We define three-point bounds for sphere packing that refine the linear programming bound, and we compute these bounds numerically using semidefinite programming by choosing a truncation radius for the three-point function. As a result, we…
With the help of a simple 20 letters, lattice model of heteropolymers, we investigate the energy landscape in the space of designed good-folder sequences. Low-energy sequences form clusters, interconnected via neutral networks, in the space…
Superellipse sector particles (SeSPs) are segments of superelliptical curves that form a tunable set of hard-particle shapes for granular and colloidal systems. SeSPs allow for continuous parameterization of corner sharpness, aspect ratio,…
Bead packs of up to 150,000 mono-sized spheres with packing densities ranging from 0.58 to 0.64 have been studied by means of X-ray Computed Tomography. These studies represent the largest and the most accurate description of the structure…
Several conditions are given when a packing of equal disks in a torus is locally maximally dense, where the torus is defined as the quotient of the plane by a two-dimensional lattice. Conjectures are presented that claim that the density of…
A hexagonal patch is a plane graph in which inner faces have length 6, inner vertices have degree 3, and boundary vertices have degree 2 or 3. We consider the following counting problem: given a sequence of twos and threes, how many…
By rectangle packing we mean putting a set of rectangles into an enclosing rectangle, without any overlapping. We begin with perfect rectangle packing problems, then prove two continuity properties for parallel rectangle packing problems,…