Sharp Effective Finite-Field Nullstellensatz

11/17/2021
by   Guy Moshkovitz, et al.
0

The (weak) Nullstellensatz over finite fields says that if P_1,…,P_m are n-variate degree-d polynomials with no common zero over a finite field 𝔽 then there are polynomials R_1,…,R_m such that R_1P_1+⋯+R_mP_m ≡ 1. Green and Tao [Contrib. Discrete Math. 2009, Proposition 9.1] used a regularity lemma to obtain an effective proof, showing that the degrees of the polynomials R_i can be bounded independently of n, though with an Ackermann-type dependence on the other parameters m, d, and |𝔽|. In this paper we use the polynomial method to give a proof with a degree bound of md(|𝔽|-1). We also show that the dependence on each of the parameters is the best possible up to an absolute constant. We further include a generalization, offered by Pete L. Clark, from finite fields to arbitrary subsets in arbitrary fields, provided the polynomials P_i take finitely many values on said subset.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/21/2019

A polynomial approach to the Collatz conjecture

The Collatz conjecture is explored using polynomials based on a binary n...
research
07/25/2018

Toward an Optimal Quantum Algorithm for Polynomial Factorization over Finite Fields

We present a randomized quantum algorithm for polynomial factorization o...
research
08/02/2023

Permutation and local permutation polynomial of maximum degree

Let F_q be the finite field with q elements and F_q[x_1,…, x_n] the ring...
research
09/06/2018

The Minrank of Random Graphs over Arbitrary Fields

The minrank of a graph G on the set of vertices [n] over a field F is th...
research
11/08/2022

Bounds on the differential uniformity of the Wan-Lidl polynomials

We study the differential uniformity of the Wan-Lidl polynomials over fi...
research
08/30/2017

Identity Testing from High Powers of Polynomials of Large Degree over Finite Fields

We consider the problem of identity testing of two "hidden" monic polyno...
research
01/05/2021

Modified discrete Laguerre polynomials for efficient computation of exponentially bounded Matsubara sums

We develop a new type of orthogonal polynomial, the modified discrete La...

Please sign up or login with your details

Forgot password? Click here to reset