English
Related papers

Related papers: Additive energy and the Falconer distance problem …

200 papers

We study the Erd\"os/Falconer distance problem in vector spaces over finite fields. Let ${\Bbb F}_q$ be a finite field with $q$ elements and take $E \subset {\Bbb F}^d_q$, $d \ge 2$. We develop a Fourier analytic machinery, analogous to…

Classical Analysis and ODEs · Mathematics 2007-05-23 Alex Iosevich , Misha Rudnev

In this paper, we study the cardinality of the distance set $\Delta(A, B)$ determined by two subsets $A$ and $B$ of the $d$-dimensional vector space over a finite field $\mathbb{F}_q$. Assuming that $A$ or $B$ lies in a $k$-coordinate plane…

Combinatorics · Mathematics 2025-06-10 Hunseok Kang , Doowon Koh , Firdavs Rakhmonov

We investigate the size of the distance set determined by two subsets of finite dimensional vector spaces over finite fields. A lower bound of the size is given explicitly in terms of cardinalities of the two subsets. As a result, we…

Combinatorics · Mathematics 2013-04-22 Doowon Koh , Hae-Sang Sun

We consider a finite fields version of the Erd\H{o}s-Falconer distance problem for two different sets. In a certain range for the sizes of the two sets we obtain results of the conjectured order of magnitude.

Number Theory · Mathematics 2012-11-26 Rainer Dietmann

We prove, under suitable conditions, a lower bound on the number of pinned distances determined by small subsets of two-dimensional vector spaces over fields. For finite subsets of the Euclidean plane we prove an upper bound for their…

Combinatorics · Mathematics 2020-12-16 Ben Lund , Giorgis Petridis

For a set $E \subseteq \mathbb{F}_q^d$, the distance set is defined as $\Delta(E) := \{\|\mathbf{x} - \mathbf{y}\| : \mathbf{x}, \mathbf{y} \in E\}$, where $\|\cdot\|$ denotes the standard quadratic form. We investigate the…

Combinatorics · Mathematics 2026-05-28 Daewoong Cheong , Gennian Ge , Doowon Koh , Thang Pham , Dung The Tran , Tao Zhang

art, Iosevich, Koh and Rudnev (2007) show, using Fourier analysis method, that the finite Erd\"os-Falconer distance conjecture holds for subsets of the unit sphere in $\mathbbm{F}_q^d$. In this note, we give a graph theoretic proof of this…

Combinatorics · Mathematics 2008-10-09 Le Anh Vinh

We prove several incidence theorems in vector spaces over finite fields using bounds for various classes of exponential sums and apply these to Erdos-Falconer type distance problems.

Number Theory · Mathematics 2007-05-23 Alex Iosevich , Doowon Koh

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

Classical Analysis and ODEs · Mathematics 2018-01-19 Alex Iosevich , Bochen Liu

The defect of valued field extensions is a major obstacle in open problems in resolution of singularities and in the model theory of valued fields, whenever positive characteristic is involved. We continue the detailed study of defect…

Commutative Algebra · Mathematics 2017-05-29 Anna Blaszczok , Franz-Viktor Kuhlmann

We prove a new lower bound for the number of pinned distances over finite fields: if $A$ is a sufficiently small subset of $\mathbb{F}_q^2$, then there is an element in $A$ that determines $\gg |A|^{2/3}$ distinct distances to other…

Combinatorics · Mathematics 2019-11-04 Brendan Murphy , Misha Rudnev , Sophie Stevens

We study the Falconer distance set problem in Euclidean space and obtain improved dimensional estimates under natural Fourier analytic assumptions cast in terms of the Fourier dimension and spectrum. Interestingly, under reasonably mild…

Classical Analysis and ODEs · Mathematics 2026-04-22 Jonathan M. Fraser , Thang Pham

Let $S \subset {\mathbb R}^d$ be contained in the unit ball. Let $\Delta(S)=\{||a-b||:a,b \in S\}$, the Euclidean distance set of $S$. Falconer conjectured that the $\Delta(S)$ has positive Lebesque measure if the Hausdorff dimension of $S$…

Classical Analysis and ODEs · Mathematics 2007-05-23 A. Iosevich , M. Rudnev

The VC-dimension, introduced by Vapnik and Chervonenkis in 1968 in the context of learning theory, has in recent years provided a rich source of problems in combinatorial geometry. Given $E\subseteq \mathbb{F}_q^d$ or $E\subseteq…

Combinatorics · Mathematics 2025-11-24 Moustapha Diallo , Brian McDonald

An analog of the Falconer distance problem in vector spaces over finite fields asks for the threshold $\alpha>0$ such that $|\Delta(E)| \gtrsim q$ whenever $|E| \gtrsim q^{\alpha}$, where $E \subset {\Bbb F}_q^d$, the $d$-dimensional vector…

Combinatorics · Mathematics 2009-03-26 Jeremy Chapman , M. Burak Erdogan , Derrick Hart , Alex Iosevich , Doowon Koh

An analog of the Falconer distance problem in vector spaces over finite fields asks for the threshold $\alpha>0$ such that $|\Delta(E)| \gtrsim q$ whenever $|E| \gtrsim q^{\alpha}$, where $E \subset {\Bbb F}_q^d$, the $d$-dimensional vector…

Classical Analysis and ODEs · Mathematics 2007-11-30 Derrick Hart , Alex Iosevich

In this paper we study the generalized Erdos-Falconer distance problems in the finite field setting. The generalized distances are defined in terms of polynomials, and various formulas for sizes of distance sets are obtained. In particular,…

Classical Analysis and ODEs · Mathematics 2010-04-26 Doowon Koh , Chun-Yen Shen

Motivated by recent results on radial projections and applications to the celebrated Falconer distance problem, we study radial projections in the setting of finite fields. More precisely, we extend results due to Mattila and Orponen…

Classical Analysis and ODEs · Mathematics 2022-08-02 Ben Lund , Thang Pham , Vu Thi Huong Thu

Let $\mathbb{F}_q$ be an arbitrary finite field, and $\mathcal{E}$ be a set of points in $\mathbb{F}_q^d$. Let $\Delta(\mathcal{E})$ be the set of distances determined by pairs of points in $\mathcal{E}$. By using the Kloosterman sums,…

Combinatorics · Mathematics 2020-07-31 Thang Pham , Le Anh Vinh

We employ signed measures that are positive definite up to certain degrees to establish Levenshtein-type upper bounds on the cardinality of codes with given minimum and maximum distances, and universal lower bounds on the potential energy…

Information Theory · Computer Science 2019-10-17 Peter Boyvalenkov , Peter Dragnev , Douglas Hardin , Edward Saff , Maya Stoyanova
‹ Prev 1 2 3 10 Next ›