Why Can the Layers Not Move Closer? A Geometric Proof for Packings Built from Parallel Triangular Lattices

This expository note presents an elementary geometric proof of the optimal density bound within a restricted class of unit-sphere packings: the centers lie in parallel planes, each containing a translate of the same triangular lattice with nearest-neighbor distance two and a common lattice orientation. The argument begins with the covering radius of the planar triangular lattice, 2/√3. Combined with the non-overlap condition for unit spheres, this gives a minimum separation of √(8/3) between successive layers. The area per center within each layer is 2√3, leading to an upper packing density of π/(3√2), approximately 0.74048. The note verifies that close-packed Barlow stackings, including face-centered cubic (FCC) and hexagonal close-packed (HCP) arrangements, attain this bound. Boundary contributions are explicitly controlled when passing from finite center counts to asymptotic packing density. The explanatory structure is direct: a planar distance bound yields an interlayer separation bound, which yields a spatial density bound. This work does not claim a new mathematical result or a new proof of the unrestricted Kepler theorem. Its contribution is expository: a self-contained derivation for a precisely specified class of layered packings, with explicit assumptions, limitations, and a follow-up research question concerning more general configurations. The note also distinguishes equal hard-sphere geometry from atomistic models of materials such as silicon carbide. No physical phase-transition prediction is claimed. Author: Nguyen Kim KhanhProject: Khanh MathematicsDate: 28 October 2026 AI assistance was used for organization, mathematical formulation, translation, and wording. Independent verification of the arguments and references is recommended before publication.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-10-28
DOI
https://doi.org/10.5281/zenodo.23720106
Primary Topic
Point processes and geometric inequalities
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Why Can the Layers Not Move Closer? A Geometric Proof for Packings Built from Parallel Triangular Lattices

Kim Khanh Nguyen
Zenodo (CERN European Organization for Nuclear Research)
Point processes and geometric inequalities
preprint

Why Can the Layers Not Move Closer? A Geometric Proof for Packings Built from Parallel Triangular Lattices

Kim Khanh Nguyen
preprint en

Abstract

This expository note presents an elementary geometric proof of the optimal density bound within a restricted class of unit-sphere packings: the centers lie in parallel planes, each containing a translate of the same triangular lattice with nearest-neighbor distance two and a common lattice orientation. The argument begins with the covering radius of the planar triangular lattice, 2/√3. Combined with the non-overlap condition for unit spheres, this gives a minimum separation of √(8/3) between successive layers. The area per center within each layer is 2√3, leading to an upper packing density of π/(3√2), approximately 0.74048. The note verifies that close-packed Barlow stackings, including face-centered cubic (FCC) and hexagonal close-packed (HCP) arrangements, attain this bound. Boundary contributions are explicitly controlled when passing from finite center counts to asymptotic packing density. The explanatory structure is direct: a planar distance bound yields an interlayer separation bound, which yields a spatial density bound. This work does not claim a new mathematical result or a new proof of the unrestricted Kepler theorem. Its contribution is expository: a self-contained derivation for a precisely specified class of layered packings, with explicit assumptions, limitations, and a follow-up research question concerning more general configurations. The note also distinguishes equal hard-sphere geometry from atomistic models of materials such as silicon carbide. No physical phase-transition prediction is claimed. Author: Nguyen Kim KhanhProject: Khanh MathematicsDate: 28 October 2026 AI assistance was used for organization, mathematical formulation, translation, and wording. Independent verification of the arguments and references is recommended before publication.

Zenodo (CERN European Organization for Nuclear Research)
University of Khanh Hoa (VN)
Point processes and geometric inequalities
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