Reducing the upper bound for the Borsuk number in R4 to 8

Abstract

The Borsuk number b(n) of n-dimensional Euclidean space Rn is the smallest integer such that any set F ⊂ Rn of unit diameter can be partitioned into b(n) subsets of strictly smaller diameter. For n=4, the best known upper bound b(4) ≤ 9 follows from a construction by M. Lassak (1982). In the present paper, we construct partitions of several variants of the truncated Lassak cover into 8 parts of diameter less than 1, thereby showing that b(4) ≤ 8.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…