A Polynomial Roth Theorem for Corners in Finite Fields
Rui Han, Michael T Lacey, Fan Yang

TL;DR
This paper establishes a polynomial Roth theorem for corners in finite fields, demonstrating that large subsets contain specific polynomial-configured point triples, extending prior work with advanced algebraic tools.
Contribution
It introduces a new polynomial Roth theorem for corners in finite fields, utilizing deep Weil inequalities and adapting existing arguments to this polynomial setting.
Findings
Large subsets contain polynomial corners with distinct degree polynomials.
The proof relies on Weil type inequalities by N. Katz.
Extends previous results on polynomial configurations in finite fields.
Abstract
We prove a Roth type theorem for polynomial corners in the finite field setting. Let and be two polynomials of distinct degree. For sufficiently large primes , any subset with contains three points . The study of these questions on was started by Bourgain and Chang. Our Theorem adapts the argument of Dong, Li and Sawin, in particular relying upon deep Weil type inequalities established by N. Katz.
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
TopicsLimits and Structures in Graph Theory · Finite Group Theory Research · Analytic Number Theory Research
