Two Structural Results for Low Degree Polynomials and Applications
Gil Cohen, Avishay Tal

TL;DR
This paper establishes two structural properties of low degree polynomials over finite fields, revealing their behavior on large subspaces and partitions, with implications for extractors and dispersers in theoretical computer science.
Contribution
It introduces new tight bounds on the structure of low degree polynomials and extends these results to multiple polynomials, sparse polynomials, and functions close to low degree, with applications to extractors.
Findings
Existence of large subspaces where low degree polynomials are constant.
Partition of the space into affine subspaces with constant polynomial values.
Extension of results to sparse and approximate low degree polynomials.
Abstract
In this paper, two structural results concerning low degree polynomials over finite fields are given. The first states that over any finite field , for any polynomial on variables with degree , there exists a subspace of with dimension on which is constant. This result is shown to be tight. Stated differently, a degree polynomial cannot compute an affine disperser for dimension smaller than . Using a recursive argument, we obtain our second structural result, showing that any degree polynomial induces a partition of to affine subspaces of dimension , such that is constant on each part. We extend both structural results to more than one polynomial. We further prove an analog of the first structural result to sparse polynomials…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Polynomial and algebraic computation · Cryptography and Residue Arithmetic
