arXiv · 2308.04316
Geodesic complexity of a cube
Abstract
The topological (resp. geodesic) complexity of a topological (resp. metric) space is roughly the smallest number of continuous rules required to choose paths (resp. shortest paths) between any points of the space. We prove that the geodesic complexity of a cube exceeds its topological complexity by exactly 2. The proof involves a careful analysis of cut loci of the cube.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Donald M. Davis. 2023-08-08. Geodesic complexity of a cube. https://arxiv.org/abs/2308.04316
Cite the original work for its findings. Save a collection to share your selection of sources.