Related papers: Metric methods for heteroclinic connections
We consider $L^2$ minimizing geodesics along the group of volume preserving maps $SDiff(D)$ of a given 3-dimensional domain $D$. The corresponding curves describe the motion of an ideal incompressible fluid inside $D$ and are (formally)…
Geodesic distance serves as a reliable means of measuring distance in nonlinear spaces, and such nonlinear manifolds are prevalent in the current multimodal learning. In these scenarios, some samples may exhibit high similarity, yet they…
The aim of this note is to prove that any compact metric space can be made connected at a minimal cost, where the cost is taken to be the one-dimensional Hausdorff measure.
A smooth curve $\gamma: [0,1] \to S^2$ is locally convex if its geodesic curvature is positive at every point. J. A. Little showed that the space of all locally positive curves $\gamma$ with $\gamma(0) = \gamma(1) = e_1$ and $\gamma'(0) =…
Given a compact manifold with boundary with unknown Riemannian metric. The problem is to reconstruct the metric in a class of conformal metrics from knowledge of lengths of all closed geodesics (kinematic data). An integral inequality is…
In analogy with the well-known 2-linkage tractor-trailer problem, we define a 2-linkage problem in the plane with novel non-holonomic ``no-slip'' conditions. Using constructs from sub-Riemannian geometry, we look for geodesics corresponding…
Given an undirected connected graph $G = (V(G), E(G))$ on $n$ vertices, the minimum Monitoring Edge-Geodetic Set (MEG-set) problem asks to find a subset $M \subseteq V(G)$ of minimum cardinality such that, for every edge $e \in E(G)$, there…
The numerical computation of shortest paths or geodesics on surfaces, along with the associated geodesic distance, has a wide range of applications. Compared to Euclidean distance computation, these tasks are more complex due to the…
The connected $k$-median problem is a constrained clustering problem that combines distance-based $k$-clustering with connectivity information. The problem allows to input a metric space and an unweighted undirected connectivity graph that…
Distance geometry is the study of the arrangements of points in space using only the mutual distances between them. The basic idea in this letter is to use distance geometry for thermodynamics studies of small clusters in the microcanonical…
Suppose that $M$ is a $2$-dimensional oriented Riemannian manifold, and let $\gamma$ be a simple closed curve on $M$. Let $m \gamma$ denote the curve formed by tracing $\gamma$ $m$ times. We prove that if $m \gamma$ is contractible through…
Given a noncompact disconnected complete periodic curve $\Gamma$ with no self intersection in $\mathbb R^3$, it is proved that there exists a noncompact simply connected periodic minimal surface spanning $\Gamma$. As an application it is…
The quantum query complexity of subgraph-containment problems, which ask whether a given subgraph $H$ is present in an input graph $G$, has been the subject of considerable study. However, even for relatively simple subgraphs, such as paths…
In this paper we establish a relationship between geodesic nets and critical points of the distance function. We bound the number of balanced points for certain minimizing geodesic nets on manifolds homeomorphic to the $n$-sphere. We also…
We prove the existence of global minimizers to the double minimization problem \[ \inf\Big\{ P(E) + \lambda W_p(\mathcal{L}^n \lfloor \, E,\mathcal{L}^n \lfloor\, F) \colon |E \cap F| = 0, \, |E| = |F| = 1\Big\}, \] where $P(E)$ denotes the…
Given two points on a soup can or conical cup with lid, we find and classify all paths of minimal length connecting them. When the number of minimal paths is finite, there are at most four on a can and three on a cup. At worst, minimal…
Given an undirected graph $G$, a quasi-clique is a subgraph of $G$ whose density is at least $\gamma$ $(0 < \gamma \leq 1)$. Two optimization problems can be defined for quasi-cliques: the Maximum Quasi-Clique (MQC) Problem, which finds a…
We show that the simplest local search heuristics for two natural Euclidean clustering problems are PLS-complete. First, we show that the Hartigan--Wong method for $k$-Means clustering is PLS-complete, even when $k = 2$. Second, we show the…
We show that any set of distinct homotopy classes of simple closed curves on the torus that pairwise intersect at most $k$ times has size $k + O(\sqrt{k} \log k)$. Prior to this work, a lemma of Agol, together with the state of the art…
Wave Kinetic Equations (WKEs) are often used to describe the evolution of ensemble averaged wave amplitudes for nonlinear wave systems. In the present manuscript we describe a new approach to direct numerical simulation of solutions to…