English
Related papers

Related papers: On optimal $\lambda$-separable packings in the pla…

200 papers

Let $\mathcal{D}=\{D_0,\ldots,D_{n-1}\}$ be a set of $n$ topological disks in the plane and let $\mathcal{A} := \mathcal{A}(\mathcal{D})$ be the arrangement induced by $\mathcal{D}$. For two disks $D_i,D_j\in\mathcal{D}$, let $\Delta_{ij}$…

Combinatorics · Mathematics 2026-03-11 Aida Abiad , Boris Aronov , Mark de Berg , Julian Golak , Alexander Grigoriev , Freija van Lent

We consider the problem of finding the maximum number $e_d(n)$ of pairs of touching circles in a packing of $n$ congruent circles of diameter $d$ in the hyperbolic plane of curvature $-1$. In the Euclidean plane, the maximum comes from a…

Combinatorics · Mathematics 2026-01-01 Ádám Sagmeister , Konrad J. Swanepoel

We present an algorithm to simulate random sequential adsorption (random "parking") of discs on constant-curvature surfaces: the plane, sphere, hyperboloid, and projective plane, all embedded in three-dimensional space. We simulate complete…

Statistical Mechanics · Physics 2017-09-18 Elizabeth R. Chen , Miranda Holmes-Cerfon

Let $f$ be an analytic function on the unit disc which is in the Dirichlet class, so the Euclidean area of the image, counting multiplicity, is finite. The Euclidean length of a radial arc of hyperbolic length $\rho$ is then $o(\rho^1/2)$.…

Complex Variables · Mathematics 2007-11-02 T. K. Carne

Rounding has proven to be a fundamental tool in theoretical computer science. By observing that rounding and partitioning of $\mathbb{R}^d$ are equivalent, we introduce the following natural partition problem which we call the {\em secluded…

Discrete Mathematics · Computer Science 2022-11-08 Jason Vander Woude , Peter Dixon , A. Pavan , Jamie Radcliffe , N. V. Vinodchandran

We provide a new type of proof for the Koebe-Andreev-Thurston (KAT) planar circle packing theorem based on combinatorial edge-flips. In particular, we show that starting from a disk packing with a maximal planar contact graph $G$, one can…

Metric Geometry · Mathematics 2020-05-28 Robert Connelly , Steven J. Gortler

We study coarse separation in one-ended hyperbolic groups from a quantitative point of view, focusing on the volume growth of separating subsets. We prove that a one-ended hyperbolic group that is not virtually a surface group is coarsely…

Group Theory · Mathematics 2026-03-19 Oussama Bensaid , Anthony Genevois , Romain Tessera

The behaviour of materials under spatial confinement is sensitively dependent on the nature of the confining boundaries. In two dimensions, confinement within a hard circular boundary inhibits the hexagonal ordering observed in bulk systems…

Soft Condensed Matter · Physics 2015-06-17 Ian Williams , Erdal C. Oğuz , Robert L. Jack , Paul Bartlett , Hartmut Löwen , C. Patrick Royall

The problem of finding the asymptotic behavior of the maximal density of sphere packings in high Euclidean dimensions is one of the most fascinating and challenging problems in discrete geometry. One century ago, Minkowski obtained a…

Statistical Mechanics · Physics 2009-11-13 A. Scardicchio , F. H. Stillinger , S. Torquato

Can a disk orbiting a central body be eccentric, when the disk feels its own self-gravity and is pressureless? Contradictory answers appear in the literature. We show that such a disk can be eccentric, but only if it has a sharply truncated…

Earth and Planetary Astrophysics · Physics 2026-02-24 Yoram Lithwick , Eugene Chiang , Leon Mikulinsky , Zhenbang Yu

We obtain new restrictions on the linear programming bound for sphere packing, by optimizing over spaces of modular forms to produce feasible points in the dual linear program. In contrast to the situation in dimensions 8 and 24, where the…

Metric Geometry · Mathematics 2021-04-21 Henry Cohn , Nicholas Triantafillou

Predicting theoretically the highest density, which a disordered packing of discs can achieve, has been a long-standing unresolved problem. Such predictions are hindered by two difficulties - the dependence of the density on the packing…

Soft Condensed Matter · Physics 2026-05-26 Raphael Blumenfeld

We improve the previously best known upper bounds on the sizes of $\theta$-spherical codes for every $\theta<\theta^*\approx 62.997^{\circ}$ at least by a factor of $0.4325$, in sufficiently high dimensions. Furthermore, for sphere packing…

Metric Geometry · Mathematics 2023-10-10 Naser T. Sardari , Masoud Zargar

In this paper, we consider the problem of covering a plane region with unit discs. We present an improved upper bound and the first nontrivial lower bound on the number of discs needed for such a covering, depending on the area and…

Computational Geometry · Computer Science 2021-08-03 Shai Gul , Reuven Cohen , Simi Haber

Let $S$ be a set of $n$ points in $\mathbb{R}^d$, where $d \geq 2$ is a constant, and let $H_1,H_2,\ldots,H_{m+1}$ be a sequence of vertical hyperplanes that are sorted by their first coordinates, such that exactly $n/m$ points of $S$ are…

Sphere packings in high dimensions interest mathematicians and physicists and have direct applications in communications theory. Remarkably, no one has been able to provide exponential improvement on a 100-year-old lower bound on the…

Metric Geometry · Mathematics 2007-05-23 S. Torquato , F. H. Stillinger

The concept of hyperuniformity has been a useful tool in the study of large-scale density fluctuations in systems ranging across the natural and mathematical sciences. One can rank a large class of hyperuniform systems by their ability to…

Statistical Mechanics · Physics 2019-02-20 Timothy M. Middlemas , Frank H. Stillinger , Salvatore Torquato

Dense, disordered packings of particles are useful models of low-temperature amorphous phases of matter, biological systems, granular media, and colloidal systems. The study of dense packings of nonspherical particles enables one to…

Soft Condensed Matter · Physics 2022-05-09 Charles Emmett Maher , Frank H. Stillinger , Salvatore Torquato

Static packings of perfectly rigid particles are investigated theoretically and numerically. The problem of finding the contact forces in such packings is formulated mathematically. Letting the values of the contact forces define a vector…

Materials Science · Physics 2009-11-10 Sean McNamara , Hans Herrmann

We give lower bounds for the size of linearization discs for power series over $\mathbb{C}_p$. For quadratic maps, and certain power series containing a `sufficiently large' quadratic term, we find the exact linearization disc. For finite…

Dynamical Systems · Mathematics 2009-10-20 Karl-Olof Lindahl