Papers
Topics
Authors
Recent
Search
2000 character limit reached

Geodesic complexity of a tetrahedron

Published 19 Jun 2023 in math.MG and math.AT | (2306.11059v1)

Abstract: We prove that the geodesic complexity of a regular tetrahedron exceeds its topological complexity by 1 or 2. The proof involves a careful analysis of minimal geodesics on the tetrahedron.

Authors (1)
Citations (1)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

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

Sign Up to Generate

Open Problems

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

Generate Now

Continue Learning

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

Generate Now

Collections

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

Sign Up