A Two-Row Counterexample to the Two-Saturated Disk Packing Conjecture

We give an explicit periodic packing of congruent disks whose density is strictly below the value conjectured by Fejes Tóth, Kuperberg and Kuperberg for two-saturated packings. Here two-saturation means that removing any one disk never makes room for two disks of the same radius while the other disks remain fixed. The construction has infinitely many rows alternating between two translation classes, with three rational parameters. Its density is approximately 0.461635721, compared with the conjectured 0.461873139. The proof first confines every possible replacement center to a bounded region, then encloses that region in a rational pentagon of diameter less than two. A verifier independent of the discovery code checks the witness exactly. Two further certified witnesses lower the density to approximately 0.461024734 and 0.460719380. The construction disproves the proposed equality; optimality over the full family and over all packings remains open.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-12
DOI
https://doi.org/10.5281/zenodo.24178422
Primary Topic
Optimization and Packing Problems
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

A Two-Row Counterexample to the Two-Saturated Disk Packing Conjecture

John Seamons
Zenodo (CERN European Organization for Nuclear Research)
Optimization and Packing Problems
preprint

A Two-Row Counterexample to the Two-Saturated Disk Packing Conjecture

John Seamons
preprint en

Abstract

We give an explicit periodic packing of congruent disks whose density is strictly below the value conjectured by Fejes Tóth, Kuperberg and Kuperberg for two-saturated packings. Here two-saturation means that removing any one disk never makes room for two disks of the same radius while the other disks remain fixed. The construction has infinitely many rows alternating between two translation classes, with three rational parameters. Its density is approximately 0.461635721, compared with the conjectured 0.461873139. The proof first confines every possible replacement center to a bounded region, then encloses that region in a rational pentagon of diameter less than two. A verifier independent of the discovery code checks the witness exactly. Two further certified witnesses lower the density to approximately 0.461024734 and 0.460719380. The construction disproves the proposed equality; optimality over the full family and over all packings remains open.

Zenodo (CERN European Organization for Nuclear Research)
Optimization and Packing Problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon