加载中…
The Borsuk number of -dimensional Euclidean space is the smallest integer such that any set of unit diameter can be partitioned into subsets of strictly smaller diameter. For , the best known upper bound 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 .

生成讲解博客的中文版本

生成AI智能校验的中文版本