Math 2.0

Convex and discrete geometry Packing and covering Theorem

Thue's theorem

Builds on Circle packingPacking density

Statement

Every packing of equal circles in the plane ℝ2\R^2 has upper packing density at most π12=π23≈0.9069.\frac{\pi}{\sqrt{12}} = \frac{\pi}{2\sqrt 3} \approx 0.9069. The hexagonal circle packing, in which the centres form a triangular lattice and each circle touches six others, has density exactly π/12\pi/\sqrt{12}.

Remarks

For the hexagonal packing with radius 11, the centres form a lattice whose fundamental parallelogram has area 232\sqrt 3. Each cell carries one disc of area π\pi, and this gives the density. For the upper bound, one standard proof joins the centres of a saturated packing into a Delaunay triangulation. Each triangle has sides at least 22. One shows that the discs cover at most the fraction π/12\pi/\sqrt{12} of each triangle, with equality for the equilateral triangle of side 22. Lagrange proved the bound for lattice packings in 1773. Axel Thue gave proofs for general packings in 1890 and 1910, and László Fejes Tóth gave the first proof regarded as complete in 1940.

Going deeper

For a student

Thue's theorem is the two-dimensional case of the sphere packing problem; its three-dimensional case is the Kepler conjecture. The local argument works in the plane because the densest local arrangement, six circles around one, fits together into a global tiling. In three dimensions this fails, which is one reason why the Kepler conjecture is so much harder.

Reading path

To understand this page from the ground up, read these 3 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Circle packing concept
  2. Packing density concept
  3. Thue's theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Circle_packing
About this page
Tag3P246RHXMF
URIm2://3P246RHXMF
Kindstatement, theorem
WritingW0 stub
MSC52C15, 05B40
StatusThis copy of the site has no build data. Run m2 status 3P246RHXMF.
AboutCircle packing
UsesCircle packing, Packing density

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.