Related papers: Quadratic metric comparisons
We prove a relative isoperimetric inequalities for Lagrangian half disks in $\mathbb{C}^2$ with respect to a Lagrangian plane, or a complex plane, or a union of any two of Lagrangian or complex planes that intersect transversally at the…
We collect in this note some observations on the role of symmetries in Bayesian inference problems, that can be useful or detrimental depending on the way they act on the signal and on the observations. We emphasize in particular the need…
Distances are pervasive in machine learning. They serve as similarity measures, loss functions, and learning targets; it is said that a good distance measure solves a task. When defining distances, the triangle inequality has proven to be a…
For any sequence of matrix algebras that converge to a coadjoint orbit we give explicit formulas that show that the distances between the matrix algebras (viewed as quantum metric spaces) converges to 0. In the process we develop a general…
When are two collider events similar? Despite the simplicity and generality of this question, there is no established notion of the distance between two events. To address this question, we develop a metric for the space of collider events…
We investigate a tangent space at a point of a general metric space and metric space valued derivatives. The conditions under which two different subspace of a metric space have isometric tangent spaces in a common point of these subspaces…
Distance functions of metric spaces with lower curvature bound, by definition, enjoy various metric inequalities; triangle comparison, quadruple comparison and the inequality of Lang-Schroeder-Sturm. The purpose of this paper is to study…
This research work aims to explore the distortions in distance in equidistant cylindrical projection. The horizontal bending that occurs in the projection process can be assessed by performing a geometric analysis using Tissot's…
Let $K$ be a square in the plane and $\rho_K(x,y)$ be the hyperbolic distance between $x$, $y\in K$. Denote by $s_K(x,y)$ the triangular ratio metric in $K$; for $x\neq y$ the value of $s_K(x,y)$ equals the ratio of the Euclidean distance…
We establish an inequality of different metrics for algebraic polynomials.
The divergences coming from a particular sector of gravitational fluctuations around a generic background in general theories of quadratic gravity are analyzed. They can be summarized in a particular type of scalar model, whose properties…
Distance Geometry is based on the inverse problem that asks to find the positions of points, in a Euclidean space of given dimension, that are compatible with a given set of distances. We briefly introduce the field, and discuss some open…
We present isocapacitary characterizations of Sobolev inequalities in very general metric measure spaces.
Comparison of $1$-dimensional distance functions is a basic tool in Alexandrov geometry and it is used to characterize spaces with curvature bounded above or below. For the zero curvature bound there is a differential inequality which…
Associated to any finite metric space are a large number of objects and quantities which provide some degree of structural or geometric information about the space. In this paper we show that in the setting of subsets of weighted Hamming…
Here is a square problem: in a unit square, is there a point with four rational distances to the vertices? A probability argument suggests a negative answer. This paper proves several special cases of the square problem: if the point sits…
The inverse-square law states that the effect a source has on its surroundings is inversely proportional to the square of the Euclidean distance from that source. Its applicability spans multiple fields including physics, engineering, and…
The triangular ratio metric is studied in subdomains of the complex plane and Euclidean $n$-space. Various inequalities are proven for it. The main results deal with the behavior of this metric under quasiconformal maps. We also study the…
Moment inequality for quadratic forms of random vectors is of particular interest in covariance matrix testing and estimation problems. In this paper, we prove a Rosenthal-type inequality, which exhibits new features and certain improvement…
We give an overview of different approaches to measuring the similarity of, or the distance between, two graphs, highlighting connections between these approaches. We also discuss the complexity of computing the distances.