Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2508.19362

Geodesic complexity of the octahedron, and an algorithm for cut loci on convex polyhedra

Florian Frick·Pranav Rajbhandari
View original source ↗Read source document ↗Export metadata ↓

Abstract

The geodesic complexity of a length space $X$ quantifies the required number of case distinctions to continuously choose a shortest path connecting any given start and end point. We prove a local lower bound for the geodesic complexity of $X$ obtained by embedding simplices into $X\times X$. We additionally create and prove correctness of an algorithm to find cut loci on surfaces of convex polyhedra, as the structure of a space's cut loci is related to its geodesic complexity. We use these techniques to prove the geodesic complexity of the octahedron is four. Our method is inspired by earlier work of Recio-Mitter and Davis, and thus recovers their results on the geodesic complexity of the $n$-torus and the tetrahedron, respectively.

Explore related subjects

math.MGcs.CG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Florian Frick, Pranav Rajbhandari. 2025-09-11. Geodesic complexity of the octahedron, and an algorithm for cut loci on convex polyhedra. https://arxiv.org/abs/2508.19362

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Equilibrium Laws for Julia's Zero and the Hyperbolic Zero of Binary Forms

For a real binary form with no real roots, Julia's zero and the hyperbolic zero are two SL(2,R)-equivariant points in the upper half-plane. We show that they admit closely related equilibrium characterizations, with radial weights given respectively by the hyperbolic tangent and hyperbolic sine of the distances to the roots. This common framework gives geometric criteria for coincidence of the two zero maps. They always agree for binary quartics; for binary sextics they agree exactly when the three upper-half-plane roots form an equilateral hyperbolic triangle, or are collinear with one root the hyperbolic midpoint of the other two. We also obtain a corresponding result for collinear binary octics. The two equilibrium laws further reveal a sharp difference in the influence of distant roots. A strict majority of roots confined to a compact set keeps Julia's zero in a compact set, and the threshold one-half is optimal. In contrast, an escaping minority can force the hyperbolic zero to escape at linear scale. We also illustrate the computational advantages of the explicit formula for the hyperbolic zero.

math.MG↗
arXiv2026

Hopf quotients of the infinite-dimensional Gaussian pyramid

We study the infinite-dimensional Gaussian pyramid and its quotients by the global sign flip and the $U(1)$-Hopf action. We resolve affirmatively a long-standing problem posed by Tomohiro Fukaya around 2014: these three limiting geometries are pairwise non-similar, meaning that no positive rescaling makes any two of them coincide.

math.MG↗
arXiv2026

The topology of Gromov--Hausdorff space

We prove that the space of isometry classes of nonempty compact metric spaces, equipped with the Gromov--Hausdorff distance, is homeomorphic to the real separable infinite-dimensional Hilbert space. We construct a continuous assignment of full-support probability measures that is equivariant under isometries and finite-dimensional local approximations that control all pairwise distances. These approximations yield the absolute retract property for all metrizable spaces. We also prove that any countable family of continuous maps from compact metrizable spaces can be approximated, with respect to a prescribed open cover, by maps whose images form a discrete family.

math.MG↗