Related papers: Revisiting the hexagonal lattice: on optimal latti…

We consider $O(1)$ dense loop model in a square lattice wrapped on a cylinder of odd circumference $L$ and calculate the exact densities of loops. These densities of loops are equal to the densities of critical bond percolation clusters on…

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…

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 prove that in any dimension $n$ there exists an origin-symmetric ellipsoid ${\mathcal{E}} \subset {\mathbb{R}}^n$ of volume $ c n^2 $ that contains no points of ${\mathbb{Z}}^n$ other than the origin, where $c > 0$ is a universal…

This paper introduces a technique for proving the local optimality of packing configurations. Applying this technique to a general convex polygon, we prove that the construction of the optimal double lattice packing by Kuperberg and…

We investigate lattice energies for radially symmetric, spatially extended particles interacting via a radial potential and arranged on the sites of a two-dimensional Bravais lattice. We show the global minimality of the triangular lattice…

We provide, for any $r\in (0,1)$, lower and upper bounds on the maximal density of a packing in the Euclidean plane of discs of radius $1$ and $r$. The lower bounds are mostly folk, but the upper bounds improve the best previously known…

The famous Kepler conjecture has a less spectacular, two-dimensional equivalent: The theorem of Thue states that the densest circle packing in the Euclidean plane has a hexagonal structure. A common proof uses Voronoi cells and analyzes…

We develop a simple analytical theory that relates dense sphere packings in a cylinder to corresponding disk packings on its surface. It applies for ratios R=D/d (where d and D are the diameters of the hard spheres and the bounding…

Two constructions of lattice packings of $ n $-dimensional cross-polytopes ($ \ell_1 $ balls) are described, the density of which exceeds that of any prior construction by a factor of at least $ 2^{\frac{n}{\ln n}(1 + o(1))} $ when $ n \to…

We present an efficient Monte Carlo method for the lattice sphere packing problem in d dimensions. We use this method to numerically discover de novo the densest lattice sphere packing in dimensions 9 through 20. Our method goes beyond…

We investigate a connection between two important classes of Euclidean lattices: well-rounded and ideal lattices. A lattice of full rank in a Euclidean space is called well-rounded if its set of minimal vectors spans the whole space. We…

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…

Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Combining the use of our data structure for characterizing feasible packings with our new classes of…

This work continues the study started in \cite{Povolotsky2021}, where the exact densities of loops in the O(1) dense loop model on an infinite strip of the square lattice with periodic boundary conditions were obtained. These densities are…

We identify the maximally dense lattice packings of tangent-disk trimers with fixed bond angles ($\theta = \theta_0$) and contrast them to both their nonmaximally-dense-but-strictly-jammed lattice packings as well as the disordered jammed…

Finding the densest sphere packing in $d$-dimensional Euclidean space $\mathbb{R}^d$ is an outstanding fundamental problem with relevance in many fields, including the ground states of molecular systems, colloidal crystal structures, coding…

This paper provides the currently best known upper bound on the density of a packing in three-dimensional Euclidean space of two types of spheres whose size ratio is the largest one that allows the insertion of a small sphere in each…

We obtain exact densities of contractible and non-contractible loops in the O(1) model on a strip of the square lattice rolled into an infinite cylinder of finite even circumference $L$. They are also equal to the densities of critical…

The mean-centered cuboidal (or m.c.c.) lattice is known to be the optimal packing and covering among all isodual three-dimensional lattices. In this note we show that it is also the best quantizer. It thus joins the isodual lattices Z, A_2…