Related papers: Geodesics on Grushin spaces
We introduce optimal quadrature rules for spline spaces that are frequently used in Galerkin discretizations to build mass and stiffness matrices. Using the homotopy continuation concept [6] that transforms optimal quadrature rules from…
We study a class of optimization problems including matrix scaling, matrix balancing, multidimensional array scaling, operator scaling, and tensor scaling that arise frequently in theory and in practice. Some of these problems, such as…
We study the geodesics on an invariant surface of a three dimensional Riemannian manifold. The main results are: the characterization of geodesic orbits; a Clairaut's relation and its geometric interpretation in some remarkable three…
Determining the quantum circuit complexity of a unitary operation is closely related to the problem of finding minimal length paths in a particular curved geometry [Nielsen et al, Science 311, 1133-1135 (2006)]. This paper investigates many…
Let X be a geometrically smooth n-dimensional projective algebraic complex hypersurface in P^{n+1}(C). Using Green-Griffiths jets, we establish the existence of nonzero global algebraic differential equations that must be satisfied by every…
In this chapter, we identify fundamental geometric structures that underlie the problems of sampling, optimisation, inference and adaptive decision-making. Based on this identification, we derive algorithms that exploit these geometric…
We propose a conjugate gradient type optimization technique for the computation of the Karcher mean on the set of complex linear subspaces of fixed dimension, modeled by the so-called Grassmannian. The identification of the Grassmannian…
Thanks to earlier work of Koiran, it is known that the truth of the Generalized Riemann Hypothesis (GRH) implies that the dimension of algebraic sets over the complex numbers can be determined within the polynomial-hierarchy. The truth of…
We propose a novel method to fit and segment multi-structural data via convex relaxation. Unlike greedy methods --which maximise the number of inliers-- this approach efficiently searches for a soft assignment of points to models by…
We consider the problem of calculating the Gaussian curvature of a conical 2-dimensional space by using concepts and techniques of distribution theory. We apply the results obtained to calculate the Riemannian curvature of the 4-dimensional…
We prove that any finite collection of polygons of equal area has a common hinged dissection. That is, for any such collection of polygons there exists a chain of polygons hinged at vertices that can be folded in the plane continuously…
In this article, we analyze three classes of time-reversal of a Markov process with Gaussian noise on a manifold. We first unveil a commutativity constraint for the most general of these time-reversals to be well defined. Then we give a…
The aim of this paper is to review and complete the study of geodesics on G\"odel type spacetimes initiated in [8] and improved in [2] of the References. In particular, we prove some new results on geodesic connectedness and geodesic…
This paper shows that the well-known curve optimization problems which lead to the straight line, the catenary curve, the brachistochrone, and the circle, can all be handled using a unified formalism. Furthermore, from the general…
The thesis concentrates on two problems in discrete geometry, whose solutions are obtained by analytic, probabilistic and combinatoric tools. The first chapter deals with the strong polarization problem. This states that for any sequence…
We show that a general solution of the Einstein equations that describes approach to an inhomogeneous and anisotropic sudden spacetime singularity does not experience geodesic incompleteness. This generalises the result established for…
Motivated by a conjecture put forward by Abramowicz and Bajtlik we reconsider the twin paradox in static spacetimes. According to a well known theorem in Lorentzian geometry the longest timelike worldline between two given points is the…
We investigate the rudiments of Riemannian geometry on orbit spaces $M/G$ for isometric proper actions of Lie groups on Riemannian manifolds. Minimal geodesic arcs are length minimising curves in the metric space $M/G$ and they can hit…
We study the convergence of the Riemannian steepest descent algorithm on the Grassmann manifold for minimizing the block version of the Rayleigh quotient of a symmetric matrix. Even though this problem is non-convex in the Euclidean sense…
In certain circumstances tools of Riemannian geometry are sufficient to address questions arising in the more general Finslerian context. We show that one such instance presents itself in the characterisation of geodesics in Randers spaces…