Multidimensional polynomial Szemer\'{e}di theorem in finite fields for polynomials of distinct degrees
Borys Kuca

TL;DR
This paper proves a finite-field version of the multidimensional polynomial Szemerédi theorem for polynomials of distinct degrees, providing polynomial bounds on the size of subsets lacking certain polynomial configurations.
Contribution
It introduces a polynomial upper bound for the finite-field multidimensional polynomial Szemerédi theorem involving distinct-degree polynomials, extending Gowers norms with a vector-adapted approach.
Findings
Sets lacking the polynomial configurations are of size at most O(p^{D-c})
Extension of Gowers norms along vectors from ergodic theory
Application to finite fields with polynomial bounds
Abstract
We obtain a polynomial upper bound in the finite-field version of the multidimensional polynomial Szemer\'{e}di theorem for distinct-degree polynomials. That is, if are nonconstant integer polynomials of distinct degrees and are nonzero vectors in , we show that each subset of lacking a nontrivial configuration of the form has at most elements. In doing so, we apply the notion of Gowers norms along a vector adapted from ergodic theory, which extends the classical concept of Gowers norms on finite abelian groups.
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 · Limits and Structures in Graph Theory · semigroups and automata theory
