相关论文: Bregman distances and Klee sets

We provide upper bounds of the expected Wasserstein distance between a probability measure and its empirical version, generalizing recent results for finite dimensional Euclidean spaces and bounded functional spaces. Such a generalization…

This paper proves a conjecture by Solomon about Steiner shallow-light trees (SLT) in Euclidean $d$-space: It is shown that for any finite point set $\mathbb{R}^d$, any root, and any $\epsilon>0$, there is a Euclidean Steiner…

Every maximally monotone operator can be associated with a family of convex functions, called the Fitzpatrick family or family of representative functions. Surprisingly, in 2017, Burachik and Mart\'inez-Legaz showed that the well-known…

We introduce a reduction from the distinct distances problem in ${\mathbb R}^d$ to an incidence problem with $(d-1)$-flats in ${\mathbb R}^{2d-1}$. Deriving the conjectured bound for this incidence problem (the bound predicted by the…

The author has recently introduced the class of CNED sets in Euclidean space, generalizing the classical notion of NED sets, and shown that they are quasiconformally removable. A set $E$ is CNED if the conformal modulus of a curve family is…

Separable Bregman divergences induce Riemannian metric spaces that are isometric to the Euclidean space after monotone embeddings. We investigate fixed rate quantization and its codebook Voronoi diagrams, and report on experimental…

Single-cell omics enable the profiles of cells, which contain large numbers of biological features, to be quantified. Cluster analysis, a dimensionality reduction process, is used to reduce the dimensions of the data to make it…

A well-known object in classical Euclidean geometry is the circumcenter of a triangle, i.e., the point that is equidistant from all vertices. The purpose of this paper is to provide a systematic study of the circumcenter of sets containing…

Contraction theory for dynamical systems on Euclidean spaces is well-established. For contractive (resp. semi-contractive) systems, the distance (resp. semi-distance) between any two trajectories decreases exponentially fast. For partially…

In this paper, we first prove that any interior point of an open interval of the real line can be interpreted as Fr\'echet means with respect to corresponding metric distances, thus extending the result of [Dinh et al., Mathematical…

A finite set of distinct vectors $\mathcal{X}$ in the $d$-dimensional Euclidean space $\mathbb{R}^d$ is called an $s$-distance set if the set of mutual distances between distinct elements of $\mathcal{X}$ has cardinality $s$. In this paper…

On any proper convex domain in real projective space there exists a natural Riemannian metric, the Blaschke metric. On the other hand, distances between points can be measured in the Hilbert metric. Using techniques of optimal control, we…

A finite set of distinct vectors $\mathcal{X}$ in the $d$-dimensional Euclidean space $\mathbb{R}^d$ is called a $2$-distance set, if the set of mutual distances between distinct elements of $\mathcal{X}$ has cardinality exactly $2$. In…

By using the metric projection onto a closed self-dual cone of the Euclidean space, M. S. Gowda, R. Sznajder and J. Tao have defined generalized lattice operations, which in the particular case of the nonnegative orthant of a Cartesian…

Phylogenetic inference-the derivation of a hypothesis for the common evolutionary history of a group of species- is an active area of research at the intersection of biology, computer science, mathematics, and statistics. One assumes the…

The geometry of closed surfaces equipped with a Euclidean metric with finitely many conical points of arbitrary angle is studied. The main result is that the image of a non-closed geodesic has 0 distance from the set of conical points.…

Let M be a smooth strictly convex closed surface in space and denote by H the set of points x in the exterior of M such that all the tangent segments from x to M have equal lengths. In this note we prove that if H is either a closed surface…

Let $(\mathcal{M},g)$ be a Riemannian manifold and $\mathcal{N}$ a $\mathcal{C}^2$ submanifold without boundary. If we multiply the metric $g$ by the inverse of the squared distance to $\mathcal{N}$, we obtain a new metric structure on…

Consider the sum of the first $N$ eigenspaces for the Laplacian on a Riemannian manifold. A basis for this space determines a map to Euclidean space and for $N$ sufficiently large the map is an embedding. In analogy with a fruitful idea of…

In [3], algorithms to compute the density of the distance to a random variable uniformly distributed in (a) a ball, (b) a disk, (c) a line segment, or (d) a polygone were introduced. For case (d), the algorithm, based on Green's theorem,…