Solutions of polynomial equation over $\mathbb{F}_p$ and new bounds of additive energy

We prove a Roth type theorem for polynomial corners in the finite field setting. Let $\phi_1$ and $\phi_2$ be two polynomials of distinct degree. For sufficiently large primes $p$, any subset $ A \subset \mathbb F_p \times \mathbb F_p$ with $ \lvert A\rvert > p ^{2 - \frac1{16}} $ contains three points $ (x_1, x_2) , (x_1 + \phi_1 (y), x_2), (x_1, x_2 + \phi_2 (y))$. The study of these questions on $ \mathbb F_p$ was started by Bourgain and Chang. Our Theorem adapts the argum...

A long standing problem has been to develop "good" binary linear codes to be used for error-correction. This paper investigates in some detail an attack on this problem using a connection between quadratic residue codes and hyperelliptic curves. One question which coding theory is used to attack is: Does there exist a c<2 such that, for all sufficiently large $p$ and all subsets S of GF(p), we have |X_S(GF(p))| < cp?

Recently there has been much interest in Gowers uniformity norms from the perspective of theoretical computer science. This is mainly due to the fact that these norms provide a method for testing whether the maximum correlation of a function $f:\mathbb{F}_p^n \rightarrow \mathbb{F}_p$ with polynomials of degree at most $d \le p$ is non-negligible, while making only a constant number of queries to the function. This is an instance of {\em correlation testing}. In this framewor...

We study the number of the vectors determined by two sets in d-dimensional vector spaces over finite fields. We observe that the lower bound of cardinality for the set of vectors can be given in view of an additive energy or the decay of the Fourier transform on given sets. As an application of our observation, we find sufficient conditions on sets where the Falconer distance conjecture for finite fields holds in two dimension. Moreover, we give an alternative proof of the th...

We establish a number of uncertainty inequalities for the additive group of a finite affine plane, showing that for $p$ prime, a nonzero function $f\colon\mathbb F_p^2\to\mathbb C$ and its Fourier transform $\hat f\colon\widehat{\mathbb F_p^2}\to\mathbb C$ cannot have small supports simultaneously. The "baseline" of our investigation is the well-known Meshulam's bound, which we sharpen, for the particular groups under consideration, taking into account not only the sizes of t...

Je retracerai l'histoire des conjectures de Weil sur le nombre de solutions d'\'equations polynomiales dans un corps fini et quelques unes des approches qui ont \'et\'e propos\'ees pour les r\'esoudre. The Weil conjectures: origins, approaches, generalizations. I recount the history of the conjectures by Weil on the number of solutions of polynomial equations in finite fields, and some of the approaches that have been proposed to solve them.

Let $\mathbb{F}_p$ be a prime field, and ${\mathcal E}$ a set in $\mathbb{F}_p^2$. Let $\Delta({\mathcal E})=\{||x-y||: x,y \in {\mathcal E} \}$, the distance set of ${\mathcal E}$. In this paper, we provide a quantitative connection between the distance set $\Delta({\mathcal E})$ and the set of rectangles determined by points in ${\mathcal E}$. As a consequence, we obtain a new lower bound on the size of $\Delta({\mathcal E})$ when ${\mathcal E}$ is not too large, improving ...

Let $q$ be a power of a prime and $\mathbb{F}_q$ the finite field consisting of $q$ elements. We prove explicit upper bounds on the number of incidences between lines and Cartesian products in $\mathbb{F}_q^2$. We also use our results on point-line incidences to give new sum-product type estimates concerning sums of reciprocals.

In this sequence of work we investigate polynomial equations of additive functions. We consider the solutions of equation \[ \sum_{i=1}^{n}f_{i}(x^{p_{i}})g_{i}(x)^{q_{i}}= 0 \qquad \left(x\in \mathbb{F}\right), \] where $n$ is a positive integer, $\mathbb{F}\subset \mathbb{C}$ is a field, $f_{i}, g_{i}\colon \mathbb{F}\to \mathbb{C}$ are additive functions and $p_i, q_i$ are positive integers for all $i=1, \ldots, n$. Using the theory of decomposable functions we descr...

We obtain a polynomial upper bound in the finite-field version of the multidimensional polynomial Szemer\'{e}di theorem for distinct-degree polynomials. That is, if $P_1, ..., P_t$ are nonconstant integer polynomials of distinct degrees and $v_1, ..., v_t$ are nonzero vectors in $\mathbb{F}_p^D$, we show that each subset of $\mathbb{F}_p^D$ lacking a nontrivial configuration of the form $$ x, x + v_1 P_1(y), ..., x + v_t P_t(y)$$ has at most $O(p^{D-c})$ elements. In doing ...