AI summary · arXiv: 2611.16775v1 · math.MG

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

Alexander Tolmachev
Original paper Submitted to arXiv on 12 Nov. 2026 34 pages, 5 figures License: NONEXCLUSIVE-DISTRIB 1.0 Also in: fr

How to read this summary? Illustrated guide

The essentials

The paper proves improved upper bounds for Borsuk numbers, including b(4) ≤ 6, b(5) ≤ 12, and an analytic improvement over Lassak’s bound in every dimension n ≥ 4.

Question

How many smaller-diameter pieces suffice to partition any bounded set of positive diameter in R^n? The paper seeks stronger upper bounds, especially in low dimensions, by combining geometric reductions with spherical coverings.

Method

For dimensions 4 and 5, three contact points of a smallest enclosing ball reduce the problem to a four-parameter family; dyadic subdivisions and power-diagram partitions are then verified with rigorous computational checks. For dimensions 6 and above, a quantitative reduction to sphere coverings is combined with normal regions of weighted vector configurations, with finite rational verification in dimension 6 and analytic estimates for the other stated bounds.

Findings

  • Result The computer-assisted argument establishes b(4) ≤ 6 and b(5) ≤ 12.
    See the passage in the paper
    Thus every leaf has an admissible $6$-partition for $n=4$ and an admissible $12$-partition for $n=5$, and Propositions 4.11 and 4.8 give $b(4)\leq 6$ and $b(5)\leq 12$.
  • Result The paper proves b(6) ≤ 31, b(7) ≤ 45, and b(8) ≤ 89.
    See the passage in the paper
    Since $D(6;3,40)=595>0$, Proposition 5.3 and Proposition 3.3 give $b(6)\leq 1+30=31$. By (5.3) and $D(7;1,19)=680>0$, Proposition 3.3 gives $b(7)\leq 1+44=45$. Finally, Lemma 3.2 and the monotonicity of $K$ in $\mu$ give $K(7,1/19)\leq K(6,1/19)\,K(1,1/19)\leq 44\cdot 2=88$, and since $D(8;1,19)=288>0$, we get $b(8)\leq 89$.
  • Result For n ≥ 9, the paper gives a general bound based on decomposing n−1 into blocks of dimensions 7, 8, and 1.
    See the passage in the paper
    Let $n\geq 9$. If $n-1=7a+8b+c$ with nonnegative integers $a,b,c$, then $$b(n)\leq 1+88^{a}\,156^{b}\,2^{c}.$$
  • Authors’ interpretation The resulting bounds improve Lassak’s bound in every dimension n ≥ 4, but the authors characterize the results as concerning small dimensions rather than improving the best asymptotic estimate.
    See the passage in the paper
    The general bound (1.4) grows like $156^{n/8}\approx 1.88^{n}$, whereas Schramm’s bound grows like $(3/2)^{n/2}$ up to a polynomial factor, so our results concern small dimensions.

Limitations

  • The general analytic estimate does not improve the best known asymptotic bound.
    See the passage in the paper
    Thus (1.4) is an improvement of Lassak’s estimate, but not of the best known asymptotic bound.
  • The computational reduction for small dimensions becomes substantially more demanding as dimension increases.
    See the passage in the paper
    The reduction of Section 4 works in every dimension $n\geq 4$, but the verification becomes considerably heavier as $n$ grows: the complete run took about $75$ minutes for $n=4$ and about $11.5$ hours for $n=5$ (Appendix B.5).
  • The optimality of the four-dimensional bound is unresolved.

Why it matters

The results improve Lassak’s upper bound in every dimension n ≥ 4 and provide new constructions linking Borsuk partitions to quantitative spherical coverings. The authors argue that the bounds are most relevant in small dimensions; their general estimate does not match the stronger asymptotic bound.

Written by AI from the paper. Passages are checked word for word against the text we analysed; the rest may contain errors.

AI-generated keywords: Borsuk’s partition problem; diameter partitions; spherical coverings; power diagrams; computer-assisted proofs

Read further

  • Comprehensive Summary
  • Layman's Summary
  • Blog article
  • Original abstract
The paper studies Borsuk’s partition problem: for each dimension \(n\), how many pieces are sufficient to divide any bounded set of positive diameter in Euclidean \(n\)-space into sets of strictly smaller diameter? The least such universal number is denoted by \(b(n)\). The paper develops two approaches to improving known upper bounds, focusing chiefly on small and moderate dimensions. For dimensions four and five, the author uses three points at which a set touches its smallest enclosing ball. A geometric argument shows that, after an isometry, the set lies within a family of bodies described by four parameters. The parameter range is divided into finitely many boxes, and each box is assigned a rigorous outer approximation of the corresponding bodies. Power diagrams partition these approximations into six pieces in dimension four and twelve in dimension five. Computer-assisted verification—using rational arithmetic and carefully controlled interval and floating-point calculations—certifies that every piece has diameter strictly less than one. This proves \(b(4)\leq 6\) and \(b(5)\leq 12\). The maximum diameters of the verified enclosing polytopes are reported to be very close to, but strictly below, one. The paper does not claim that six or twelve is optimal for the constructed family. For dimensions six and above, the paper refines Lassak’s reduction of the partition problem to coverings of a sphere. It gives a quantitative version in which spherical covering regions may have inner products slightly below zero, within a dimension-dependent tolerance. It then constructs coverings from normal regions of weighted finite vector configurations and estimates the smallest possible inner product within each region. A product rule combines coverings across dimensions. The dimension-six covering is verified by finite rational computation, while the other constructions are proved analytically. The resulting bounds are \(b(6)\leq 31\), \(b(7)\leq 45\), and \(b(8)\leq 89\). The dimension-six result uses a covering of the four-sphere by thirty sets, checked using rational data. The seven- and eight-dimensional results use configurations formed from part of a cube’s vertex set, together with coordinate vectors or specially supported vectors. For every \(n\geq 9\), the paper proves \[ b(n)\leq 1+2^{n-1}(39/64)^{\lfloor(n-1)/8\rfloor}. \] This gives, among other values, \(b(9)\leq 157\), \(b(10)\leq 289\), and \(b(17)\leq 24{,}337\). Additional constructions yield \(b(12)\leq 1{,}245\), \(b(13)\leq 2{,}313\), and \(b(14)\leq 4{,}977\). Overall, the stated bounds improve Lassak’s estimate in every dimension from four onward. The dimension-four bound also improves earlier published bounds, although the paper notes that a bound of six was announced independently. The authors emphasize that the general analytic estimate is intended for small dimensions rather than asymptotic improvement: its growth rate is about \(1.88^n\), which is weaker, apart from polynomial factors, than established asymptotic bounds of roughly \((\sqrt{3/2})^n\). The low-dimensional proof relies on extensive computer-assisted certificates, with the dimension-five verification reported to be substantially more demanding than the dimension-four one. Whether \(b(4)=5\) remains open. More broadly, the spherical configurations are examples rather than optimal coverings, leaving room for improvement through better constructions.

Was this synthesis useful?

Score: 0

Why do we need votes?

Votes are used to determine whether we need to re-run our summarizing tools. If the count reaches -10, our tools can be restarted.

Figures and plots

Ask about a figure by number or use its question button to request visual analysis. Up to two figures and four image panels per question. Values read from plots are approximate; check the original data.

AI assistant instructions?

Tools for this paper

Explain it differently 1 free rewrite left today
Save to a collection Group papers in collections to compare them, chat with them and export them. Continue with Google Create a free account Log in

Advanced tools Premium

For researchers who follow a field closely: citation alerts, journal-club slides, version comparison and Zotero export. Discover Premium

Zotero Zotero guide
Citation alerts Citation alerts guide
Who works on it?

Among the 23 papers around this one, the name that comes back most: A. Bondarenko (3 papers)

4 more people sign several of them. The full map adds their institutions and approaches, from the papers of the last years.

Continue with Google Create a free account: your first map is free
Weekly letter Presented in "Mathematics and statistics this week" of 16 November 2026. Mathematics and statistics this week: Arithmetic, crystals and the limits of shape · Receive one by email for free

Papers around this one

See them on a map

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

Disclaimer: The AI-based summarization tool and virtual assistant provided on this website may not always provide accurate and complete summaries or responses. We encourage you to carefully review and evaluate the generated content to ensure its quality and relevance to your needs.