Generalized incidence theorems, homogeneous forms, and sum-product estimates in finite fields
David Covert, Derrick Hart, Alex Iosevich, Doowon Koh, Misha Rudnev

TL;DR
This paper establishes new incidence theorems and sum-product estimates in finite fields, demonstrating sharp bounds on the distribution of volumes determined by subsets of vector spaces, with implications for combinatorial geometry.
Contribution
It proves a function version of incidence results and derives sharp bounds on volume distributions for subsets of finite field vector spaces, extending previous geometric and combinatorial results.
Findings
Volumes of parallelepipeds cover entire finite field for large product sets in high dimensions.
In three dimensions, volume sets cover a positive proportion of the field under size conditions.
Results are sharp, demonstrated by specific subset constructions.
Abstract
In recent years, sum-product estimates in Euclidean space and finite fields have been studied using a variety of combinatorial, number theoretic and analytic methods. Erdos type problems involving the distribution of distances, areas and volumes have also received much attention. In this paper we prove a relatively straightforward function version of an incidence results for points and planes previously established in \cite{HI07} and \cite{HIKR07}. As a consequence of our methods, we obtain sharp or near sharp results on the distribution of volumes determined by subsets of vector spaces over finite fields and the associated arithmetic expressions. In particular, our machinery enables us to prove that if , , the -dimensional vector space over a finite field , of size much greater than , and if is a product set, then…
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 · Mathematical Approximation and Integration · Coding theory and cryptography
