Related papers: Minimizing geodesic nets and critical points of di…
Let $f:M^m\to N^n$ be a smooth map between two differential manifolds with $N$ connected, $f(M)$ closed and $f(M)\neq N$. In this short note, we show that either all the points of $M$ are critical points of $f$ or the dimension the…
We give a lower bound for the length of a non-trivial geodesic loop on a simply-connected and compact manifold of even dimension with a non-reversible Finsler metric of positive flag curvature. Harris and Paternain use this estimate in…
A directed network connecting a set A to a set B is a digraph containing an a-b path for each a in A and b in B. Vertices in the directed network not in A or B are called Steiner points. We show that in a finitely compact metric space in…
We derive the exact generating function for planar maps (genus zero fatgraphs) with vertices of arbitrary even valence and with two marked points at a fixed geodesic distance. This is done in a purely combinatorial way based on a bijection…
A geodesic cycle is a closed curve that connects finitely many points along geodesics. We study geodesic cycles on the sphere in regard to their role in equal-weight quadrature rules and approximation.
The paper is devoted to the study of geodesic orbit Riemannian metrics on nilpotent Lie groups. The main result is the construction of continuous families of pairwise non-isomorphic connected and simply connected nilpotent Lie groups, every…
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…
The directed landscape is a random directed metric on the plane that arises as the scaling limit of metric models in the KPZ universality class. For a pair of points p, q, the disjointness gap G(p; q) measures the shortfall when we optimize…
A fundamental problem in network science is the normalization of the topological or physical distance between vertices, that requires understanding the range of variation of the unnormalized distances. Here we investigate the limits of the…
We give a metric characterization of the Euclidean sphere in terms of the lower bound of the sectional curvature and the length of the shortest closed geodesics.
We give a metric characterization of the Euclidean sphere in terms of the lower bound of the sectional curvature and the length of the shortest closed geodesics.
Critical points of an invariant function may or may not be symmetric. We prove, however, that if a symmetric critical point exists, those adjacent to it are generically symmetry breaking. This mathematical mechanism is shown to carry…
Consider the continuum of points along the edges of a network, i.e., a connected, undirected graph with positive edge weights. We measure the distance between these points in terms of the weighted shortest path distance, called the network…
In this short note, we show that the distance function to any finite set $X\subset \mathbb{R}^n$ is a topological Morse function, regardless of whether $X$ is in general position. We also precisely characterize its topological critical…
We study the statistical properties of geodesics, i.e. paths of minimal length, in large random planar quadrangulations. We extend Schaeffer's well-labeled tree bijection to the case of quadrangulations with a marked geodesic, leading to…
By "geodesic" we mean any sequence of vertices $(v_1,v_2,...,v_k)$ of a graph $G$ that constitute a shortest path from $v_1$ to $v_k$. We propose a novel, natural algorithm to enumerate all geodesics of $G$, and pit it (using Mathematica)…
We consider the Keplerian distance $d$ in the case of two elliptic orbits, i.e. the distance between one point on the first ellipse and one point on the second one, assuming they have a common focus. The absolute minimum $d_{\rm min}$ of…
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…
In general, the critical points of the distance function $d_{\mathsf{M}}$ to a compact submanifold $\mathsf{M} \subset \mathbb{R}^D$ can be poorly behaved. In this article, we show that this is generically not the case by listing regularity…
A half-geodesic is a closed geodesic realizing the distance between any pair of its points. All geodesics in a round sphere are half-geodesics. Conversely, this note establishes that Riemannian spheres with all geodesics closed and…