相关论文: A Cayley-Menger formula for the earth mover's simp…

Given a solution to 4D Einstein gravity with an isometry direction, it is known that the equations of motion are identical to those of a 3D $\sigma$-model with target space geometry $SU(1,1)/U(1)$. Thus, any transformation by $SU(1, 1)…

A finite subset $X$ of the Euclidean space is called an $m$-distance set if the number of distances between two distinct points in $X$ is equal to $m$. An $m$-distance set $X$ is said to be maximal if any vector cannot be added to $X$ while…

It is now well known that curvature conditions \`a la Bakry-Emery are equivalent to contraction properties of the heat semigroup with respect to the classical quadratic Wasserstein distance. However, this curvature condition may include a…

We describe a MOND-related approach to natural scales of distance and mass, viewing it as a logical step following Planck's modification of the Stoney system of units. The MOND-induced scales are not based on the strength of any physical…

Given two sets of points A and B, $|A| = m$, $|B| = n$, the Chamfer distance from $A$ to $B$ is defined as $\operatorname{CD}(A,B) = \sum_{a\in A} \min_{b\in B} d(a,b)$, where $d$ is a distance metric. Chamfer distance is a popular measure…

We consider the Keplerian distance $d$ in the case of two elliptic orbits, i.e. the distance between one point on the first ellipse and one point on the second one, assuming they have a common focus. The absolute minimum $d_{\rm min}$ of…

The \textit{biharmonic distance} (BD) is a fundamental metric that measures the distance of two nodes in a graph. It has found applications in network coherence, machine learning, and computational graphics, among others. In spite of BD's…

Illumination estimation from a single image is critical in 3D rendering and it has been investigated extensively in the computer vision and computer graphic research community. On the other hand, existing works estimate illumination by…

The complex of curves $\mathcal{C}(S_g)$ of a closed orientable surface of genus $g \geq 2$ is the simplicial complex having its vertices, $\mathcal{C}^0(S_g)$, are isotopy classes of essential curves in $S_g$. Two vertices co-bound an edge…

We prove that, for every norm on $\mathbb{R}^d$ and every $E \subseteq \mathbb{R}^d$, the Hausdorff dimension of the distance set of $E$ with respect to that norm is at least $\dim_{\mathrm{H}} E - (d-1)$. An explicit construction follows,…

Let $\mathbb{F}_q$ be the finite field of order $q$ and $E\subset \mathbb{F}_q^d$, where $4|d$. Using Fourier analytic techniques, we prove that if $|E|>\frac{q^{d-1}}{d}\binom{d}{d/2}\binom{d/2}{d/4}$, then the points of $E$ determine a…

Computing the minimum distance of a linear code is one of the fundamental problems in algorithmic coding theory. Vardy [14] showed that it is an \np-hard problem for general linear codes. In practice, one often uses codes with additional…

Efficient Bayesian model selection relies on the model evidence or marginal likelihood, whose computation often requires evaluating an intractable integral. The harmonic mean estimator (HME) has long been a standard method of approximating…

The Hellinger distance between quantum states is a significant measure in quantum information theory, known for its Riemannian and monotonic properties. It is also easier to compute than the Bures distance, another measure that shares these…

The Solar TErrestrial RElations Observatory (STEREO) provides high cadence and high resolution images of the structure and morphology of coronal mass ejections (CMEs) in the inner heliosphere. CME directions and propagation speeds have…

A metric space $\mathrm{M}=(M;\de)$ is {\em homogeneous} if for every isometry $f$ of a finite subspace of $\mathrm{M}$ to a subspace of $\mathrm{M}$ there exists an isometry of $\mathrm{M}$ onto $\mathrm{M}$ extending $f$. A metric space…

We consider an efficient two-party protocol for securely computing the similarity of strings w.r.t. an extended edit distance measure. Here, two parties possessing strings $x$ and $y$, respectively, want to jointly compute an approximate…

Monotonicity formulae play a crucial role for many geometric PDEs, especially for their regularity theories. For minimal submanifolds in a Euclidean ball, the classical monotonicity formula implies that if such a submanifold passes through…

Metric spaces are a fundamental component of mathematics and have a paramount importance as a framework for measuring distance. They can be found in many different branches of mathematics, such as analysis and topology. This paper offers an…

The metric dimension of a graph is the smallest number of nodes required to identify all other nodes based on shortest path distances uniquely. Applications of metric dimension include discovering the source of a spread in a network,…