English
Related papers

Related papers: Minimizing closed geodesics on polygons and disks

200 papers

Geodesics on Riemannian manifolds are precisely the locally length-minimizing curves, but their explicit description via simple functions is rarely possible. Geodesics of the simplest form, such as lines on Euclidean space and great circles…

Differential Geometry · Mathematics 2025-07-16 Nikolaos Panagiotis Souris

What is the minimal size quantum circuit required to exactly implement a specified n-qubit unitary operation, U, without the use of ancilla qubits? We show that a lower bound on the minimal size is provided by the length of the minimal…

Quantum Physics · Physics 2007-05-23 Michael A. Nielsen

We consider the problem $\min\int_{\mathbb{R}} \frac{1}{2}|\dot{\gamma}|^2+W(\gamma)\mathop{}\mathopen{}\mathrm{d} t $ among curves connecting two given wells of $W\geq 0$ and we reduce it, following a standard method, to a geodesic problem…

Metric Geometry · Mathematics 2016-02-18 Antonin Monteil , Filippo Santambrogio

Suppose $M$ is a complete, non-compact $n$-dimensional Riemannian manifold with locally convex ends and finite volume. We prove that $M$ admits a non-trivial geodesic net with one vertex, at most $(n+2)(n+1)/2$ edges, and total length at…

Differential Geometry · Mathematics 2026-05-14 Isabel Beach

The multiway-cut problem is, given a weighted graph and k >= 2 terminal nodes, to find a minimum-weight set of edges whose removal separates all the terminals. The problem is NP-hard, and even NP-hard to approximate within 1+delta for some…

Data Structures and Algorithms · Computer Science 2015-06-02 David Karger , Phil Klein , Cliff Stein , Mikkel Thorup , Neal E. Young

For metric spaces with curvature less than or equal to x, x<0, it is shown that a recurrent geodesic can be approximated by closed geodesics. A counter example is provided for the converse.

Geometric Topology · Mathematics 2007-05-23 Ch. Charitos , G. Tsapogas

This paper proves an elementary topological fact about closed curves on surfaces, namely that by carefully smoothing an intersection point, one can reduce self-intersection by exactly $1$. This immediately implies a positive answer to a…

Geometric Topology · Mathematics 2023-09-13 Hugo Parlier

We show that efficient geodesics have the strong property of "super efficiency". For any two vertices, $v , w \in \mathcal{C}(S_g)$, in the complex of curves of a closed oriented surface of genus $g \geq 2 $, and any efficient geodesic, $v…

Geometric Topology · Mathematics 2023-05-24 Xifeng Jin , William W. Menasco

We prove three facts about intrinsic geometry of surfaces in a normed (Minkowski) space. When put together, these facts demonstrate a rather intriguing picture. We show that (1) geodesics on saddle surfaces (in a space of any dimension)…

Differential Geometry · Mathematics 2012-04-09 Dmitri Burago , Sergei Ivanov

We prove the existence of Alexandrov embedded closed magnetic geodesics on closed hyperbolic surfaces. Closed magnetic geodesics correspond to closed curves with prescribed geodesic curvature.

Differential Geometry · Mathematics 2014-02-26 Matthias Schneider

Let $\mathcal{H}$ be a reproducing kernel Hilbert space of functions on a set $X$. We study the problem of finding a minimal geodesic of the Grassmann manifold of $\mathcal{H}$ that joins two subspaces consisting of functions which vanish…

Functional Analysis · Mathematics 2020-08-03 Esteban Andruchow , Eduardo Chiumiento , Alejandro Varela

In this paper, free boundary geodesic networks whose length realize the first min-max width of the length functional are investigated. This functional acts on the space of relative flat 1-dimensional cycles modulo 2 in a compact surface…

Differential Geometry · Mathematics 2022-11-29 Sidney Donato , Rafael Montezuma

Given a point $s$ and a set of $h$ pairwise disjoint polygonal obstacles of totally $n$ vertices in the plane, we present a new algorithm for building an $L_1$ shortest path map of size O(n) in $O(T)$ time and O(n) space such that for any…

Computational Geometry · Computer Science 2012-02-28 Danny Z. Chen , Haitao Wang

The detour between two points u and v (on edges or vertices) of an embedded planar graph whose edges are curves is the ratio between the shortest path in in the graph between u and v and their Euclidean distance. The maximum detour over all…

Metric Geometry · Mathematics 2008-01-08 Adrian Dumitrescu , Annette Ebbers-Baumann , Ansgar Grüne , Rolf Klein , Günter Rote

The topological (resp. geodesic) complexity of a topological (resp. metric) space is roughly the smallest number of continuous rules required to choose paths (resp. shortest paths) between any points of the space. We prove that the geodesic…

Metric Geometry · Mathematics 2023-08-09 Donald M. Davis

We consider geodesics in both Riemannian and Lorentzian manifolds with metrics of low regularity. We discuss existence of extremal curves for continuous metrics and present several old and new examples that highlight their subtle…

Mathematical Physics · Physics 2019-05-03 Clemens Sämann , Roland Steinbauer

We show that any n-vertex graph without even cycles of length at most 2k has at most 1/2(n^{1 + 1/k}) + O(n) edges, and polarity graphs of generalized polygons show that this is asymptotically tight when k = 2,3,5.

Combinatorics · Mathematics 2007-05-23 Thomas Lam , Jacques Verstraete

We show that the minimum distance projection in the L1-norm from an interior point onto the boundary of a convex set is achieved by a single, unidimensional projection. Application of this characterization when the convex set is a…

Optimization and Control · Mathematics 2007-05-23 Hans J. H. Tuenter

Let $(\Sigma, g)$ be a closed, oriented, negatively curved surface, and fix pairwise disjoint simple closed geodesics $\gamma_{\star,1}, \dots \gamma_{\star, r}$. We give an asymptotic growth as $L \to +\infty$ of the number of primitive…

Dynamical Systems · Mathematics 2024-03-20 Yann Chaubet

K-geodetic graphs (K capital) are defined as graphs in which each pair of nonadjacent vertices has at most K paths of minimum length between them. A K-geodetic graph is geodetic if K=1, bigeodetic if K=2 and trigeodetic if K=3. K-geodetic…

Discrete Mathematics · Computer Science 2025-05-27 Carlos E. Frasser