Borsuk's partition problem in four-dimensional $\ell_{p}$ space
Jun Wang, Fei Xue

TL;DR
This paper investigates Borsuk's partition problem in four-dimensional $ ext{l}_p$ spaces, establishing that all bounded sets can be partitioned into 16 smaller-diameter subsets, advancing understanding in geometric partitioning.
Contribution
It extends Borsuk's conjecture to four-dimensional $ ext{l}_p$ spaces for $1 \\leq p < 2$, proving a specific partition result for these spaces.
Findings
All bounded sets in 4D $ ext{l}_p$ spaces can be divided into 16 smaller-diameter subsets.
Analyzes the Banach-Mazur distance between the cube and $ ext{l}_p$ ball.
Generalizes Borsuk's partition problem to metric spaces.
Abstract
In 1933, Borsuk made a conjecture that every -dimensional bounded set can be divided into subsets of smaller diameter. Up to now, the problem is still open for . In this paper, we firstly discuss the Banach-Mazur distance between the -dimensional cube and the ball , then we study the generalized Borsuk's partition problem in metric spaces and prove that all bounded sets in every four-dimensional space can be divided into subsets of smaller diameter.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPoint processes and geometric inequalities
