Related papers: Geodesic complexity for non-geodesic spaces
Machine learning problems have an intrinsic geometric structure as central objects including a neural network's weight space and the loss function associated with a particular task can be viewed as encoding the intrinsic geometry of a given…
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…
Nielsen's geometric approach offers a powerful framework for quantifying the complexity of unitary transformations. In this formulation, complexity is defined as the length of the minimal geodesic in a suitably constructed geometric space…
We first study the higher version of the relative topological complexity by using the homotopic distance. We also introduced the generalized version of the relative topological complexity of a topological pair on both the Schwarz genus and…
A vertex set $S$ of a graph $G$ is geodetic if every vertex of $G$ lies on a shortest path between two vertices in $S$. Given a graph $G$ and $k \in \mathbb N$, the NP-hard Geodetic Set problem asks whether there is a geodetic set of size…
Digital topology has its own working conditions and sometimes differs from the normal topology. In the area of topological robotics, we have important counterexamples in this study to emphasize this red line between a digital image and a…
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…
In this work, we propose to study the global geometrical properties of generative models. We introduce a new Riemannian metric to assess the similarity between any two data points. Importantly, our metric is agnostic to the parametrization…
We define and study complex structures and generalizations on spaces consisting of geodesics or harmonic maps that are compatible with the symmetries of these spaces. The main results are about existence and uniqueness of such structures.
Geometric morphisms between realizability toposes are studied in terms of morphisms between partial combinatory algebras (pcas). The morphisms inducing geometric morphisms (the {\em computationally dense\/} ones) are seen to be the ones…
Geodesics are studied in one of the Weyl metrics, referred to as the M--Q solution. First, arguments are provided, supporting our belief that this space--time is the more suitable (among the known solutions of the Weyl family) for…
Geodesic problems involve computing trajectories between prescribed initial and final states to minimize a user-defined measure of distance, cost, or energy. They arise throughout physics and engineering -- for instance, in determining…
I introduce a family of closeness functions between causal Lorentzian geometries of finite volume and arbitrary underlying topology. When points are randomly scattered in a Lorentzian manifold, with uniform density according to the volume…
The \textsc{Mutual Visibility} is a well-known problem in the context of mobile robots. For a set of $n$ robots disposed in the Euclidean plane, it asks for moving the robots without collisions so as to achieve a placement ensuring that no…
In this paper, we study the geometry of non-Archimedean Gromov-Hausdorff metric. This is the first part of our series work, which we try to establish some facts about the counterpart of Gromov-Hausdorff metric in the non-Archimedean spaces.…
We determine explicit formulas for geodesics (in the Euclidean metric) in the configuration space of ordered pairs (x,x') of points in R^n which satisfy d(x,x')>=epsilon. We interpret this as two or three (depending on the parity of n)…
Convex optimization is a vibrant and successful area due to the existence of a variety of efficient algorithms that leverage the rich structure provided by convexity. Convexity of a smooth set or a function in a Euclidean space is defined…
We prove the Morse relations for the set of all geodesics connecting two non-conjugate points on a class of globally hyperbolic Lorentzian manifolds. We overcome the difficulties coming from the fact that the Morse index of every geodesic…
In algorithms for finite metric spaces, it is common to assume that the distance between two points can be computed in constant time, and complexity bounds are expressed only in terms of the number of points of the metric space. We…
The concept of quasi-partial b-metric-like spaces is being introduced and studied with the help of topology. Examples are also discussed to support the results. Some fixed point theorems are proved in the setting of quasi-partial…