Papers
Topics
Authors
Recent
Search
2000 character limit reached

Borsuk's Problem in Metric Spaces

Published 12 Oct 2022 in math.MG | (2210.06264v1)

Abstract: In 1933, K. Borsuk proposed the following problem: Can every bounded set in E<sup>n\mathbb{E}<sup>n be divided into n+1n+1 subsets of smaller diameters? In 1965, V. G. Boltyanski and I. T. Gohberg made the following conjecture: Every bounded set in an nn-dimensional metric space can be divided into $2n$ subsets of smaller diameters. In this paper, we prove the following result: Every bounded set in an nn-dimensional metric space can be divided into 2<sup>n((n+1)log</sup>(n+1)+(n+1)loglog(n+1)+5n+5)2<sup>{n}((n+1)\log</sup> (n+1)+(n+1)\log \log (n+1)+5n+5) subsets of smaller diameters.

Authors (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.