Borsuk's partition problem and finite point sets
In his famous paper [Fundam. Math. 20, 177--190 (1933; Zbl 0006.42403)], \textit{K. Borsuk} asked if every bounded subset \(X\) of \(\mathbb{R}^{n}\) can be decomposed into \(n+1\) subsets with diameters smaller than \(\operatorname{diam} X\). In this paper, the author shows that this is equivalent to a similiar question on finite subsets of \(\mathbb{R}^{n}\) or of \(\mathbb{Z}^{n}\) by a general result of the following theorem on coverings of compact metric spaces. Let \(Y\) be a compact metric space, \(k\in\mathbb{N}\) and \(t\in\mathbb{R}\). Then the following statements are equivalent: {\parindent=0.7cm\begin{itemize}\item[(i)] Every subset \(X \subseteq Y\) with \(\operatorname{diam}X=1 \) is the union of \( k \) subsets with diameters smaller than \( t \). \item [(ii)] Every countable subset \(X \subseteq Y\) with \( \operatorname{diam} X=1 \) is the union of \( k \) subsets with diameters smaller than \( t \). \item [(iii)] For some real number \(c<t\), every subset \(X \subseteq Y\) with \(\operatorname{diam} X=1 \) is the union of \( k \) subsets with diameters at most \( c \). \item[(iv)] For some real number \(c<t\), every finite subset \(X \subseteq Y\) with \(\operatorname{diam} X=1 \) is the union of \( k \) subsets with diameters at most \( c \). \end{itemize}} If these conditions hold, then one can take the same constant \( c \) in (iii) and (iv). Moreover, the author also considers Borsuk's problem in \(\mathbb{Q}^{4}\).
- Borsuk's problem
- On a bound in Borsuk's problem
- scientific article; zbMATH DE number 739040
- Around Borsuk's hypothesis
- On the Borsuk problem in \(\mathbb R^ 3\).
- Some old and new problems in combinatorial geometry. I: Around Borsuk's problem
- Partition of three-dimensional sets into five parts of smaller diameter
- On the multiple Borsuk numbers of sets
- On Borsuk's conjecture for two-distance sets
- The circular cover
- A 64-dimensional counterexample to Borsuk's conjecture
- A counterexample to Borsuk’s conjecture
- A quantitative program for Hadwiger's covering conjecture
- Coloring infinite graphs and the Boolean prime ideal theorem
- Distances realized by sets covering the plane
- Drei Sätze über die n-dimensionale euklidische Sphäre
- Geometry. I, II. Transl. from the French by M. Cole and S. Levy
- scientific article; zbMATH DE number 3145756 (Why is no real title available?)
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- scientific article; zbMATH DE number 1775058 (Why is no real title available?)
- scientific article; zbMATH DE number 863486 (Why is no real title available?)
- scientific article; zbMATH DE number 3243107 (Why is no real title available?)
- scientific article; zbMATH DE number 3311627 (Why is no real title available?)
- scientific article; zbMATH DE number 3068973 (Why is no real title available?)
- scientific article; zbMATH DE number 7662655 (Why is no real title available?)
- scientific article; zbMATH DE number 7662665 (Why is no real title available?)
- On Borsuk's conjecture for two-distance sets
- On the chromatic numbers of integer and rational lattices
- Problems and theorems in classical set theory
- Realization of all distances in a decomposition of the space \(R^ n\) into \(n+1\) parts
- Some old and new problems in combinatorial geometry. I: Around Borsuk's problem
- The Mathematical Coloring Book
- Three lectures on the Borsuk partition problem
- Two hypergraph theorems equivalent to BPI
- Über die Bedeckung ebener Punktmengen durch solche kleineren Durchmessers
This page was built for publication: Borsuk's partition problem and finite point sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1992189)
