English
Related papers

Related papers: Generalized incidence theorems, homogeneous forms,…

200 papers

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…

Classical Analysis and ODEs · Mathematics 2007-07-31 Derrick Hart , Alex Iosevich , Doowon Koh , Misha Rudnev

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…

Combinatorics · Mathematics 2009-03-17 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

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

This thesis establishes new quantitative records in several problems of incidence geometry and growth. After the necessary background in Chapters 1, 2 and 3, the following results are proven. Chapter 4 gives new results in the incidence…

Combinatorics · Mathematics 2016-11-04 Timothy G. F. Jones

Let $F$ be a field with positive odd characteristic $p$. We prove a variety of new sum-product type estimates over $F$. They are derived from the theorem that the number of incidences between $m$ points and $n$ planes in the projective…

Combinatorics · Mathematics 2016-09-06 Oliver Roche-Newton , Misha Rudnev , Ilya D. Shkredov

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

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

Let $E \subseteq \mathbb{F}_q^2$ be a set in the 2-dimensional vector space over a finite field with $q$ elements. We prove an identity for the second moment of its incidence function and deduce a variety of existing results from the…

Combinatorics · Mathematics 2016-11-17 Brendan Murphy , Giorgis Petridis

This is an expository survey on recent sum-product results in finite fields. We present a number of sum-product or "expander" results that say that if $|A| > p^{2/3}$ then some set determined by sums and product of elements of $A$ is nearly…

Combinatorics · Mathematics 2017-01-09 Brendan Murphy , Giorgis Petridis

We prove that if $A \subset {\Bbb F}_q$ is such that $$|A|>q^{{1/2}+\frac{1}{2d}},$$ then $${\Bbb F}_q^{*} \subset dA^2=A^2+...+A^2 d \text{times},$$ where $$A^2=\{a \cdot a': a,a' \in A\},$$ and where ${\Bbb F}_q^{*}$ denotes the…

Number Theory · Mathematics 2007-06-27 Derrick Hart , Alex Iosevich

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

We introduce and study finite $d$-volumes - the high dimensional generalization of finite metric spaces. Having developed a suitable combinatorial machinery, we define $\ell_1$-volumes and show that they contain Euclidean volumes and…

Data Structures and Algorithms · Computer Science 2010-08-03 Ilan Newman , Yuri Rabinovich

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

In this short note, we study the distribution of spreads in a point set $\mathcal{P} \subseteq \mathbb{F}_q^d$, which are analogous to angles in Euclidean space. More precisely, we prove that, for any $\varepsilon > 0$, if $|\mathcal{P}|…

Combinatorics · Mathematics 2018-01-03 Ben Lund , Thang Pham , Le Anh Vinh

We derive a general upper bound for the number of incidences with $k$-dimensional varieties in ${\mathbb R}^d$. The leading term of this new bound generalizes previous bounds for the special cases of $k=1, k=d-1,$ and $k= d/2$, to every…

Combinatorics · Mathematics 2018-09-13 Thao Do , Adam Sheffer

Let $A$ be a subset of a finite field $F := \Z/q\Z$ for some prime $q$. If $|F|^\delta < |A| < |F|^{1-\delta}$ for some $\delta > 0$, then we prove the estimate $|A+A| + |A.A| \geq c(\delta) |A|^{1+\eps}$ for some $\eps = \eps(\delta) > 0$.…

Combinatorics · Mathematics 2007-05-23 Jean Bourgain , Nets Katz , Terence Tao

We provide a unified approach, via deformations of incidence algebras, to several important types of representations with finiteness conditions, as well as the combinatorial algebras which produce them. We show that over finite dimensional…

Representation Theory · Mathematics 2018-05-07 Miodrag C. Iovanov , Gerard D. Koffi

We obtain some asymptotic formulae (with power savings in their error terms) for the number of quadruples in the Cartesian product of an arbitrary set $A \subset \mathbf{R}$ and for the number of quintuplets in $A\times A$ for any subset…

Number Theory · Mathematics 2022-01-21 Ilya D. Shkredov

Given two points $p,q$ in the real plane, the signed area of the rectangle with the diagonal $[pq]$ equals the square of the Minkowski distance between the points $p,q$. We prove that $N>1$ points in the Minkowski plane $\R^{1,1}$ generate…

Combinatorics · Mathematics 2013-03-18 Oliver Roche-Newton , Misha Rudnev
‹ Prev 1 2 3 10 Next ›