The geodesic complexity of n-dimensional Klein bottles
From MaRDI portal
Publication:1998989
Abstract: The geodesic complexity of a metric space X is the smallest k for which there is a partition of X x X into ENRs E_0,...,E_k on each of which there is a continuous choice of minimal geodesic sigma(x_0,x_1) from x_0 to x_1. We prove that the geodesic complexity of an n-dimensional Klein bottle equals 2n. Its topological complexity remains unknown for n>2.
Recommendations
Cites work
Cited in
(12)- An \(n\)-dimensional Klein bottle
- Geodesic complexity of homogeneous Riemannian manifolds
- Geodesic complexity of a cube
- Geodesic complexity of a tetrahedron
- Geodesic complexity via fibered decompositions of cut loci
- Geodesics in the configuration spaces of two points in \(\mathbb{R}^n\)
- Geodesic complexity for non-geodesic spaces
- Two robots moving geodesically on a tree
- Different types of topological complexity based on higher homotopic distance
- Geodesic complexity
- Geodesic complexity of motion planning
- Topological complexity of the Klein bottle
This page was built for publication: The geodesic complexity of \(n\)-dimensional Klein bottles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1998989)