The Chain Window Theorem for Packing Unit Cubes in a Cube of Side k + 1/√2

This paper continues a study of packings of unit cubes of arbitrary orientation in a cube of non-integer side. The companion paper [3] introduced the algorithmic three-band construction for sides just below an integer, and reported isolated packings of side k + 1/√2 for k = 4, 5, 6 found by exact integer programming. Here we give a rigorous proof that such packings form an infinite, highly symmetric family. For every integer k ≥ 3 the cube of side k + 1/√2 contains k³ + 6(k − 2) unit cubes: k³ axis-parallel cubes and 6(k − 2) cubes rotated by π/4 about a coordinate axis, arranged in six chains along a closed hexagon of edges of the container. Consequently s₃(n) ≤ k + 1/√2 for all n ≤ k³ + 6(k − 2), which improves on the lattice bound k + 1 for the 6(k − 2) values k³ < n ≤ k³ + 6(k − 2). For k = 4,…,9 it is the best value recorded on Friedman's Packing Center for n = 69–76, 131–143, 231–240, 358–373, 529–548 and 748–771; on the rest of each window smaller sides are already recorded. The positions of the axis-parallel cubes are given by a closed-form rule. The proof is by hand except for two finite computer verifications. We also show that at most k³ axis-parallel unit cubes fit in a cube of side less than k + 1, so the chains account for the entire gain.

Authors

Publication Details

Journal
Preprints.org
Published
2026-11-18
DOI
https://doi.org/10.20944/preprints202611.1815.v1
Primary Topic
Optimization and Packing Problems
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The Chain Window Theorem for Packing Unit Cubes in a Cube of Side k + 1/√2

Mohsen Karimi
Preprints.org
Optimization and Packing Problems
preprint

The Chain Window Theorem for Packing Unit Cubes in a Cube of Side k + 1/√2

Mohsen Karimi
preprint en

Abstract

This paper continues a study of packings of unit cubes of arbitrary orientation in a cube of non-integer side. The companion paper [3] introduced the algorithmic three-band construction for sides just below an integer, and reported isolated packings of side k + 1/√2 for k = 4, 5, 6 found by exact integer programming. Here we give a rigorous proof that such packings form an infinite, highly symmetric family. For every integer k ≥ 3 the cube of side k + 1/√2 contains k³ + 6(k − 2) unit cubes: k³ axis-parallel cubes and 6(k − 2) cubes rotated by π/4 about a coordinate axis, arranged in six chains along a closed hexagon of edges of the container. Consequently s₃(n) ≤ k + 1/√2 for all n ≤ k³ + 6(k − 2), which improves on the lattice bound k + 1 for the 6(k − 2) values k³ < n ≤ k³ + 6(k − 2). For k = 4,…,9 it is the best value recorded on Friedman's Packing Center for n = 69–76, 131–143, 231–240, 358–373, 529–548 and 748–771; on the rest of each window smaller sides are already recorded. The positions of the axis-parallel cubes are given by a closed-form rule. The proof is by hand except for two finite computer verifications. We also show that at most k³ axis-parallel unit cubes fit in a cube of side less than k + 1, so the chains account for the entire gain.

Preprints.org
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