k-Regular maps into Euclidean spaces and the Borsuk-Boltyanskii problem
Journal Article
·
· Sbornik. Mathematics
- M.V. Lomonosov Moscow State University, Moscow (Russian Federation)
The Borsuk-Boltyanskii problem is solved for odd k, that is, the minimum dimension of a Euclidean space is determined into which any n-dimensional polyhedron (compactum) can be k-regularly embedded. A new lower bound is obtained for even k.
- OSTI ID:
- 21205664
- Journal Information:
- Sbornik. Mathematics, Vol. 193, Issue 1; Other Information: DOI: 10.1070/SM2002v193n01ABEH000620; Country of input: International Atomic Energy Agency (IAEA); ISSN 1064-5616
- Country of Publication:
- United States
- Language:
- English
Similar Records
The Borsuk problem for integral polytopes
Estimating the chromatic numbers of Euclidean space by convex minimization methods
Topics in computational geometry
Journal Article
·
Thu Oct 31 00:00:00 EST 2002
· Sbornik. Mathematics
·
OSTI ID:21205664
Estimating the chromatic numbers of Euclidean space by convex minimization methods
Journal Article
·
Tue Jun 30 00:00:00 EDT 2009
· Sbornik. Mathematics
·
OSTI ID:21205664
+1 more
Topics in computational geometry
Technical Report
·
Wed Feb 01 00:00:00 EST 1978
·
OSTI ID:21205664