Related papers: Uniqueness of maximum three-distance sets in the t…

We study homogeneity aspects of metric spaces in which all triples of distinct points admit pairwise different distances; such spaces are called isosceles-free. In particular, we characterize all homogeneous isosceles-free spaces up to…

Given a set $X\subseteq\mathbb{R}^2$ of $n$ points and a distance $d>0$, the multiplicity of $d$ is the number of times the distance $d$ appears between points in $X$. Let $a_1(X) \geq a_2(X) \geq \cdots \geq a_m(X)$ denote the…

We investigate the Euclidean $d$-Dimensional Stable Roommates problem, which asks whether a given set~$V$ of $d \cdot n$ points from the 2-dimensional Euclidean space can be partitioned into $n$ disjoint (unordered) subsets…

Conventional wisdom holds that any region of 3-space contains infinitely many points, and the Planck length scale determines the uncertainty in every measurement of distance between two separate points. Against such a backdrop, this…

In the Euclidean $k$-Means problem we are given a collection of $n$ points $D$ in an Euclidean space and a positive integer $k$. Our goal is to identify a collection of $k$ points in the same space (centers) so as to minimize the sum of the…

The unit Euclidean distance degree and the generic Euclidean distance degree are two well-studied invariants of projective varieties. These quantities measure the algebraic complexity of nearest-point problems on a variety, and in many…

We improve by an exponential factor the best known asymptotic upper bound for the density of sets avoiding 1 in Euclidean space. This result is obtained by a combination of an analytic bound that is an analogue of Lovasz theta number and of…

The hexabasic book is the cone of the 1-dimensional skeleton of the union of two tetrahedra glued along a common face. The universal 3-dimensional polyhedron UP is the product of a segment and the hexabasic book. We show that any…

Finding the point in an algebraic variety that is closest to a given point is an optimization problem with many applications. We study the case when the variety is a Fermat hypersurface. Our formula for its Euclidean distance degree is a…

This paper is devoted to the study the $m$-point homogeneity property and the point homogeneity degree for finite metric spaces. Since the vertex sets of regular polytopes, as well as of some their generalizations, are homogeneous, we pay…

Suppose that a metric space $X$ is the union of two metric subspaces $A$ and $B$ that embed into Euclidean space with distortions $D_A$ and $D_B$, respectively. We prove that then $X$ embeds into Euclidean space with a bounded distortion…

For a Euclidean building $X$ of type $A_{2}$, we classify the 0-dimensional subbuildings $A$ of $\partial_{T}X$ that occur as the asymptotic boundary of closed convex subsets. In particular, we show that triviality of the holonomy of a…

Every graph G can be embedded in a Euclidean space as a two-distance set. This allows us to reformulate the analogue of Borsuk's conjecture for two-distance sets in terms of graphs. This conjecture remains open for dimensions from 4 to 63.…

Let $\mathcal{O}_K$ be the ring of integers of an algebraic number field $K$ embedded into $\mathbb{C}$. Let $X$ be a subset of the Euclidean space $\mathbb{R}^d$, and $D(X)$ be the set of the squared distances of two distinct points in…

Let $S$ be a set of points in $\mathbb{R}^2$ contained in a circle and $P$ an unrestricted point set in $\mathbb{R}^2$. We prove the number of distinct distances between points in $S$ and points in $P$ is at least…

We consider the problem of constructing small coresets for $k$-Median in Euclidean spaces. Given a large set of data points $P\subset \mathbb{R}^d$, a coreset is a much smaller set $S\subset \mathbb{R}^d$, so that the $k$-Median costs of…

A point set $M$ in Euclidean plane is called an integral point set in semi-general position if all the distances between the elements of $M$ are integers, and $M$ does not contain collinear triples. We improve the lower bound for diameter…

We study a generalization of Erd\H os's unit distances problem to chains of $k$ distances. Given $\mathcal P,$ a set of $n$ points, and a sequence of distances $(\delta_1,\ldots,\delta_k)$, we study the maximum possible number of tuples of…

It is shown that given a set of $N$ points in the plane or on the sphere, there is a subset of size $\gtrsim N^{1/3}/\log N$ with all pairwise distances between points distinct.

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…