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

We prove a nontrivial energy bound for a finite set of affine transformations over a general field and discuss a number of implications. These include new bounds on growth in the affine group, a quantitative version of a theorem by Elekes about rich lines in grids. We also give a positive answer to a question of Yufei Zhao that for a plane point set P for which no line contains a positive proportion of points from P, there may be at most one line, meeting the set of lines def...

We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound for the number of solutions modulo $p$, only differing from Lang-Weil by an asymptotic $p^\epsilon$ multiplicative factor. Our second contribution is a reduction lemma to the case of a single equation which we use to extend our results to sy...

Let $p$ be a large prime, $\ell\geq 2$ be a positive integer, $m\geq 2$ be an integer relatively prime to $\ell$ and $P(x)\in\mathbb{F}_p[x]$ be a polynomial which is not a complete $\ell'$-th power for any $\ell'$ for which $GCD(\ell',\ell)=1$. Let $\mathcal{C}$ be the curve defined by the equation $y^{\ell}=P(x)$, and take the points on $\mathcal{C}$ to lie in the rectangle $[0,p-1]^2$. In this paper, we study the distribution of the number of points on $\mathcal{C}$ inside...

Let $k,p\in \mathbb{N}$ with $p$ prime and let $f\in\mathbb{Z}[x_1,x_2]$ be a bivariate polynomial with degree $d$ and all coefficients of absolute value at most $p^k$. Suppose also that $f$ is variable separated, i.e., $f=g_1+g_2$ for $g_i\in\mathbb{Z}[x_i]$. We give the first algorithm, with complexity sub-linear in $p$, to count the number of roots of $f$ over $\mathbb{Z}$ mod $p^k$ for arbitrary $k$: Our Las Vegas randomized algorithm works in time $(dk\log p)^{O(1)}\sqrt...

These are the notes of my lectures at the 1996 European Congress of Mathematicians. {} Polynomials appear in mathematics frequently, and we all know from experience that low degree polynomials are easier to deal with than high degree ones. It is, however, not clear that there is a well defined class of "low degree" polynomials. For many questions, polynomials behave well if their degree is low enough, but the precise bound on the degree depends on the concrete problem. {} It ...

We prove that, under certain conditions on the function pair $\varphi_1$ and $\varphi_2$, bilinear average $p^{-1}\sum_{y\in \mathbb{F}_p}f_1(x+\varphi_1(y)) f_2(x+\varphi_2(y))$ along curve $(\varphi_1, \varphi_2)$ satisfies certain decay estimate. As a consequence, Roth type theorems hold in the setting of finite fields. In particular, if $\varphi_1,\varphi_2\in \mathbb{F}_p[X]$ with $\varphi_1(0)=\varphi_2(0)=0$ are linearly independent polynomials, then for any $A\subset ...

We obtain function field analogues of recent energy bounds on modular square roots and modular inversions and apply them to bounding some bilinear sums and to some questions regarding smooth and square-free polynomials in residue classes.

In this article, we use the Combinatorial Nullstellensatz to give new proofs of the Cauchy-Davenport, the Dias da Silva-Hamidoune and to generalize a previous addition theorem of the author. Precisely, this last result proves that for a set A $\subset$ Fp such that A $\cap$ (--A) = $\emptyset$ the cardinality of the set of subsums of at least $\alpha$ pairwise distinct elements of A is: |$\Sigma$$\alpha$(A)| $\ge$ min (p, |A|(|A| + 1)/2 -- $\alpha$($\alpha$ + 1)/2 + 1) , the ...

Consider any nonzero univariate polynomial with rational coefficients, presented as an elementary algebraic expression (using only integer exponents). Letting sigma(f) denotes the additive complexity of f, we show that the number of rational roots of f is no more than 15 + sigma(f)^2 (24.01)^{sigma(f)} sigma(f)!. This provides a sharper arithmetic analogue of earlier results of Dima Grigoriev and Jean-Jacques Risler, which gave a bound of C^{sigma(f)^2} for the number of real...

Let P be a set of points and $L$ a set of lines in (F_p)^2, with |P|,|L|\leq N and N<p. We show that P and L generate no more than C N^(3/2 - 1/806 + o(1)) incidences for some absolute constant C. This improves by an order of magnitude on the previously best-known bound of C N^(3/2 - 1/10678).