English
Related papers

Related papers: Compact Packings are not always the Densest

200 papers

We consider circle packings in the plane with circles of sizes $1$, $r\simeq 0.834$ and $s\simeq 0.651$. These sizes are algebraic numbers which allow a compact packing, that is, a packing in which each hole is formed by three mutually…

Computational Geometry · Computer Science 2019-12-06 Thomas Fernique

This is the second in a series of papers giving a proof of the Kepler conjecture, which asserts that the density of a packing of congruent spheres in three dimensions is never greater than $\pi/\sqrt{18}\approx 0.74048...$. This is the…

Metric Geometry · Mathematics 2007-05-23 Samuel P. Ferguson , Thomas C. Hales

In this paper we will discuss optimal lower and upper density of non-parallel cylinder packings in $R^{3}$ and similar problems. The main result of the paper is a proof of the conjecture of K. Kuperberg for upper density (existence of a…

Metric Geometry · Mathematics 2023-10-12 Ofek Eliyahu

This is the eighth and final paper in a series giving a proof of the Kepler conjecture, which asserts that the density of a packing of congruent spheres in three dimensions is never greater than $\pi/\sqrt{18}\approx 0.74048...$. This is…

Metric Geometry · Mathematics 2007-05-23 Thomas C. Hales

This is the fifth in a series of papers giving a proof of the Kepler conjecture, which asserts that the density of a packing of congruent spheres in three dimensions is never greater than $\pi/\sqrt{18}\approx 0.74048...$. This is the…

Metric Geometry · Mathematics 2007-05-23 Thomas C. Hales

This is the first in a series of papers giving a proof of the Kepler conjecture, which asserts that the density of a packing of congruent spheres in three dimensions is never greater than $\pi/\sqrt{18}\approx 0.74048...$. This is the…

Metric Geometry · Mathematics 2007-05-23 Thomas C. Hales

This is the sixth in a series of papers giving a proof of the Kepler conjecture, which asserts that the density of a packing of congruent spheres in three dimensions is never greater than $\pi/\sqrt{18}\approx 0.74048...$. This is the…

Metric Geometry · Mathematics 2007-05-23 Thomas C. Hales

We consider packings of the plane using discs of radius 1 and r=0.545151... . The value of r admits compact packings in which each hole in the packing is formed by three discs which are tangent to each other. We prove that the largest…

Metric Geometry · Mathematics 2007-05-23 Tom Kennedy

We give a counterexample of Bowers-Stephenson's conjecture in the spherical case: spherical inversive distance circle packings are not determined by their inversive distances.

Differential Geometry · Mathematics 2011-05-10 Jiming Ma , Jean-Marc Schlenker

We show that a convex body admits a translative dense packing in $\mathbb{R}^d$ if and only if it admits a translative economical covering.

Metric Geometry · Mathematics 2018-11-12 Roman Prosanov

The Kepler conjecture asserts that no packing of congruent balls in three-dimensional Euclidean space has density greater than that of the face-centered cubic packing. The original proof, announced in 1998 and published in 2006, is long and…

Metric Geometry · Mathematics 2009-02-03 Thomas C. Hales , John Harrison , Sean McLaughlin , Tobias Nipkow , Steven Obua , Roland Zumkeller

A disc packing in the plane is compact if its contact graph is a triangulation. There are $9$ values of $r$ such that a compact packing by discs of radii $1$ and $r$ exists. We prove, for each of these $9$ values, that the maximal density…

Discrete Mathematics · Computer Science 2021-05-04 Nicolas Bédaride , Thomas Fernique

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

We consider the problem of packing congruent circles with the maximum radius in a unit square as a mathematical optimization problem. Due to the presence of non-overlapping constraints, this problem is a notoriously difficult nonconvex…

Optimization and Control · Mathematics 2024-04-05 Aida Khajavirad

We examine packing of $n$ congruent spheres in a cube when $n$ is close but less than the number of spheres in a regular cubic close-packed (ccp) arrangement of $\lceil p^{3}/2\rceil$ spheres. For this family of packings, the previous…

Computational Geometry · Computer Science 2015-03-30 Milos Tatarevic

Packing problems have been of great interest in many diverse contexts for many centuries. The optimal packing of identical objects has been often invoked to understand the nature of low temperature phases of matter. In celebrated work,…

Statistical Mechanics · Physics 2009-11-13 Antonio Trovato , Trinh X. Hoang , Jayanth R. Banavar , Amos Maritan

The Kepler conjecture asserts that no packing of congruent balls in three-dimensional Euclidean space has density greater than that of the face-centered cubic packing. In 1998, Sam Ferguson and I announced a computer-assisted proof of this…

Metric Geometry · Mathematics 2024-02-14 Thomas Hales

This work investigates dense packings of congruent hard infinitesimally--thin circular arcs in the two-dimensional Euclidean space. It focuses on those denotable as major whose subtended angle $\theta \in \left ( \pi, 2\pi \right ]$.…

Soft Condensed Matter · Physics 2020-10-28 Juan Pedro Ramírez González , Giorgio Cinacchi

We use computational experiments to find the rectangles of minimum area into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles. Most of the packings found have…

Metric Geometry · Mathematics 2007-05-23 Boris D. Lubachevsky , Ronald Graham

We provide a tight result for a fundamental problem arising from packing disks into a circular container: The critical density of packing disks in a disk is 0.5. This implies that any set of (not necessarily equal) disks of total area…

Computational Geometry · Computer Science 2019-03-20 Sándor P. Fekete , Phillip Keldenich , Christian Scheffer
‹ Prev 1 2 3 10 Next ›