Novel upper bounds for Borsuk numbers from contact points and spherical partitions

Let $b(n)$ be the least $m$ such that every bounded set in $\mathbb{R}^n$ of positive diameter can be partitioned into $m$ sets of smaller diameter. We prove that \[ b(4)\le6,\qquad b(5)\le12,\qquad b(6)\le31,\qquad b(7)\le45,\qquad b(8)\le89, \] and that \[ b(n)\le1+2^{n-1}\left(\tfrac{39}{64}\right)^{\lfloor(n-1)/8\rfloor} \qquad\text{for every } n\ge9 ; \] for instance, $b(9)\le157$ and $b(17)\le24337$. Further constructions give, for example, $b(10)\le289$ and $b(13)\le2313$. These bounds improve Lassak's bound $b(n)\le2^{n-1}+1$ of 1982 in every dimension $n\ge4$. In dimension four they also improve the recent bounds $b(4)\le8$ (Tolmachev and Voronov, May 2026) and $b(4)\le7$ (Arman, Bondarenko, Prymak and Radchenko, October 2026); the bound $b(4)\le6$ was announced independently by Chalmers in November 2026. The bounds for $n\ge7$ have analytic proofs: a quantitative form of Lassak's reduction to coverings of the sphere is combined with normal partitions of weighted vector configurations, for which the smallest inner product within a region is estimated explicitly. The bound for $n=6$ uses a covering of $S^4$ by thirty sets, checked in rational arithmetic. For $n=4,5$ three contact points of the circumscribed ball reduce the problem to a four-parameter family of bodies, which is split by finitely many power diagrams; that all parts have diameter less than one is verified by a computer program with rigorous error control.

Authors

Publication Details

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

Novel upper bounds for Borsuk numbers from contact points and spherical partitions

A. D. Tolmachev
arXiv (Cornell University)
Point processes and geometric inequalities
preprint

Novel upper bounds for Borsuk numbers from contact points and spherical partitions

A. D. Tolmachev
preprint en

Abstract

Let $b(n)$ be the least $m$ such that every bounded set in $\mathbb{R}^n$ of positive diameter can be partitioned into $m$ sets of smaller diameter. We prove that \[ b(4)\le6,\qquad b(5)\le12,\qquad b(6)\le31,\qquad b(7)\le45,\qquad b(8)\le89, \] and that \[ b(n)\le1+2^{n-1}\left(\tfrac{39}{64}\right)^{\lfloor(n-1)/8\rfloor} \qquad\text{for every } n\ge9 ; \] for instance, $b(9)\le157$ and $b(17)\le24337$. Further constructions give, for example, $b(10)\le289$ and $b(13)\le2313$. These bounds improve Lassak's bound $b(n)\le2^{n-1}+1$ of 1982 in every dimension $n\ge4$. In dimension four they also improve the recent bounds $b(4)\le8$ (Tolmachev and Voronov, May 2026) and $b(4)\le7$ (Arman, Bondarenko, Prymak and Radchenko, October 2026); the bound $b(4)\le6$ was announced independently by Chalmers in November 2026. The bounds for $n\ge7$ have analytic proofs: a quantitative form of Lassak's reduction to coverings of the sphere is combined with normal partitions of weighted vector configurations, for which the smallest inner product within a region is estimated explicitly. The bound for $n=6$ uses a covering of $S^4$ by thirty sets, checked in rational arithmetic. For $n=4,5$ three contact points of the circumscribed ball reduce the problem to a four-parameter family of bodies, which is split by finitely many power diagrams; that all parts have diameter less than one is verified by a computer program with rigorous error control.

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