Papers
Topics
Authors
Recent
Search
2000 character limit reached

Sharp Effective Finite-Field Nullstellensatz

Published 17 Nov 2021 in math.CO, cs.CC, and math.AC | (2111.09305v3)

Abstract: The (weak) Nullstellensatz over finite fields says that if P1,…,PmP_1,\ldots,P_m are nn-variate degree-dd polynomials with no common zero over a finite field F\mathbb{F} then there are polynomials R1,…,RmR_1,\ldots,R_m such that R1P1+⋯+RmPm≡1R_1P_1+\cdots+R_mP_m \equiv 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 RiR_i can be bounded independently of nn, though with an Ackermann-type dependence on the other parameters mm, dd, and ∣F∣|\mathbb{F}|. In this paper we use the polynomial method to give a proof with a degree bound of md(∣F∣−1)md(|\mathbb{F}|-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 PiP_i take finitely many values on said subset.

Authors (2)
Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.