Related papers: Erd\H{o}s Distance Problem in $\mathbb{R}^d$
We prove that every set of $n$ points in $\mathbb{R}^3$ spans $O(n^{295/197+\epsilon})$ unit distances. This is an improvement over the previous bound of $O(n^{3/2})$. A key ingredient in the proof is a new result for cutting circles in…
We consider several old problems involving the number of prime divisors function $\omega(n)$, as well as the related functions $\Omega(n)$ and $\tau(n)$. Firstly, we show that there are infinitely many positive integers $n$ such that…
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…
We study the structure of planar point sets that determine a small number of distinct distances. Specifically, we show that if a set P of n points determines o(n) distinct distances, then no line contains \Omega(n^{7/8}) points of P and no…
We study a variant of the Erd\H os unit distance problem, concerning angles between successive triples of points chosen from a large finite point set. Specifically, given a large finite set of $n$ points $E$, and a sequence of angles…
In this note, we show that in planar pointsets determining many unit distances, these unit distances must span many directions. Specifically, we show that a set of $n$ points can determine only $o(n^{4/3})$ unit distances from a set of at…
In a convex n-gon, let d[1] > d[2] > ... denote the set of all distances between pairs of vertices, and let m[i] be the number of pairs of vertices at distance d[i] from one another. Erdos, Lovasz, and Vesztergombi conjectured that m[1] +…
It is shown that $N$ points on a real algebraic curve of degree $n$ in $\mathbb{R}^d$ always determine $\gtrsim_{n,d}N^{1+\frac{1}{4}}$ distinct distances, unless the curve is a straight line or the closed geodesic of a flat torus. In the…
We study a variant of Erd\H os' unit distance problem, concerning dot products between successive pairs of points chosen from a large finite point set. Specifically, given a large finite set of $n$ points $E$, and a sequence of nonzero dot…
Erd\H{o}s and Fishburn studied the maximum number of points in the plane that span $k$ distances and classified these configurations, as an inverse problem of the Erd\H{o}s distinct distances problem. We consider the analogous problem for…
A set of integers greater than 1 is primitive if no element divides another. Erd\H{o}s proved in 1935 that the sum of $1/(n \log n)$ for $n$ running over a primitive set $A$ is universally bounded over all choices for $A$. In 1988 he asked…
Erd\"{o}s proved that for every infinite $X \subseteq \mathbb{R}^d$ there is $Y \subseteq X$ with $|Y|=|X|$, such that all pairs of points from $Y$ have distinct distances, and he gave partial results for general $a$-ary volume. In this…
The first purpose of this paper is to provide new finite field extension theorems for paraboloids and spheres. By using the unusual good Fourier transform of the zero sphere in some specific dimensions, which has been discovered recently in…
Erd\"os proved in 1946 that if a set $E\subset\mathbb{R}^n$ is closed and non-empty, then the set, called ambiguous locus or medial axis, of points in $\mathbb{R}^n$ with the property that the nearest point in $E$ is not unique, can be…
We prove the following variant of the Erd\H{o}s distinct subset sums problem. Given $t \ge 0$ and sufficiently large $n$, every $n$-element set $A$ whose subset sums are distinct modulo $N=2^n+t$ satisfies $$\max A \ge…
In 1847, Kirkman proved that there exists a Steiner triple system on $n$ vertices (equivalently a triangle decomposition of the edges of $K_n$) whenever $n$ satisfies the necessary divisibility conditions (namely $n\equiv 1,3 \mod 6$). In…
We solve several open problems concerning integer points of polytopes arising in symplectic and algebraic geometry. In this direction we give the first proof of a broad case of Ewald's Conjecture (1988) concerning symmetric integral points…
In this paper we show that every set $A \subset \mathbb{N}$ with positive density contains $B+C$ for some pair $B,C$ of infinite subsets of $\mathbb{N}$, settling a conjecture of Erd\H{o}s. The proof features two different decompositions of…
A point set $P \subset {\Bbb{R}}^d$ is {\it separated} if the minimum distance between any two points in $P$ is at least $1$. For $d \ne 4,5,$ we determine, for every $t_1,t_2 \ge 1$, and for $n$ at least a suitable $n_d$, the maximum…
We investigate rigidity-type problems on the real line and the circle in the non-generic setting. Specifically, we consider the problem of uniquely determining the positions of $n$ distinct points $V = {v_1, \ldots, v_n}$ given a set of…