Polynomial equations modulo prime numbers

MaRDI QIDQ6404810zbMATH OpenFDO

Authors Arnaud Bodin, Pierre Dèbes, Salah Najib

Publication date 13 July 2022

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Congruences in many variables (11D79) Sums over primes (11L20) Finite ground fields in algebraic geometry (14G15) Counting solutions of Diophantine equations (11D45)

Abstract: 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^{e}psilon$ multiplicative factor. Our second contribution is a reduction lemma to the case of a single equation which we use to extend our results to systems of equations. We show further how to use this reduction to prove the full Lang-Weil estimate for varieties, assuming it for hypersurfaces, in a version using a variant of the classical degree in the error term.

This page was built for publication: Polynomial equations modulo prime numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6404810)