Combinatorial Nullstellensatz Techniques
Daniel L. Freed
TL;DR
This paper explores various techniques for applying Combinatorial Nullstellensatz to polynomials over finite fields, including generalizations of existing theorems and new methods.
Contribution
It introduces new techniques and generalizations for applying Combinatorial Nullstellensatz in finite field polynomial problems.
Findings
Generalized Alon's theorems
Developed new Nullstellensatz techniques
Enhanced understanding of polynomial applications
Abstract
We present different techniques for applying Combinatorial Nullstellensatz to polynomials over finite fields. For examples, we generalize theorems from Noga Alon's paper on the subject, and present a few of our own.
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 · Advanced Combinatorial Mathematics