Related papers: Bregman distances and Klee sets
In this work, the relativistic phenomena of Lorentz contraction and time dilation are derived using a modified distance formula appropriate for discrete space. This new distance formula is different than Pythagoras's theorem but converges…
For the distance function from any closed subset of any complete Finsler manifold, we prove that the singular set is equal to a countable union of delta-convex hypersurfaces up to an exceptional set of codimension two. In addition, in…
The point-to-set principle of J. Lutz and N. Lutz (2018) has recently enabled the theory of computing to be used to answer open questions about fractal geometry in Euclidean spaces $\mathbb{R}^n$. These are classical questions, meaning that…
We develop a new class of distances for objects including lines, hyperplanes, and trajectories, based on the distance to a set of landmarks. These distances easily and interpretably map objects to a Euclidean space, are simple to compute,…
We study how small is the set of critical values of the distance function from a compact (resp. closed) set in the plane or in a connected complete two-dimensional Riemannian manifold. We show that for a compact set, the set of critical…
Metric embeddings are central to metric theory and its applications. Here we consider embeddings of a different sort: maps from a set to subsets of a metric space so that distances between points are approximated by minimal distances…
The Lebesgue dominated convergence theorem of the measure theory implies that the Riemann integral of a bounded sequence of continuous functions over the interval [ 0,1] pointwise converging to zero, also converges to zero. The validity of…
It is an elementary fact that if we fix an arbitrary set of $d+1$ affine independent points $\{p_0,\dots p_d\}$ in $\mathbb{R}^d$, then the Euclidean distances $\{|x-p_j|\}_{j=0}^d$ determine the point $x$ in $\mathbb{R}^d$ uniquely. In…
Given a set of points in the Euclidean space $\mathbb{R}^\ell$ with $\ell>1$, the pairwise distances between the points are determined by their spatial location and the metric $d$ that we endow $\mathbb{R}^\ell$ with. Hence, the distance…
The distances between flats of a Poisson $k$-flat process in the $d$-dimensional Euclidean space with $k<d/2$ are discussed. Continuing an approach originally due to Rolf Schneider, the number of pairs of flats having distance less than a…
We study the sharp constant in the Hardy inequality for fractional Sobolev spaces defined on open subsets of the Euclidean space. We first list some properties of such a constant, as well as of the associated variational problem. We then…
Let $Y\subseteq \mathbb{R}^n$ be a closed definable subset and $X\subseteq \mathbb{R}^n$ be a smooth manifold. We construct a version of Morse theory for the restriction to $X$ of the Euclidean distance function from $Y$. This is done using…
We show that compact Riemannian manifolds, regarded as metric spaces with their global geodesic distance, cannot contain a number of rigid structures such as (a) arbitrarily large regular simplices or (b) arbitrarily long sequences of…
We consider a generalized angle in complex normed vector spaces. Its definition corresponds to the definition of the well known Euclidean angle in real inner product spaces. Not surprisingly it yields complex values as `angles'. This…
For pattern recognition like image recognition, it has become clear that each machine-learning dictionary data actually became data in probability space belonging to Euclidean space. However, the distances in the Euclidean space and the…
We study the problem of recovering a globally consistent Euclidean embedding of data, given only a local distance graph and propose a method that optimally represents these distances. The method operates solely on a neighborhood graph…
Counter-examples to the famous conjecture of Caratheodory, as well as the bound on umbilic index proposed by Hamburger, are constructed with respect to Riemannian metrics that are arbitrarily close to the flat metric on Euclidean 3-space.…
The well-known $\mathcal{E}$-sets introduced by Hayman in 1960 are collections of Euclidean discs in the complex plane with the following property: The set of angles $\theta$ for which the ray $\arg(z)=\theta$ meets infinitely many discs in…
Let $M$ be a complete, connected Riemannian surface and suppose that $\mathcal{S} \subset M$ is a discrete subset. What can we learn about $M$ from the knowledge of all distances in the surface between pairs of points of $\mathcal{S}$? We…
Union volume estimation is a classical algorithmic problem. Given a family of objects $O_1,\ldots,O_n \subseteq \mathbb{R}^d$, we want to approximate the volume of their union. In the special case where all objects are boxes (also known as…