Partition bounded sets into sets having smaller diameters
From MaRDI portal
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 holds for each by applying the first method, and we proved that whenever is a three-dimensional Banach space satisfying , where is the unit ball of , by applying the second method. These results and methods are closely related to the extension of Borsuk's problem in finite dimensional Banach spaces and to C. Zong's computer program for Borsuk's conjecture.
Recommendations
- On dividing sets into parts of smaller diameter
- Partitioning into sets of bounded cardinality
- Partitions with bounded differences between largest and smallest parts
- Partition of three-dimensional sets into five parts of smaller diameter
- Partitions into distinct parts with bounded largest part
- scientific article; zbMATH DE number 710123
- Partitioning multi-dimensional sets in a small number of ``uniform parts
- Partitions of a finite set into structured subsets
Cites work
- A 64-dimensional counterexample to Borsuk's conjecture
- A quantitative program for Hadwiger's covering conjecture
- Combinatorial problems on the illumination of convex bodies
- Constructions of complete sets
- Covering a plane convex body by four homothetical copies with the smallest positive ratio
- Covering a Three-Dimensional set with Sets of Smaller Diameter
- Covering planar sets
- Drei Sätze über die n-dimensionale euklidische Sphäre
- Excursions into combinatorial geometry
- scientific article; zbMATH DE number 6381834 (Why is no real title available?)
- scientific article; zbMATH DE number 3122841 (Why is no real title available?)
- scientific article; zbMATH DE number 3140977 (Why is no real title available?)
- scientific article; zbMATH DE number 3165122 (Why is no real title available?)
- scientific article; zbMATH DE number 3812415 (Why is no real title available?)
- scientific article; zbMATH DE number 3905351 (Why is no real title available?)
- scientific article; zbMATH DE number 177380 (Why is no real title available?)
- scientific article; zbMATH DE number 194266 (Why is no real title available?)
- Illuminating sets of constant width
- Measures of symmetry for convex sets and stability
- On Borsuk's conjecture for two-distance sets
- On the blocking number and the covering number of a convex body
- Partition of three-dimensional sets into five parts of smaller diameter
- Research Problems in Discrete Geometry
- Sets of constant width in finite dimensional Banach spaces
- Stability for some extremal properties of the simplex
- The asymmetry of complete and constant width bodies in general normed spaces and the Jung constant
- The geometry of homothetic covering and illumination
- Zum Borsukschen Zerteilungsproblem
- Über Durchschnittseigenschaften n-dimensionaler Kugelfamilien.
Cited in
(9)- Coverings of planar and three-dimensional sets with subsets of smaller diameter
- Borsuk's partition problem in ℓₚ⁴
- Borsuk's problem, Boltyanski's illumination problem, and circumradius
- Complete sets in normed linear spaces
- Banach-Mazur distance from \(\ell_p^3\) to \(\ell_\infty^3\)
- On Boltyanski and Gohberg's partition conjecture
- Partitioning bounded sets in symmetric spaces into subsets with reduced diameter
- Optimal partitions of the flat torus into parts of smaller diameter
- On upper bounds for the number of parts in the problem of partitioning sets into parts of smaller diameter
This page was built for publication: Partition bounded sets into sets having smaller diameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2038870)