Related papers: Exponential odd-distance sets under the Manhattan …
We show that the greedy spanner algorithm constructs a $(1+\epsilon)$-spanner of weight $\epsilon^{-O(d)}w(\mathrm{MST})$ for a point set in metrics of doubling dimension $d$, resolving an open problem posed by Gottlieb. Our result…
We study several versions of the alternating direction method of multipliers (ADMM) for solving the convex problem of finding the distance between two ellipsoids and the nonconvex problem of finding the distance between the boundaries of…
The main goal of this paper is to provide an alternative proof of the following theorem of Petty: in the normed space of dimension at least three, every 3-element equilateral set can be extended to a 4-element equilateral set. Our approach…
Let $D$ be an $n \times n$ Euclidean distance matrix (EDM) with embedding dimension $r$; and let $d \in R^n$ be a given vector. In this note, we consider the problem of finding a vector $y \in R^n$, that is closest to d in Euclidean norm,…
We prove that the set of orthogonal projections on a Hilbert space equipped with the length metric is $\frac\pi2$-geodesic. As an application, we consider the problem of variation of spectral subspaces for bounded linear self-adjoint…
Stability and error analysis remain challenging for problems that lack regularity properties near solutions, are subject to large perturbations, and might be infinite dimensional. We consider nonconvex optimization and generalized equations…
In this work we reproduce the characterization of $\Gg^s$-sets from the euclidean setting [J. London Math. Soc. 49:267-280,1994] to more general metric spaces. These sets have Hausdorff dimension at least $s$ and are closed by countable…
Numerous problems consisting in identifying vertices in graphs using distances are useful in domains such as network verification and graph isomorphism. Unifying them into a meta-problem may be of main interest. We introduce here a…
Consider a set $P$ of $n$ points picked uniformly and independently from $[0,1]^d$ for a constant dimension $d$ -- such a point set is extremely well behaved in many aspects. For example, for a fixed $r \in [0,1]$, we prove a new…
In this paper, we study the distance problem in the setting of finite p-adic rings. In odd dimensions, our results are essentially sharp. In even dimensions, we clarify the conjecture and provide examples to support it. Surprisingly,…
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…
This paper presents a detailed study of constrained quantization for both finite and infinite discrete probability distributions supported on subsets of the real line. Under specific geometric constraints - namely, a semicircular arc and…
In this paper, we study the parameterized complexity of the MaxMin versions of two fundamental separation problems: Maximum Minimal $st$-Separator and Maximum Minimal Odd Cycle Transversal (OCT), both parameterized by the solution size. In…
Finding the maximum cardinality of a $2$-distance set in Euclidean space is a classical problem in geometry. Lison\v{e}k in 1997 constructed a maximum $2$-distance set in $\mathbb R^8$ with $45$ points. That $2$-distance set constructed by…
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…
Many statistical and machine learning approaches rely on pairwise distances between data points. The choice of distance metric has a fundamental impact on performance of these procedures, raising questions about how to appropriately…
We derive a new estimate of the size of finite sets of points in metric spaces with few distances. The following applications are considered: (1) we improve the Ray-Chaudhuri--Wilson bound of the size of uniform intersecting families of…
We prove a series of results on the size of distance sets corresponding to sets in the Euclidean space. These distances are generated by bounded convex sets and the results depend explicitly on the geometry of these sets. We also use a…
Geometrical objects with integral sides have attracted mathematicians for ages. For example, the problem to prove or to disprove the existence of a perfect box, that is, a rectangular parallelepiped with all edges, face diagonals and space…
We examine the metrics that arise when a finite set of points is embedded in the real line, in such a way that the distance between each pair of points is at least 1. These metrics are closely related to some other known metrics in the…