Pith. sign in

REVIEW

Sharp Effective Finite-Field Nullstellensatz

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2111.09305 v3 pith:Q32EZP3V submitted 2021-11-17 math.CO cs.CCmath.AC

Sharp Effective Finite-Field Nullstellensatz

classification math.CO cs.CCmath.AC
keywords polynomialsfieldsfinitemathbbarbitrarydependenceeffectiveldots
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original 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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.