Papers
Topics
Authors
Recent
Search
2000 character limit reached

Geodesic complexity via fibered decompositions of cut loci

Published 15 Jun 2022 in math.GT, math.AT, and math.DG | (2206.07691v2)

Abstract: The geodesic complexity of a Riemannian manifold is a numerical isometry invariant that is determined by the structure of its cut loci. In this article we study decompositions of cut loci over whose components the tangent cut loci fiber in a convenient way. We establish a new upper bound for geodesic complexity in terms of such decompositions. As an application, we obtain estimates for the geodesic complexity of certain classes of homogeneous manifolds. In particular, we compute the geodesic complexity of complex and quaternionic projective spaces with their standard symmetric metrics.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.