Divide bounded sets into sets having smaller diameters
Yanlu Lian, Senlin Wu

TL;DR
This paper investigates how to partition bounded sets in finite-dimensional Banach spaces into smaller diameter subsets, introducing methods to estimate the minimal possible diameters and exploring their stability and applications to Borsuk's problem.
Contribution
It introduces two new methods for estimating the minimal diameters in set partitions within Banach spaces and analyzes their stability and applications to Borsuk's problem.
Findings
Established bounds for eta(l_p^3,8) 0.925 for all p
Proved eta(X,8) < 1 for certain 3D Banach spaces
Linked results to Borsuk's problem and Zong's computational approach
Abstract
For each positive integer and each real finite dimensional Banach space , we set to be the infimum of such that each set having diameter can be represented as the union of subsets of whose diameters are at most . Elementary properties of , including its stability with respect to in the sense of Banach-Mazur metric, are presented. Two methods for estimating are introduced. The first one estimates using the knowledge of , where is a Banach space sufficiently close to . The second estimation uses the information about , the infimum of such that is the union of subsets having diameters not greater than times the diameter of , for certain classes of convex bodies in . In particular, we show that…
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
TopicsAdvanced Topology and Set Theory · Point processes and geometric inequalities · Analytic and geometric function theory
