Borsuk's partition problem and finite point sets
type: Item
instance of: scholarly article
title: Borsuk's partition problem and finite point sets
zbMATH Open document ID: 1402.52018
published in: Beiträge zur Algebra und Geometrie
publication date: 2018-11-02T00:00:00Z
review text: 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}\).
reviewed by: Süleyman Güler
Mathematics Subject Classification ID: 52C17
Mathematics Subject Classification ID: 54E45
zbMATH DE Number: 6971510
zbMATH Keywords: compact metric space
zbMATH Keywords: Borsuk's partition problem
author: Theo Grundhöfer
MaRDI profile type: Publication
full work available at URL: s13366-018-0390-x
OpenAlex ID: W2794057579
cites work: Geometry. I, II. Transl. from the French by M. Cole and S. Levy
cites work: On Borsuk's conjecture for two-distance sets
cites work: Drei Sätze über die n-dimensionale euklidische Sphäre
cites work: Q5881899
cites work: Two hypergraph theorems equivalent to BPI
cites work: Q5808059
cites work: Q4871765
cites work: Q5530342
cites work: Q3263885
cites work: A 64-dimensional counterexample to Borsuk's conjecture
cites work: Q5881888
cites work: A counterexample to Borsuk’s conjecture
cites work: Some old and new problems in combinatorial geometry I: around Borsuk's problem
cites work: Problems and theorems in classical set theory
cites work: Coloring infinite graphs and the Boolean prime ideal theorem
cites work: Über die Bedeckung ebener Punktmengen durch solche kleineren Durchmessers
cites work: Q3880849
cites work: On the chromatic numbers of integer and rational lattices
cites work: Q5301263
cites work: Realization of all distances in a decomposition of the space \(R^ n\) into \(n+1\) parts
cites work: The Mathematical Coloring Book
cites work: Q5592127
cites work: Distances realized by sets covering the plane
cites work: Q4542184
cites work: A quantitative program for Hadwiger's covering conjecture
DOI: 10.1007/S13366-018-0390-X
Recommended article: Q5310620
Recommended article: On a bound in Borsuk's problem
Recommended article: Q4328207
Recommended article: Around Borsuk's hypothesis
Recommended article: On the Borsuk problem in \(\mathbb R^ 3\).
Recommended article: Some old and new problems in combinatorial geometry I: around Borsuk's problem
Recommended article: Partition of three-dimensional sets into five parts of smaller diameter
Recommended article: On the multiple Borsuk numbers of sets
Recommended article: On Borsuk's conjecture for two-distance sets
Recommended article: Le couvercle circulaire
description: scientific article; zbMATH DE number 6971510