Related papers: The Erd\H{o}s-Falconer distance problem between ar…

Given a set of points $P \subset \mathbb F_q^2$ such that $|P|\geq q^{3/2}$ it is established that $|P|$ determines $\Omega(q^2)$ distinct perpendicular bisectors. It is also proven that, if $|P| \geq q^{4/3}$, then for a positive…

Let $X$ be an $n$--element finite set, $0<k\leq n/2$ an integer. Suppose that $\{A_1,A_2\} $ and $\{B_1,B_2\} $ are pairs of disjoint $k$-element subsets of $X$ (that is, $|A_1|=|A_2|=|B_1|=|B_2|=k$, $A_1\cap A_2=\emptyset$, $B_1\cap…

We introduce a class of Falconer distance problems, which we call of restricted type, lying between the classical version and its pinned variant. Prototypical restricted distance sets are the diagonal distance sets, $k$-point configuration…

We consider the number of distinct distances between two finite sets of points in ${\bf R}^k$, for any constant dimension $k\ge 2$, where one set $P_1$ consists of $n$ points on a line $l$, and the other set $P_2$ consists of $m$ arbitrary…

We study an extension of the Falconer distance problem in the multiparameter setting. Given $\ell\geq 1$ and $\mathbb{R}^{d}=\mathbb{R}^{d_1}\times\cdots \times\mathbb{R}^{d_\ell}$, $d_i\geq 2$. For any compact set $E\subset \mathbb{R}^{d}$…

We establish the dimension version of Falconer's distance set conjecture for sets of equal Hausdorff and packing dimension (in particular, for Ahlfors-regular sets) in all ambient dimensions. In dimensions $d=2$ or $3$, we obtain the first…

In 1946, Erd\H{o}s posed the distinct distance problem, which seeks to find the minimum number of distinct distances between pairs of points selected from any configuration of $n$ points in the plane. The problem has since been explored…

In this paper we systematically study various properties of the distance graph in ${\Bbb F}_q^d$, the $d$-dimensional vector space over the finite field ${\Bbb F}_q$ with $q$ elements. In the process we compute the diameter of distance…

Let $\mathcal{F}$ be a family of $k$-sized subsets of $[n]$ that does not contain $s$ pairwise disjoint subsets. The Erd\H{o}s Matching Conjecture, a celebrated and long-standing open problem in extremal combinatorics, asserts the maximum…

The paper concerns the problem whether a nonseparable $\C(K)$ space must contain a set of unit vectors whose cardinality equals to the density of $\C(K)$ such that the distances between every two distinct vectors are always greater than…

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…

Using Fourier analysis, Covert, Hart, Iosevich and Uriarte-Tuero (2008) showed that if the cardinality of a subset of the 2-dimensional vector space over a finite field with q elements is >= rq^2, with q^{-1/2} << r <= 1 then it contains an…

We prove new bounds on the dimensions of distance sets and pinned distance sets of planar sets. Among other results, we show that if $A\subset\mathbb{R}^2$ is a Borel set of Hausdorff dimension $s>1$, then its distance set has Hausdorff…

We show that if a compact set $E\subset \mathbb{R}^d$ has Hausdorff dimension larger than $\frac{d}{2}+\frac{1}{4}-\frac{1}{8d+4}$, where $d\geq 3$, then there is a point $x\in E$ such that the pinned distance set $\Delta_x(E)$ has positive…

We prove a point-wise and average bound for the number of incidences between points and hyper-planes in vector spaces over finite fields. While our estimates are, in general, sharp, we observe an improvement for product sets and sets…

Given $\mathbb{F}_q$ the finite field with $q$ elements and an integer $n\geq 2$, a flag is a sequence of nested subspaces of $\mathbb{F}_q^n$ and a flag code is a nonempty set of flags. In this context, the distance between flags is the…

We show that if $\mathcal{E}$ is a subset of the $d$-dimensional vector space over a finite field $\mathbbm{F}_q$ ($d \geq 3$) of cardinality $|\mathcal{E}| \geq (d-1)q^{d - 1}$, then the set of volumes of $d$-dimensional parallelepipeds…

Erd\H{o}s asked whether every $n$-point set in Euclidean space whose $\binom{n}{2}$ pairwise distances are mutually at least $1$ apart must have diameter at least $(1+o(1))n^2$. We disprove this statement by constructing for every prime…

We prove a special case of Erd\H{o}s' unit distance problem using a corollary of the subspace theorem bounding the number of solutions of linear equations from a multiplicative group. We restrict our attention to unit distances coming from…

We give upper bounds on the number of exceptional radial projections of arbitrary subsets of vector spaces over finite fields. Our bounds do not depend on the dimension of the ambient space. Let $\mathbb{F}_q^d$ be the $d$-dimensional…