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 $P_1,\ldots,P_m$ are $n$-variate degree-$d$ polynomials with no common zero over a finite field $\mathbb{F}$ then there are polynomials $R_1,\ldots,R_m$ such that $R_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 $R_i$ can be bounded independently of $n$, though with an Ackermann-type dependence on the other parameters $m$, $d$, and $|\mathbb{F}|$. In this paper we use the polynomial method to give a proof with a degree bound of $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 $P_i$ take finitely many values on said subset.

Citations (1)

Summary

Paper to Video (Beta)

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.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.