Related papers: Distances from points to planes

An equidistant set in the Euclidean space consists of points having equal distances to both members of a given pair of sets, called focal sets. Since there is no effective formula to compute the distance of a point and a set, it is hard to…

We prove that if the Hausdorff dimension of $E\subset\mathbb{R}^d$, $d\geq 2$ is greater than $\frac{d}{2}+\frac{1}{3}$, the set of gaps of $2$-chains inside $E$, $$\Delta_2(E)=\{(|x-y|, |y-z|): x, y, z\in E \}\subset\mathbb{R}^2$$ has…

We extend a result, due to Mattila and Sjolin, which says that if the Hausdorff dimension of a compact set $E \subset {\Bbb R}^d$, $d \ge 2$, is greater than $\frac{d+1}{2}$, then the distance set $\Delta(E)=\{|x-y|: x,y \in E \}$ contains…

A celebrated result due to Wolff says if $E$ is a compact subset of ${\Bbb R}^2$, then the Lebesgue measure of the distance set $\Delta(E)=\{|x-y|: x,y \in E \}$ is positive if the Hausdorff dimension of $E$ is greater than $\frac{4}{3}$.…

In this paper we obtain a new lower bound on the Erd\H{o}s distinct distances problem in the plane over prime fields. More precisely, we show that for any set $A\subset \mathbb{F}_p^2$ with $|A|\le p^{7/6}$, the number of distinct distances…

The recent breakthrough of Guth, Iosevich, Ou, and Wang (2019) on the Falconer distance problem states that for a compact set $A\subset \mathbb{R}^2$, if the Hausdorff dimension of $A$ is greater than $\frac{5}{4}$, then the distance set…

For a positive integer $d$, a set of points in $d$-dimensional Euclidean space is called almost-equidistant if for any three points from the set, some two are at unit distance. Let $f(d)$ denote the largest size of an almost-equidistant set…

Let $\mathcal{E}$ be a set of points in $\mathbb{F}_q^d$. Bennett, Hart, Iosevich, Pakianathan, and Rudnev (2016) proved that if $|\mathcal{E}|\gg q^{d-\frac{d-1}{k+1}}$ then $\mathcal{E}$ determines a positive proportion of all…

Some new results on plane F_{q^2}-maximal curves are stated and proved. It is known that the degree d of such curves is upper bounded by q+1 and that d=q+1 if and only if the curve is F_{q^2}-isomorphic to the Hermitian. We show that d\le…

The Erd\H os unit distance conjecture in the plane says that the number of pairs of points from a point set of size $n$ separated by a fixed (Euclidean) distance is $\leq C_{\epsilon} n^{1+\epsilon}$ for any $\epsilon>0$. The best known…

Let $P$ be a finite point set in $\mathbb{R}^2$ with the set of distance $n$-chains defined as $$ \Delta_n(P)=\{(|p_1-p_2|,|p_2-p_3|,\ldots,|p_n-p_{n+1}|):p_i \in P\}.$$ We show that for $2\leq n=O_{|P|}(1)$ we have $$|\Delta_n(P)|\gtrsim…

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.

The well-known three distance theorem states that there are at most three distinct gaps between consecutive elements in the set of the first n multiples of any real number. We generalise this theorem to higher dimensions under a suitable…

In the $m$-dimensional affine space $AG(m,q)$ over the finite field $\mathbb{F}_q$ of odd order $q$, the analogous of the Euclidean distance gives rise to a graph $\mathfrak{G}_{m,q}$ where vertices are the points of $AG(m,q)$ and two…

Let $\mathbb F_q^d$ be the $d$-dimensional vector space over the finite field $\mathbb F_q$ with $q$ elements. For each non-zero $r$ in $\mathbb F_q$ and $E\subset \mathbb F_q^d$, we define $W(r)$ as the number of quadruples $(x,y,z,w)\in…

In this paper, we use algorithmic tools, effective dimension and Kolmogorov complexity, to study the fractal dimension of distance sets. We show that, for any analytic set $E\subseteq\R^2$ of Hausdorff dimension strictly greater than one,…

We study closed sets $F \subset {\mathbb R}^d$ whose distance function $d_F:= {\rm dist}\,(\cdot,F)$ is DC (i.e., is the difference of two convex functions on ${\mathbb R}^d$). Our main result asserts that if $F \subset {\mathbb R}^2$ is a…

The famous Erd\H{o}s distinct distances problem asks the following: how many distinct distances must exist between a set of $n$ points in the plane? There are many generalisations of this question that ask one to consider different spaces…

In his 1990 Inventiones paper, P. Jones characterized subsets of rectifiable curves in the plane via a multiscale sum of $\beta$-numbers. These $\beta$-numbers are geometric quantities measuring how far a given set deviates from a best…

Nonsingular plane curves over a finite field $\mathbb{F}_q$ of degree $q+2$ passing through all the $\mathbb{F}_q$-points of the plane admita representation by $3\times 3$ matrices over $\mathbb{F}_q$. We classify their degenerations by…