The Borsuk problem for \((0,1)\)-polyhedra and cross polytopes. (Q1432248): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| (2 intermediate revisions by one other user not shown) | |||
| Property / author | |||
| Property / author: Andrei M. Raigorodskii / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Maria do Rosário Pinto / rank | |||
| Property / author | |||
| Property / author: Andrei M. Raigorodskii / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Maria do Rosário Pinto / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 03:20, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Borsuk problem for \((0,1)\)-polyhedra and cross polytopes. |
scientific article |
Statements
The Borsuk problem for \((0,1)\)-polyhedra and cross polytopes. (English)
0 references
15 June 2004
0 references
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.
0 references
upper estimate
0 references
Borsuk problem
0 references
covering problem
0 references
