Related papers: Erdos distance problem in vector spaces over finit…

We show that if $E \subset \mathbb{F}_q^d$, the $d$-dimensional vector space over the finite field with $q$ elements, and $|E| \geq \rho q^d$, where $ q^{-\frac{1}{2}}\ll \rho \leq 1$, then $E$ contains an isometric copy of at least $c…

Let $\mathbb{F}_q$ be a finite field of order $q$, where $q$ is large odd prime power. In this paper, we improve some recent results on the additive energy of the distance set, and on sumsets of the distance set due to Shparlinski (2016).…

We bound double sums of Kloosterman sums over a finite field ${\mathbb F}_{q}$, with one or both parameters ranging over an affine space over its prime subfield ${\mathbb F}_p \subseteq {\mathbb F}_{q} $. These are finite fields analogues…

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}$…

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…

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…

We improve the best known upper bound on the number of edges in a unit-distance graph on $n$ vertices for each $n\in\{16,\ldots,30\}$. When $n\leq 21$, our bounds match the best known lower bounds, and we fully enumerate the densest…

We show that for any sequence $f: {\bf N} \to \{-1,+1\}$ taking values in $\{-1,+1\}$, the discrepancy $$ \sup_{n,d \in {\bf N}} \left|\sum_{j=1}^n f(jd)\right| $$ of $f$ is infinite. This answers a question of Erd\H{o}s. In fact the…

Let $\mathbb{F}_q$ be the finite field of $q$ elements, for a given subset $D\subset \mathbb{F}_q$, $m\in \mathbb{N}$, an integer $k\leq |D|$ and $\boldsymbol{b}\in \mathbb{F}_q^m$ we are interested in determining the existence of a subset…

We prove that if $E \subset {\mathbb F}_q^2$, $q \equiv 3 \mod 4$, has size greater than $Cq^{7/4}$, then $E$ determines a positive proportion of all congruence classes of triangles in ${\mathbb F}_q^2$. The approach in this paper is based…

In this paper we prove some results on sum-product estimates over arbitrary finite fields. More precisely, we show that for sufficiently small sets $A\subset \mathbb{F}_q$ we have \[|(A-A)^2+(A-A)^2|\gg |A|^{1+\frac{1}{21}}.\] This can be…

We study a generalization of the Erd\H{o}s-Falconer distance problem over finite fields. For a graph $G$, two embeddings $p, p': V(G) \to \mathbb{F}_q^d$ of a graph $G$ are congruent if for all edges $(v_i, v_j)$ of $G$ we have that…

Let ${\Bbb F}_q$ be a finite field of order $q.$ We prove that if $d\ge 2$ is even and $E \subset {\Bbb F}_q^d$ with $|E| \ge 9q^{\frac{d}{2}}$ then $$ {\Bbb F}_q=\frac{\Delta(E)}{\Delta(E)}=\left\{ \frac{a}{b}: a \in \Delta(E), b \in…

We show that a family of extremely thin sets satisfy the Erd\H{o}s similarity conjecture. These examples lie outside the range covered by recent work of Shmerkin and Yavicoli \cite{ShmerkinYavicoli2025}. As we shall see, they have small…

We study a finite-field analogue of the Erd\H{o}s distinct distances problem under the Hamming metric. For a set \(S\subseteq \mathbb{F}_q^n\) let $\Delta(S)$ denote the set of Hamming distances determined by \(S\). We prove the lower bound…

In this paper, using the compression method, we recover the lower bound for the Erd\H{o}s unit distance problem and provide an alternative proof to the distinct distance conjecture. In particular, in $\mathbb{R}^k$ for all $k\geq 2$, we…

In this paper we study the cardinality of the dot product set generated by two subsets of vector spaces over finite fields. We notice that the results on the dot product problems for one set can be simply extended to two sets. Let E and F…

In this paper, we prove that a set of $N$ points in ${\bf R}^2$ has at least $c{N \over \log N}$ distinct distances, thus obtaining the sharp exponent in a problem of Erd\"os. We follow the set-up of Elekes and Sharir which, in the spirit…

For a set $E\subset \mathbb F_q^d$, we define the $k$-resultant magnitude set as $ \Delta_k(E) =\{\|\textbf{x}_1 + \dots + \textbf{x}_k\|\in \mathbb F_q: \textbf{x}_1, \dots, \textbf{x}_k \in E\},$ where $\|\textbf{v}\|=v_1^2+\cdots+ v_d^2$…

Let $\mathbb{F}_q$ denote the finite field of $q$ elements. For $E \subset \mathbb{F}_q^d$, denote the distance set $\Delta(E)= \{\|x-y\|^2:=(x_1-y_1)^2+ \cdots + (x_d-y_d)^2 : (x,y)\in E^2 \}$. The Erdos quotient set problem was introduced…