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

Authors: Alexander Tolmachev

Submitted to arXiv on 12 Nov. 2026
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.

The papers around it, by date and closeness

Higher is closer to this paper; left is older. Lines join papers close to each other: groups of lines are sub-topics. Select a point to see why it is there. Back to the summary of this paper

How to read this map? Illustrated guide

Closest papers Prior work it builds on Papers that cite it

Papers around this one

Ranked by how close their title and abstract are to this paper’s. Select some to read them together.

Closest papers

  1. Very close Another approach to the problem Cited by this paper
    Borsuk number in four dimensions is at most seven
    A. Arman, A. Bondarenko, A. Prymak et al. · 2026 · cited 2 times · Not summarized yet

    “Borsuk number in four dimensions is at most seven” uses contact points and a finite computation to bound the same four-dimensional partition problem by seven parts.

    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 …

  2. Very close Same question Cited by this paper
    On Borsuk’s Conjecture for Two-Distance Sets
    A. Bondarenko · 2013 · Discrete & Computational Geometry · cited 56 times · Not summarized yet

    “On Borsuk’s Conjecture for Two-Distance Sets” studies Borsuk numbers, giving a two-distance set that cannot be partitioned into a specified number of smaller-diameter parts.

    Abstract

    In this paper, we answer Larman’s question on Borsuk’s conjecture for two-distance sets. We find a two-distance set consisting of 416 points on the unit sphere $S^{64}\subset\mathbb{R}^{65}$ which cannot be partitioned into 83 parts of smaller diameter. This also reduces the smallest dimension in which Borsuk’s conjecture is known to be false. Other examples of two-distance sets with large Borsuk numbers are given.

  3. Very close Same question Cited by this paper
    On upper bounds on the number of parts in the problem of partitioning sets into parts of smaller diameter
    A. Bikeev, A. M. Raigorodskii · 2025 · cited 3 times · Not summarized yet

    “On upper bounds on the number of parts” studies upper bounds for smaller-diameter partitions, including a related quantity with a specified diameter threshold.

    Abstract

    In the present paper, we study problems related to the classical Borsuk's problem. Recall that the Borsuk's problem consists in finding the smallest number $ f(n) $ of parts of smaller diameter into which an arbitrary set of diameter 1 in Euclidean space $ {\mathbb R}^n $ can be divided. Here we will discuss the quantity $ \chi(n,b) $ which differs from the quantity $ f(n) $ in that in its definition an arbitrary set of diameter 1 in $ {\mathbb R}^n $ must be partitioned into parts whose diameters are strictly less than a given number $ b \in (0,1] $. In this paper, we collect information about the known upper bounds and, among other things, find a new upper bound for the quantity $ \chi(n,b…

  4. Close Review Cited by this paper
    Borsuk’s partition conjecture
    C. Zong · 2021 · Japanese journal of mathematics · cited 17 times · Not summarized yet

    “Borsuk’s partition conjecture” reviews the conjecture and the history of results on partitioning bounded sets into smaller-diameter subsets.

    Abstract

    In 1933, Borsuk proposed the following problem: Can every bounded set in En\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathbb{E}}^n}$$\end{document} be divided into n + 1 subsets of smaller diameter? This problem has been studied by many authors, and a lot of partial results have been discovered. In particular, Kahn and Kalai’s counterexamples surprised the mathematical community in 1993. Nevertheless, the problem is still far away from being completely resolved. This paper presents a broad review on relat…

  5. Close Same question Cited by this paper Used in depth by this paper
    The four-dimensional Borsuk number is five or six
    Logan R. Chalmers · 2026 · cited 1 time · Not summarized yet

    “The four-dimensional Borsuk number is five or six” proves that six parts suffice in four dimensions, matching this paper’s four-dimensional bound.

    Abstract

    Can every set of diameter one in four dimensions be split into at most five parts of smaller diameter? Three parts suffice in the plane and four in three-dimensional space. In four dimensions five parts are sometimes necessary. We prove that six always suffice, improving the previous upper bound of seven. For small circumradius we use six cones. For large circumradius five balls meet every diametral pair of a compact set. At intermediate radii we bound the diameter of each part by the diameter of a rational polytope. The theorem is formalised in Lean.

  6. Close Same question Cited by this paper
    Coverings of planar and three-dimensional sets with subsets of smaller diameter
    Alexander Tolmachev, D. Protasov, Vsevolod Voronov · 2022 · Discrete Applied Mathematics · cited 11 times · Not summarized yet

    “Coverings of planar and three-dimensional sets” gives quantitative bounds for covering or partitioning sets into smaller-diameter subsets in low dimensions.

    Abstract

    Quantitative estimates related to the classical Borsuk problem of splitting set in Euclidean space into subsets of smaller diameter are considered. For a given $k$ there is a minimal diameter of subsets at which there exists a covering with $k$ subsets of any planar set of unit diameter. In order to find an upper estimate of the minimal diameter we propose an algorithm for finding sub-optimal partitions. In the cases $10 \leqslant k \leqslant 17$ some upper and lower estimates of the minimal diameter are improved. Another result is that any set $M \subset \mathbb{R}^3$ of a unit diameter can be partitioned into four subsets of a diameter not greater than $0.966$.

  7. Close Broader context Cited by this paper
    Some old and new problems in combinatorial geometry I: around Borsuk's problem
    G. Kalai · 2015 · Surveys in Combinatorics · cited 33 times · Not summarized yet

    “Some old and new problems in combinatorial geometry I” discusses questions related to Borsuk’s problem, including its conjecture and counterexample.

    Abstract

    Borsuk asked in 1933 if every set of diameter 1 in $R^d$ can be covered by $d+1$ sets of smaller diameter. In 1993, a negative solution, based on a theorem by Frankl and Wilson, was given by Kahn and Kalai. In this paper I will present questions related to Borsuk's problem.

  8. Close* Same question Cited by this paper
    A simple proof of Borsuk's conjecture in three dimensions
    B. Grünbaum, H. G. Eggleston · 1957 · Mathematical Proceedings of the Cambridge Philosophical Society · cited 56 times · Not summarized yet

    “A simple proof of Borsuk’s conjecture in three dimensions” addresses Borsuk’s smaller-diameter partition question in three-dimensional space.

Prior work it builds on

  1. Related* Broader context
    Borsuk's problem and the chromatic numbers of some metric spaces
    A. Raigorodskii · 2001 · Russian Mathematical Surveys · cited 204 times · Not summarized yet

    “Borsuk’s problem and the chromatic numbers of some metric spaces” connects Borsuk’s problem with chromatic numbers of metric spaces.

  2. Related Broader context
    On asymptotic Lebesgue's universal covering problem
    A. Arman, A. Bondarenko, A. Prymak et al. · 2025 · Bulletin of the London Mathematical Society · cited 3 times · Not summarized yet

    “On asymptotic Lebesgue’s universal covering problem” studies universal covers for sets of bounded diameter, rather than partitions into smaller-diameter pieces.

    Abstract

    A universal cover in is a measurable set that contains a congruent copy of any set of diameter 1. Lebesgue's universal covering problem, posed in 1914, asks for the convex set of smallest area that serves as a universal cover in the plane (). A simple universal cover in is provided by the classical theorem of Jung, which states that any set of diameter 1 in an ‐dimensional Euclidean space is contained in a ball of radius ; in other words, is a universal cover in . We show that in high dimensions, Jung's ball is asymptotically optimal with respect to the volume, namely, for any universal cover ,

  3. Related* Broader context Used in depth by this paper
    On convering a set in R N by balls of the same diameter
    J. Bourgain, J. Lindenstrauss · 1991 · cited 45 times · Not summarized yet

    “On convering a set in R N by balls of the same diameter” concerns covering sets with equal-diameter balls, a neighbouring covering problem.

  4. Related* Same question
    Covering a Three‐Dimensional set with Sets of Smaller Diameter
    H. Eggleston · 1955 · Journal of The London Mathematical Society-second Series · cited 74 times · Not summarized yet

    “Covering a Three‐Dimensional set with Sets of Smaller Diameter” addresses covering a set by subsets of smaller diameter in three dimensions.

  5. Related* Groundwork for this paper Used in depth by this paper
    Drei Sätze über die n-dimensionale euklidische Sphäre
    Karol Borsuk · 1933 · Fundamenta Mathematicae · cited 612 times · Not summarized yet

    “Drei Sätze über die n-dimensionale euklidische Sphäre” is cited in the paper’s work on bounds involving sphere coverings.

How are these papers found?

We compare the title and abstract of this paper with those of every paper summarized on this site, and with the papers Semantic Scholar recommends, those it cites and those citing it (for a much-cited paper, its most recent citations and, from OpenAlex, the most cited ones). Among the prior work and the follow-ups, the papers that use each other in depth, a method it uses and the much-cited follow-ups come a little higher. The levels (very close, close, related) come from the similarity of the texts, not from a judgment of quality; * marks a paper without an abstract, compared by its title. The sentence under a paper is written by an AI from the two abstracts: check it in the papers. A paper marked not relevant by three readers leaves the list.

Updated on 16 November 2026.

The illustrated guide to the papers around a paper