English
Related papers

Related papers: Geodesics on Grushin spaces

200 papers

We describe the inverse image of the Riemannian exponential map at a basepoint of a compact symmetric space as the disjoint union of so called focal orbits through a maximal torus. These are orbits of a subgroup of the isotropy group acting…

Differential Geometry · Mathematics 2024-04-03 Lucas Seco , Mauro Patrão

Computing an array of all pairs of geodesic distances between the pixels of an image is time consuming. In the sequel, we introduce new methods exploiting the redundancy of geodesic propagations and compare them to an existing one. We show…

Discrete Mathematics · Computer Science 2020-08-03 Guillaume Noyel , Jesus Angulo , Dominique Jeulin

We study geodesically convex (g-convex) problems that can be written as a difference of Euclidean convex functions. This structure arises in several optimization problems in statistics and machine learning, e.g., for matrix scaling,…

Optimization and Control · Mathematics 2022-10-24 Melanie Weber , Suvrit Sra

In this note, we show that sub-Riemannian manifolds can contain branching normal minimizing geodesics. This phenomenon occurs if and only if a normal geodesic has a discontinuity in its rank at a non-zero time, which in particular for a…

Differential Geometry · Mathematics 2020-09-28 Thomas Mietton , Luca Rizzi

We resolve a longstanding open problem by reformulating the Grassmannian fusion frames to the case of mixed dimensions and show that this satisfies the proper properties for the problem. In order to compare elements of mixed dimension, we…

Functional Analysis · Mathematics 2019-11-14 Peter G. Casazza , John I. Haas , Joshua Stueck , Tin T. Tran

We define the notion of geodesic completeness for semi-Riemannian metrics of low regularity in the framework of the geometric theory of generalized functions. We then show completeness of a wide class of impulsive gravitational wave…

Differential Geometry · Mathematics 2015-01-30 Clemens Sämann , Roland Steinbauer

In $d$-dimensional space (over any field), given a set of lines, a joint is a point passed through by $d$ lines not all lying in some hyperplane. The joints problem asks to determine the maximum number of joints formed by $L$ lines, and it…

Combinatorics · Mathematics 2024-11-22 Hung-Hsun Hans Yu , Yufei Zhao

The Gromov-Hausdorff (GH) distance is traditionally used for measuring distances between metric spaces. It is defined as the minimal distortion of embedding one surface into the other, while the optimal correspondence can be described as…

Computational Geometry · Computer Science 2016-11-23 Gil Shamai , Ron Kimmel

Gravity is a phenomenon which arises due to the space-time geometry. The main equations that describe gravity are the Einstein equations. To understand the consequences of these field equations we need to calculate the free particle…

Differential Geometry · Mathematics 2023-08-01 Adrian Boitier , Shubhanshu Tiwari

The purpose of this work is the development of space-time discretization schemes for phase-field optimal control problems. First, a time discretization of the forward problem is derived using a discontinuous Galerkin formulation. Here, a…

Optimization and Control · Mathematics 2022-03-24 Denis Khimin , Marc C. Steinbach , Thomas Wick

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…

Geometric Topology · Mathematics 2013-05-16 Richard C. H. Webb

In the present paper, we obtain explicit formulae for geodesics in some left-invariant sub-Finsler problems on Heisenberg groups $\mathbb{H}_{2n+1}$. Our main assumption is the following: the compact convex set of unit velocities at…

Optimization and Control · Mathematics 2020-09-15 L. V. Lokutsievskiy

In many singular metric spaces, the regularity of a shortest-length curve is unknown. Algebraic varieties, or more generally sets defined by finitely many polynomial or real analytic equalities or inequalities, all locally partition into…

Differential Geometry · Mathematics 2023-01-30 Chengcheng Yang

We describe the geometry of geodesics on a Lorentz ellipsoid: give explicit formulas for the first integrals (pseudo-confocal coordinates), curvature, geodesically equivalent Riemannian metric, the invariant area-forms on the time- and…

Differential Geometry · Mathematics 2007-05-23 D. Genin , B. Khesin , S. Tabachnikov

We have developed a general Bayesian algorithm for determining the coordinates of points in a three-dimensional space. The algorithm takes as input a set of probabilistic constraints on the coordinates of the points, and an a priori…

Artificial Intelligence · Computer Science 2013-03-08 Russ B. Altman

In this paper, we address the bounded/unbounded determination of geodesically convex optimization on Hadamard spaces. In Euclidean convex optimization, the recession function is a basic tool to study the unboundedness, and provides the…

Optimization and Control · Mathematics 2023-06-01 Hiroshi Hirai

It is known that for a variety of choices of metrics, including the standard bottleneck distance, the space of persistence diagrams admits geodesics. Typically these existence results produce geodesics that have the form of a convex…

Metric Geometry · Mathematics 2019-05-28 Samir Chowdhury

Many important problems in astrophysics, space physics, and geophysics involve flows of (possibly ionized) gases in the vicinity of a spherical object, such as a star or planet. The geometry of such a system naturally favors numerical…

Computational Physics · Physics 2020-04-01 V. Florinski , D. S. Balsara , S. Garain , K. F. Gurski

The observation of the motion of particles and light near a gravitating object is until now the only way to explore and to measure the gravitational field. In the case of exact black hole solutions of the Einstein equations the…

General Relativity and Quantum Cosmology · Physics 2015-06-11 Eva Hackmann , Claus Lämmerzahl

$\renewcommand{\Re}{\mathbb{R}}$ We develop a general randomized technique for solving "implic it" linear programming problems, where the collection of constraints are defined implicitly by an underlying ground set of elements. In many…

Computational Geometry · Computer Science 2021-12-24 Timothy M. Chan , Sariel Har-Peled , Mitchell Jones