Sparse locally-jammed disk packings

DOI10.1007/s00026-012-0159-0zbMath1259.52012OpenAlexW2031708496WikidataQ57253619 ScholiaQ57253619MaRDI QIDQ1929746

Matthew Kahle

Publication date: 9 January 2013

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00026-012-0159-0

zbMATH Keywords

Metropolis algorithmdisk packinghard spheres gas

Mathematics Subject Classification ID

Ergodicity, mixing, rates of mixing (37A25) Other designs, configurations (05B30) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Related Items (5)

Sparse hard-disk packings and local Markov chains ⋮ Correlation decay for hard spheres via Markov chains ⋮ Configuration spaces of disks in a strip, twisted algebras, persistence, and other stories ⋮ Discrete configuration spaces of squares and hexagons ⋮ Configuration spaces of disks in an infinite strip

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear programming algorithm to test for jamming in hard-sphere packings
• Geometric analysis for the Metropolis algorithm on Lipschitz domains
• Micro-local analysis for the Metropolis algorithm
• Densest packings of eleven congruent circles in a circle
• Optimal packings of eleven equal circles in an equilateral triangle
• Curved hexagonal packings of equal disks in a circle
• Patterns and structures in disk packings
• Improving dense packings of equal disks in a square
• Rigidity of packings
• Min-Type Morse Theory for Configuration Spaces of Hard Spheres
• Research Problems in Discrete Geometry

This page was built for publication: Sparse locally-jammed disk packings