Related papers: On sets with few distinct distances

Let $P$ be a set of $n$ points in general position in the plane. Let $R$ be a set of points disjoint from $P$ such that for every $x,y \in P$ the line through $x$ and $y$ contains a point in $R$. We show that if $|R| < \frac{3}{2}n$ and $P…

Let $d_1\leq d_2\leq\ldots\leq d_{n\choose 2}$ denote the distances determined by $n$ points in the plane. It is shown that $\min\sum_i (d_{i+1}-d_i)^2=O(n^{-6/7})$, where the minimum is taken over all point sets with minimal distance $d_1…

We study the minimum number of distinct distances between point sets on two curves in $R^3$. Assume that one curve contains $m$ points and the other $n$ points. Our main results: (a) When the curves are conic sections, we characterize all…

If $E \subset \mathbb{R}^2$ is a compact set of Hausdorff dimension greater than $5/4$, we prove that there is a point $x \in E$ so that the set of distances $\{ |x-y| \}_{y \in E}$ has positive Lebesgue measure.

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…

Let K be a real algebraic number field and let P be the set of Pisot numbers generating K. We show that the elements of P-P are the algebraic integers of K whose images under the action of all embeddings of K into C, other than the identity…

Let $\mathcal{P}$ be a set of points in the plane, and $\mathcal{S}$ a strictly convex set of points. In this note, we show that if $\mathcal{P}$ contains many translates of $\mathcal{S}$, then these translates must come from a generalized…

We present a concise proof for the supporting hyperplane theorem. We then observe that the proof not only establishes the supporting hyperplane theorem but also extends it to a hyperplane separation theorem for certain non-convex sets. The…

The distinct dot products problem, a variant of the Erd\H{o}s distinct distances problem, asks "Given a set $P_n$ of $n$ points in $\mathbb{R}^2$, what is the minimum number $|D(P_n)|$ of distinct dot products they determine?" The best…

The Erd\H{o}s distance problem concerns the least number of distinct distances that can be determined by $N$ points in the plane. The integer lattice with $N$ points is known as \textit{near-optimal}, as it spans $\Theta(N/\sqrt{\log(N)})$…

Let $V \subset \mathbb{R}$ be a finite set with $|V| = n $ and suppose we are given each pairwise distance independently with probability $p$. We show that if $p = (1+\epsilon)/n$, for some fixed $\epsilon >0$, then we can reconstruct a…

Let $\mathcal{S}$ be a finite set of integer points in $\mathbb{R}^d$, which we assume has many symmetries, and let $P\in\mathbb{R}^d$ be a fixed point. We calculate the distances from $P$ to the points in $\mathcal{S}$ and compare the…

We prove the following three statements: 1) Let $(A, \bar A)$ be a partition of the spherical surface $S^n$ into two measurable sets. Let $st_A$ and $st_{\bar A}$ be their measure density functions of distance. Then $|st_A - st_{\bar A}|$…

In this paper, we deal with analytic and geometric properties of orthogonally convex sets. We establish a Blaschke-type theorem for path-connected and orthogonally convex sets in the plane using orthogonally convex paths. The separation of…

Two elements, $x$ and $y$, are separated by a set $S$ if it contains exactly one of $x$ and $y$. We prove that any set of $n$ points in general position in the plane can be separated by $O(n\log\log n/\log n)$ convex sets, and for some…

We prove that most one-dimensional projections of a discrete subset of a plane are either dense in R (the real line), or form a discrete subset of R. More precisely, the set E of exceptional directions (for which the indicated dichotomy…

We prove that if two subsets ${A}$ and ${B}$ of the plane are connected, ${A}$ is bounded, and the Euclidean distance $\rho({A},{B})$ between ${A}$ and ${B}$ is greater than zero, then for every positive $\varepsilon<\rho({A},{B})$, the…

In this work we prove that if for a pair of convex bodies $K_1, K_2 \subset \mathbb{R}^n$, $n \geq 3$, there exists a hyperplane $H$ and two distinct points $p_1$ and $p_2$ in $\mathbb{R}^n \setminus H$ such that for every $(n-2)$-plane $M…

Alternative novel measures of the distance between any two partitions of a n-set are proposed and compared, together with a main existing one, namely 'partition-distance' D(.,.). The comparison achieves by checking their restriction to…

In a previous paper we showed that, for any $n \ge m+2$, most sets of $n$ points in $\RR^m$ are determined (up to rotations, reflections, translations and relabeling of the points) by the distribution of their pairwise distances. But there…