English
Related papers

Related papers: Averages over hyperplanes, sum-product theory in v…

200 papers

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

In recent years, sum-product estimates in Euclidean space and finite fields have been studied using a variety of combinatorial, number theoretic and analytic methods. Erdos type problems involving the distribution of distances, areas and…

Combinatorics · Mathematics 2008-03-31 David Covert , Derrick Hart , Alex Iosevich , Doowon Koh , Misha Rudnev

Let $\mathbb{F}_q$ be a finite field of $q$ elements where $q$ is a large odd prime power and $Q =a_1 x_1^{c_1}+...+a_dx_d^{c_d}\in \mathbb{F}_q[x_1,...,x_d]$, where $2\le c_i\le N$, $\gcd(c_i,q)=1$, and $a_i\in \mathbb{F}_q$ for all $1\le…

Combinatorics · Mathematics 2016-08-18 Nguyen Duy Phuong , Pham Van Thang , Le Anh Vinh

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…

Combinatorics · Mathematics 2025-10-01 Doowon Koh , Ben Lund , Chuandong Xu , Semin Yoo

In this paper, we prove a new point-sphere incidence bound in vector spaces over finite fields. More precisely, let $P$ be a set of points and $S$ be a set of spheres in $\mathbb{F}_q^d$. Suppose that $|P|, |S|\le N$, we prove that the…

Combinatorics · Mathematics 2021-09-20 Doowon Koh , Thang Pham

In this paper we investigate the Erd\"os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We prove a good upper bound for spherical means that have been…

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

Incidence problems between geometric objects is a key area of focus in the field of discrete geometry. Among them, the study of incidence problems over finite fields have received a considerable amount of attention in recent years. In this…

Combinatorics · Mathematics 2025-05-01 Xiangliang Kong , Itzhak Tamo

We prove the first inverse theorem for point--sphere incidence bounds over finite fields in dimensions $d \ge 3$, showing that near-extremality forces algebraic rigidity. While sharp upper bounds have been known for over a decade, the…

Combinatorics · Mathematics 2026-02-12 Shalender Singh , Vishnu Priya Singh

In this paper we introduce a unified approach to deal with incidence problems between points and varieties over finite fields. More precisely, we prove that the number of incidences $I(\mathcal{P}, \mathcal{V})$ between a set $\mathcal{P}$…

Combinatorics · Mathematics 2016-01-05 Nguyen Duy Phuong , Thang Pham , Nguyen Minh Sang , Claudiu Valculescu , Le Anh Vinh

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

We prove a new upper bound for the number of incidences between points and lines in a plane over an arbitrary field $\mathbb{F}$, a problem first considered by Bourgain, Katz and Tao. Specifically, we show that $m$ points and $n$ lines in…

Combinatorics · Mathematics 2017-08-16 Sophie Stevens , Frank de Zeeuw

In this paper we prove, for all $d \ge 2$, that for no $s<\frac{d+1}{2}$ does $I_s(\mu)<\infty$ imply the canonical Falconer distance problem incidence bound, or the analogous estimate where the Euclidean norm is replaced by the norm…

Combinatorics · Mathematics 2010-06-09 Alex Iosevich , Steven Senger

A celebrated unit distance conjecture due to Erd\H os says that that the unit distances cannot arise more than $C_{\epsilon}n^{1+\epsilon}$ times (for any $\epsilon>0$) among $n$ points in the Euclidean plane (see e.g. \cite{SST84} and the…

Combinatorics · Mathematics 2022-02-14 A. Gafni , A. Iosevich , E. Wyman

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 an incidence theorem for points and planes in the projective space $\mathbb P^3$ over any field $\mathbb F$, whose characteristic $p\neq 2.$ An incidence is viewed as an intersection along a line of a pair of two-planes from two…

Combinatorics · Mathematics 2015-12-07 Misha Rudnev

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 prove the first incidence bound for points and conics over prime fields. As applications, we prove new results on expansion of bivariate polynomial images and on certain variations of distinct distances problems. These…

Combinatorics · Mathematics 2023-01-13 Ali Mohammadi , Thang Pham , Audie Warren

Let $\mathbb{F}$ be a field, let $P \subseteq \mathbb{F}^d$ be a finite set of points, and let $\alpha,\beta \in \mathbb{F} \setminus \{0\}$. We study the quantity \[|\Pi_{\alpha, \beta}| = \{(p,q,r) \in P \times P \times P \mid p \cdot q =…

Combinatorics · Mathematics 2015-09-08 Ben Lund

Here we examine some Erdos-Falconer-type problems in vector spaces over finite fields involving right angles. Our main goals are to show that a) a subset A of F_q^d of size >> q^[(d+2)/3] contains three points which generate a right angle,…

Combinatorics · Mathematics 2018-06-15 Michael Bennett

We establish a sharp point-sphere incidence bound in finite fields for point sets exhibiting controlled additive structure. Working in the framework of \((4,s)\)-Salem sets, which quantify pseudorandomness via fourth-order additive energy,…

Combinatorics · Mathematics 2026-04-30 Steven Senger , Dung The Tran
‹ Prev 1 2 3 10 Next ›