Related papers: Geodesic paths in the finite dimensional unit sphe…

The length of the geodesic between two data points along a Riemannian manifold, induced by a deep generative model, yields a principled measure of similarity. Current approaches are limited to low-dimensional latent spaces, due to the…

The aim of this paper is to extend the definition of geodesics to conical manifolds, defined as submanifolds of $\R^n$ with a finite number of singularities. We look for an approach suitable both for the local geodesic problem and for the…

Let $S$ be an oriented surface of type $(g, n)$. We are interested in geodesics in the curve complex $\mathcal C(S)$ of $S$. In general, two $0$-simplexes in $\mathcal C(S)$ have infinitely many geodesics connecting the two simplexes while…

Given a graph, the shortest-path problem requires finding a sequence of edges with minimum cumulative length that connects a source vertex to a target vertex. We consider a variant of this classical problem in which the position of each…

Let $\Omega$ be a connected open set in the plane and $\gamma: [0,1] \to \overline{\Omega}$ a path such that $\gamma((0,1)) \subset \Omega$. We show that the path $\gamma$ can be ``pulled tight'' to a unique shortest path which is homotopic…

We study the order of lengths of closed geodesics on hyperbolic surfaces. Our first main result is that the order of lengths of curves determine a point in Teichm\"uller space. In an opposite direction, we identify classes of curves whose…

We describe the invariant metrics on real flag manifolds and classify those with the following property: every geodesic is the orbit of a one-parameter subgroup. Such a metric is called g.o. (geodesic orbit). In contrast to the complex…

We prove rigidity for hypersurfaces with boundary in the unit $(n+1)$-sphere with scalar curvature bounded below by $n(n-1)$. Under appropriate boundary conditions, the hypersurfaces are shown to be part of the equatorial spheres. The lower…

We introduce the heat method for computing the shortest geodesic distance to a specified subset (e.g., point or curve) of a given domain. The heat method is robust, efficient, and simple to implement since it is based on solving a pair of…

We investigate local and global properties of timelike geodesics in three static spherically symmetric spacetimes. These properties are of its own mathematical relevance and provide a solution of the physical `twin paradox' problem. The…

Variational analysis presents a unified theory encompassing in particular both smoothness and convexity. In a Euclidean space, convex sets and smooth manifolds both have straightforward local geometry. However, in the most basic hybrid case…

We classify, in terms of topology of highest arcs, low height non-simple geodesics on the modular hyperbolic punctured sphere with three elliptic fixed points of order two. Of eight possible types, exactly one consists of geodesics that…

In this paper the space of images is considered as a Riemannian manifold using the metamorphosis approach, where the underlying Riemannian metric simultaneously measures the cost of image transport and intensity variation. A robust and…

A set S of vertices of a graph G is a geodesic transversal of G if every maximal geodesic of G contains at least one vertex of S. We determine a smallest geodesic transversal in certain interconnection networks such as mesh of trees, and…

It is proved that the number of shortest paths between two vertices of distance $t$ in a graph with degrees bounded by $\Delta$ is at most $2 \cdot (\frac{\Delta}{2})^t$. This improves upon the na\"ive $\Delta (\Delta-1) ^{t-1}$ bound.

Let $S$ be a complete flat surface, such as the Euclidean plane. We determine the homeomorphism class of the space of all curves on $S$ which start and end at given points in given directions and whose curvatures are constrained to lie in a…

In this work we deal with the so-called path convexities, defined over special collections of paths. For example, the collection of the shortest paths in a graph is associated with the well-known geodesic convexity, while the collection of…

On a hyperbolic Riemann surface, given two simple closed geodesics that intersect $n$ times, we address the question of a sharp lower bound $L_n$ on the length attained by the longest of the two geodesics. We show the existence of a surface…

A path system $\mathscr{P}$ in a graph $G=(V,E)$ is a collection of paths, with exactly one path between any two vertices in $V$. A path system is said to be consistent if it is closed under subpaths. We say that a path system $\mathscr{P}$…

Geodesic orbit spaces (or g.o. spaces) are defined as those homogeneous Riemannian spaces $(M=G/H,g)$ whose geodesics are orbits of one-parameter subgroups of $G$. The corresponding metric $g$ is called a geodesic orbit metric. We study the…