Minimum Perimeter of Central Hyperplane Sections of the Cube

For every integer n >= 3, we prove that a central hyperplane section of the side-one real cube has perimeter at least 2(n-1), where perimeter is the (n-2)-dimensional measure of its relative boundary. Equality holds exactly for coordinate sections. The proof is analytic in dimensions three and four and in every dimension at least seven; dimensions five and six use complete finite certificates checked with exact arithmetic. Ordered facet densities transfer a cubic negative-moment estimate for section volume to perimeter, while a quantitative comparison of nearby graph sections validates all cells of the finite certificates. This answers item 2 of Problem 1 in the 2013 AIM list on sections of convex bodies, not the other functionals, codimensions or measures in that bundled record. This AI-assisted, self-audited preprint is unrefereed; absolute priority and proof-assistant formalization are not claimed.

Authors

Publication Details

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

Minimum Perimeter of Central Hyperplane Sections of the Cube

Alper Ferudun
Zenodo (CERN European Organization for Nuclear Research)
Point processes and geometric inequalities
preprint

Minimum Perimeter of Central Hyperplane Sections of the Cube

Alper Ferudun
preprint en

Abstract

For every integer n >= 3, we prove that a central hyperplane section of the side-one real cube has perimeter at least 2(n-1), where perimeter is the (n-2)-dimensional measure of its relative boundary. Equality holds exactly for coordinate sections. The proof is analytic in dimensions three and four and in every dimension at least seven; dimensions five and six use complete finite certificates checked with exact arithmetic. Ordered facet densities transfer a cubic negative-moment estimate for section volume to perimeter, while a quantitative comparison of nearby graph sections validates all cells of the finite certificates. This answers item 2 of Problem 1 in the 2013 AIM list on sections of convex bodies, not the other functionals, codimensions or measures in that bundled record. This AI-assisted, self-audited preprint is unrefereed; absolute priority and proof-assistant formalization are not claimed.

Zenodo (CERN European Organization for Nuclear Research)
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.