The Borsuk problem for \((0,1)\)-polyhedra and cross polytopes.
type: Item
instance of: scholarly article
title: The Borsuk problem for \((0,1)\)-polyhedra and cross polytopes.
zbMATH Open document ID: 1062.52019
published in: Doklady Mathematics
publication date: 2004-06-15T00:00:00Z
review text: The author states three results that provide upper estimates for the minimum number \(d\) such that any set in Euclidean \(d\)-dimensional space can be partitioned into subsets of smaller diameter. The results are stated without proof but the author explains that they can be obtained using results and techniques arising from the treatment of the covering problem.
Mathematics Subject Classification ID: 52C17
Mathematics Subject Classification ID: 52B11
Mathematics Subject Classification ID: 51A20
zbMATH DE Number: 2074558
zbMATH Keywords: upper estimate
zbMATH Keywords: Borsuk problem
zbMATH Keywords: covering problem
author: Andrei M. Raigorodskii
reviewed by: Maria do Rosário Pinto
MaRDI profile type: Publication
Recommended article: Borsuk's problem for \((0,1)\)-polytopes and cross-polytopes
Recommended article: Q5460301
Recommended article: Q4463737
Recommended article: On the Borsuk and Grünbaum problems for \((0,1)\)- and \((-1,0,1)\)-polytopes in low-dimensional spaces
Recommended article: The problems of Borsuk and Grunbaum on lattice polytopes
Recommended article: On the vertices of the \(d\)-dimensional Birkhoff polytope
Recommended article: Q3317689
Recommended article: The Orlicz-Minkowski problem for polytopes
Recommended article: The generalized Baues problem for cyclic polytopes. I
Recommended article: Q4319107
description: scientific article; zbMATH DE number 2074558