Related papers: Recognizing weighted means in geodesic spaces
We develop, in the context of general relativity, the notion of a geoid -- a surface of constant "gravitational potential". In particular, we show how this idea naturally emerges as a specific choice of a previously proposed, more general…
We study the limiting behavior of multiple ergodic averages involving several not necessarily commuting measure preserving transformations. We work on two types of averages, one that uses iterates along combinatorial parallelepipeds, and…
This paper presents the generalization of weighted distances to modules and their computation through the chamfer algorithm on general point lattices. The first part is dedicated to formalization of definitions and properties (distance,…
We prove a pair of sharp reverse isoperimetric inequalities for domains in nonpositively curved surfaces: (1) metric disks centered at the vertex of a Euclidean cone of angle at least $2\pi$ have minimal area among all nonpositively curved…
Inferring unknown conic sections on the basis of noisy data is a challenging problem with applications in computer vision. A major limitation of the currently available methods for conic sections is that estimation methods rely on the…
An important problem in analytic and geometric combinatorics is estimating the number of lattice points in a compact convex set in a Euclidean space. Such estimates have numerous applications throughout mathematics. In this note, we exhibit…
The geometric mean of two matrices is considered and analyzed from a computational viewpoint. Some useful theoretical properties are derived and an analysis of the conditioning is performed. Several numerical algorithms based on different…
We prove the equidistribution of (weighted) periodic orbits of the geodesic ow on noncompact negatively curved manifolds toward equilibrium states in the narrow topology, i.e. in the dual of bounded continuous functions. We deduce an exact…
Projective geometry provides the preferred framework for most implementations of Euclidean space in graphics applications. Translations and rotations are both linear transformations in projective geometry, which helps when it comes to…
It was shown by E. Gluskin and V.D. Milman in [GAFA Lecture Notes in Math. 1807, 2003] that the classical arithmetic-geometric mean inequality can be reversed (up to a multiplicative constant) with high probability, when applied to…
In this article, we study the properties of the geodesic X-ray transform for asymptotically Euclidean or conic Riemannian metrics and show injectivity under non-trapping and no conjugate point assumptions. We also define a notion of lens…
In applications, a substantial number of problems can be formulated as non-linear least squares problems over smooth varieties. Unlike the usual least squares problem over a Euclidean space, the non-linear least squares problem over a…
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…
Consider the geometric inverse problem: There is a set of delta-sources in spacetime that emit waves travelling at unit speed. If we know all the arrival times at the boundary cylinder of the spacetime, can we reconstruct the space, a…
The geodesic complexity of a Riemannian manifold is a numerical isometry invariant that is determined by the structure of its cut loci. In this article we study decompositions of cut loci over whose components the tangent cut loci fiber in…
We propose an approach for capturing the signal variability in hyperspectral imagery using the framework of the Grassmann manifold. Labeled points from each class are sampled and used to form abstract points on the Grassmannian. The…
We initiate the rigorous study of classification in quasi-metric spaces. These are point sets endowed with a distance function that is non-negative and also satisfies the triangle inequality, but is asymmetric. We develop and refine a…
We study the problem of discrete geometric packing. Here, given weighted regions (say in the plane) and points (with capacities), one has to pick a maximum weight subset of the regions such that no point is covered more than its capacity.…
We study first-order optimization algorithms for computing the barycenter of Gaussian distributions with respect to the optimal transport metric. Although the objective is geodesically non-convex, Riemannian GD empirically converges…
We consider here a generalization of a well known discrete dynamical system produced by the bisection of reflection angles that are constructed recursively between two lines in the Euclidean plane. It is shown that similar properties of…