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

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…

We study the projections in vector spaces over finite fields. We prove finite fields analogues of the bounds on the dimensions of the exceptional sets for Euclidean projection mapping. We provide examples which do not have exceptional…

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…

In 1997, Erd\H{o}s asked whether for arbitrarily large $n$ there exists a set of $n$ points in $\mathbb{R}^2$ that determines $O(\frac{n}{\sqrt{\log n}})$ distinct distances while satisfying the local constraint that every 4-point subset…

We discuss an elementary, yet unsolved, problem of Niederreiter concerning the enumeration of a class of subspaces of finite dimensional vector spaces over finite fields. A short and self-contained account of some recent progress on this…

We prove various results on the size and structure of subsets of vector spaces over finite fields which, in some sense, have too many mutually orthogonal pairs of vectors. In particular, we obtain sharp finite field variants of a theorem of…

For large enough (but fixed) prime powers $q$, and trace functions to squarefree moduli in $\mathbb{F}_q[u]$ with slopes at most $1$ at infinity, and no Artin--Schreier factors in their geometric global monodromy, we come close to…

We obtain a substantially improved lower bound for the minimum overlap problem asked by Erd\H{o}s. Our approach uses elementary Fourier analysis to translate the problem to a convex optimization program.

In this paper we study extension theorems associated with general varieties in two dimensional vector spaces over finite fields. Applying Bezout's theorem, we obtain the sufficient and necessary conditions on general curves where sharp…

We show that large subsets of vector spaces over finite fields determine certain point configurations with prescribed distance structure. More specifically, we consider the complete graph with vertices as the points of $A \subseteq…

We prove that if a subset of a $d$-dimensional vector space over a finite field with $q$ elements has more than $q^{d-1}$ elements, then it determines all the possible directions. If a set has more than $q^k$ elements, it determines a…

We show that if compact set $E\subset \mathbb{R}^d$ has Hausdorff dimension larger than $\frac{d}{2}+\frac{1}{4}$, where $d\geq 4$ is an even integer, then the distance set of $E$ has positive Lebesgue measure. This improves the previously…

We bound the number of incidences between points and spheres in finite vector spaces by bounding the sum of the number of points in the pairwise intersections of the spheres. We obtain new incidence bounds that are interesting when the…

A $(k,m)$-Furstenberg set is a subset $S \subset \mathbb{F}_q^n$ with the property that each $k$-dimensional subspace of $\mathbb{F}_q^n$ can be translated so that it intersects $S$ in at least $m$ points. Ellenberg and Erman proved that…

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 $A$ and $B$ be sets in a finite vector space. In this paper, we study the magnitude of the set $A\cap f(B)$, where $f$ runs through a set of transformations. More precisely, we will focus on the cases that the set of transformations is…

Let $\mathbb{F}_q$ be the finite field of $q$ elements and $a_1,a_2, \ldots, a_k, b\in \mathbb{F}_q$. We investigate $N_{\mathbb{F}_q}(a_1, a_2, \ldots,a_k;b)$, the number of ordered solutions $(x_1, x_2, \ldots,x_k)\in\mathbb{F}_q^k$ of…

The Erd\H{o}s distinct distance problem is a ubiquitous problem in discrete geometry. Somewhat less well known is Erd\H{o}s' distinct angle problem, the problem of finding the minimum number of distinct angles between $n$ non-collinear…

In this paper we study the following multi-parameter variant of the celebrated Falconer distance problem. Given ${\textbf{d}}=(d_1,d_2, \dots, d_{\ell})\in \mathbb{N}^{\ell}$ with $d_1+d_2+\dots+d_{\ell}=d$ and $E \subseteq \mathbb{R}^d$,…

Let $\mathbb{F}_q$ be a finite field of order $q$. Iosevich and Rudnev (2005) proved that for any set $A\subset \mathbb{F}_q^d$, if $|A|\gg q^{\frac{d+1}{2}}$, then the distance set $\Delta(A)$ contains a positive proportion of all…