Borsuk number in four dimensions is at most seven

We prove that every bounded set of diameter one in four-dimensional Euclidean space can be covered by seven balls of diameter strictly smaller than $0.9999$. In particular, the Borsuk number satisfies $b_4\le7$. The proof combines geometric arguments based on contact points of the circumball with an exact finite computation. For small and large circumradius, the covering centres are constructed analytically. In the remaining range, a suitable triangle of contact points reduces the problem to a four-parameter family of ball polytopes. The parameter cube is subdivided into 23494 boxes. For each parameter box, candidate centres are found by nonlinear optimization, and the resulting covering is verified using exact rational interval arithmetic and paraboloid lifting.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-10-29
DOI
https://doi.org/10.48550/arxiv.2610.39078
Primary Topic
Point processes and geometric inequalities
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Borsuk number in four dimensions is at most seven

Danylo Radchenko, Andrii Arman, Andriy Prymak, Andriy V. Bondarenko
arXiv (Cornell University)
Point processes and geometric inequalities
preprint

Borsuk number in four dimensions is at most seven

Danylo Radchenko, Andrii Arman, Andriy Prymak, Andriy V. Bondarenko
preprint en

Abstract

We prove that every bounded set of diameter one in four-dimensional Euclidean space can be covered by seven balls of diameter strictly smaller than $0.9999$. In particular, the Borsuk number satisfies $b_4\le7$. The proof combines geometric arguments based on contact points of the circumball with an exact finite computation. For small and large circumradius, the covering centres are constructed analytically. In the remaining range, a suitable triangle of contact points reduces the problem to a four-parameter family of ball polytopes. The parameter cube is subdivided into 23494 boxes. For each parameter box, candidate centres are found by nonlinear optimization, and the resulting covering is verified using exact rational interval arithmetic and paraboloid lifting.

arXiv (Cornell University)
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