English
Related papers

Related papers: Density of Binary Disc Packings: The 9 Compact Pac…

200 papers

We study packing densities for set partitions, which is a generalization of packing words. We use results from the literature about packing densities for permutations and words to provide packing densities for set partitions. These results…

Combinatorics · Mathematics 2015-04-10 Adam M. Goyt , Lara K. Pudwell

In "Dense Sphere Packings: A Blueprint for Formal Proofs" Hales proves that for every packing of unit spheres, the density in a ball of radius $r$ is at most $\pi/\sqrt{18}+c/r$ for some constant $c$. When $r$ tends to infinity, this gives…

Metric Geometry · Mathematics 2017-12-12 Nadja Scharf

Sphere packing problems have a rich history in both mathematics and physics; yet, relatively few analytical analyses of sphere packings exist, and answers to seemingly simple questions are unknown. Here, we present an analytical method for…

Soft Condensed Matter · Physics 2013-10-17 Natalie Arkus , Vinothan N. Manoharan , Michael P. Brenner

We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…

Metric Geometry · Mathematics 2022-11-10 Yihan Zhang , Shashank Vatedka

Packing problems, which ask how to arrange a collection of objects in space to meet certain criteria, are important in a great many physical and biological systems, where geometrical arrangements at small scales control behaviour at larger…

Soft Condensed Matter · Physics 2016-05-23 Miranda C. Holmes-Cerfon

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…

Information Theory · Computer Science 2009-09-29 Gérard Cohen , Alexander Vardy

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 prove that the set $\{0, 1, 4, 6\}$ achieves the minimum packing density among all sets of integers with cardinality four, with a density of $\frac{1}{7}$.

Combinatorics · Mathematics 2025-01-06 Cindy Li , David Offner , Iris Ye

We consider the problem of identifying n points in the plane using disks, i.e., minimizing the number of disks so that each point is contained in a disk and no two points are in exactly the same set of disks. This problem can be seen as an…

Discrete Mathematics · Computer Science 2017-06-01 Valentin Gledel , Aline Parreau

For the binary discs packed in two dimensions, the packing fraction of disc assembly becomes lower than that of the monodisperse system when the size ratio is close to unity. We show that the suppressed packing fraction is caused by an…

Disordered Systems and Neural Networks · Physics 2007-10-24 Takashi Odagaki , Tsuyoshi Okubo , Ryusei Ogata , Keiji Okazaki

Jung's theorem says that planar sets of diameter $1$ can be covered by a closed circular disk of radius $\frac 1{\sqrt3}$. In this paper we consider a fractional Jung-type problem for finite planar point-sets. Let $\mathcal{P}_n$ be the…

Combinatorics · Mathematics 2025-12-03 András Bezdek , Owen Henderschedt

We provide a counterexample to a conjecture by B. Connelly about density of circle packings

Metric Geometry · Mathematics 2021-04-28 Thomas Fernique , Daria Pchelina

Using graph-theoretic methods we give a new proof that for all sufficiently large $n$, there exist sphere packings in $\R^n$ of density at least $cn2^{-n}$, exceeding the classical Minkowski bound by a factor linear in $n$. This matches up…

Combinatorics · Mathematics 2007-05-23 Michael Krivelevich , Simon Litsyn , Alexander Vardy

For any given natural number $k$, this paper gives upper bounds on the radius of a packing of a complete hyperbolic surface of finite area by $k$ equal-radius disks in terms of the surface's topology. We show that the bounds given here are…

Geometric Topology · Mathematics 2018-06-11 Jason DeBlois

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…

Metric Geometry · Mathematics 2007-05-23 David W. Boll , Jerry Donovan , Ronald L. Graham , Boris D. Lubachevsky

We show that every packing of congruent regular pentagons in the Euclidean plane has density at most $(5-\sqrt5)/3$, which is about 0.92. More specifically, this article proves the pentagonal ice-ray conjecture of Henley (1986), and…

Metric Geometry · Mathematics 2016-09-14 Thomas Hales , Wöden Kusner

The presence of radial truncations in stellar disks is reviewed. There is ample evidence that many disk galaxies have relatively shaprt truncations in their disks. These often are symmetric and independent of the wavelength band of the…

Astrophysics · Physics 2007-05-23 P. C. van der Kruit

An extremal $k$-packing is a collection of $k$ mutually disjoint metric discs, embedded in a surface, whose radius is maximal for the given topology. We study compact non-orientable surfaces of genus $g\ge 3$ containing extremal…

Metric Geometry · Mathematics 2019-07-04 Ernesto Girondo , Cristian Reyes

For a finite set of integers such that the first few gaps between its consecutive elements equal $a$, while the remaining gaps equal $b$, we study dense packings of its translates on the line. We obtain an explicit lower bound on the…

Combinatorics · Mathematics 2025-09-29 Alexander Natalchenko , Arsenii Sagdeev

We consider matchings with diametral disks between two sets of points R and B. More precisely, for each pair of matched points p in R and q in B, we consider the disk through p and q with the smallest diameter. We prove that for any R and B…

Computational Geometry · Computer Science 2019-02-25 Clemens Huemer , Pablo Pérez-Lantero , Carlos Seara , Rodrigo I. Silveira