Related papers: Minimizing closed geodesics on polygons and disks
We prove upper bounds for the Morse index and number of intersections of min-max geodesics achieving the $p$-widths of a closed surface. A key tool in our analysis is a proof that for a generic set of metrics, the tangent cone at any vertex…
We give an accessible introduction and elaboration on the methods used in obtaining a geodesic, which is the curve of shortest length connecting two points lying on the surface of a function. This is found through computing what's known as…
We find geodesics, shortest arcs, cut loci, first conjugate loci for some left-invariant sub-Riemannian metrics on the Lie groups $SU(1,1)\times\mathbb{R}$ and $SO_0(2,1)\times\mathbb{R}$.
An important problem in computational arithmetic geometry is to find changes of coordinates to simplify a system of polynomial equations with rational coefficients. This is tackled by a combination of two techniques, called minimisation and…
On a surface with a Finsler metric, we investigate the asymptotic growth of the number of closed geodesics of length less than $L$ which minimize length among all geodesic multicurves in the same homology class. An important class of…
We consider the following questions: given a hyperbolic plane domain and a separation of its complement into two disjoint closed sets each of which contains at least two points, what is the shortest closed hyperbolic geodesic which…
A quasigeodesic is a curve on the surface of a convex polyhedron that has $\le \pi$ surface to each side at every point. In contrast, a geodesic has exactly $\pi$ to each side and so can never pass through a vertex, whereas quasigeodesics…
The m-thick part of the modular surface X is the smallest compact subsurface of X with horocycle boundary containing all the closed geodesics which wind around the cusp at most m times. The m-thick parts form a compact exhaustion of X. We…
We show that every closed Lorentzian surface contains at least two closed geodesics. Explicit examples show the optimality of this claim. Refining this result we relate the least number of closed geodesics to the causal structure of the…
We give an algorithm to compute the stable lengths of pseudo-Anosovs on the curve graph, answering a question of Bowditch. We also give a procedure to compute all invariant tight geodesic axes of pseudo-Anosovs. Along the way we show that…
We study configurations of immersed curves in surfaces and surfaces in 3-manifolds. Among other results, we show that primitive curves have only finitely many configurations which minimize the number of double points. We give examples of…
The space $J^k$ of $k$-jets of a real function of one real variable $x$ admits the structure of Carnot group type. As such, $J^k$ admits a submetry (\sR submersion) onto the Euclidean plane. Horizontal lifts of Euclidean lines (which are…
We obtain bounds on the numbers of intersections between triangulations as the conformal structure of a surface varies along a Teichm{\"u}ller geodesic contained in an $\mathrm{SL}\left(2,\mathbb{R}\right)$-orbit closure of rank 1 in the…
Benguria and Loss have conjectured that, amongst all smooth closed curves of length $2\pi$ in the plane, the lowest possible eigenvalue of the operator $L=-\Delta+\kappa^2$ was one. They observed that this value was achieved on a…
We show that for any pair of long enough parallel geodesics in a random group $G_\ell(m,d)$ with $m$ generators at density $d<1/6$, there is a van Kampen diagram having only one layer of faces. Using this result, we give an upper bound,…
Manifolds discovered by machine learning models provide a compact representation of the underlying data. Geodesics on these manifolds define locally length-minimising curves and provide a notion of distance, which are key for reduced-order…
We present an elementary criterion to show the length-minimizing property of geodesics for a large class of conformal metrics. In particular, we prove the length-minimizing property of level curves of harmonic functions and the…
A graph $G$ is geodetic if between any two vertices there exists a unique shortest path. In 1962 Ore raised the challenge to characterize geodetic graphs, but despite many attempts, such characterization still seems well beyond reach. We…
In this paper, we study the problem of computing Euclidean geodesic centers of a polygonal domain $\mathcal{P}$ with a total of $n$ vertices. We discover many interesting observations. We give a necessary condition for a point being a…
We investigate the rudiments of Riemannian geometry on orbit spaces $M/G$ for isometric proper actions of Lie groups on Riemannian manifolds. Minimal geodesic arcs are length minimising curves in the metric space $M/G$ and they can hit…