Reducing the upper bound for the Borsuk number in $\mathbb{R}^4$ to 8

TL;DR

This paper improves the upper bound of the Borsuk number in four-dimensional space from 9 to 8 by constructing specific partitions of certain covers.

Contribution

It presents a new construction that reduces the known upper bound of the Borsuk number in  to 8, refining previous results.

Findings

Established that b(4)  8 using new partitions

Constructed partitions of variants of the Lassak cover

Demonstrated the improved upper bound for 

Abstract

The Borsuk number $b(n)$ of $n$-dimensional Euclidean space $\mathbb{R}^n$ is the smallest integer such that any set $F \subset \mathbb{R}^n$ of unit diameter can be partitioned into $b(n)$ subsets of strictly smaller diameter. For $n=4$, the best known upper bound $b(4) \leq 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) \leq 8$.