Cube slicing in 𝑅ⁿ

Keith Ball

Source record

Source: Crossref

Published: Jul 1, 1986

DOI: 10.1090/s0002-9939-1986-0840631-0

Open original source ↗

Source abstract

We prove that every ( n − 1 ) (n - 1) -dimensional section of the unit cube in R n {{\mathbf {R}}^n} has volume at most 2 \sqrt 2 . This upper bound is clearly best possible.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.