Incidence theorems for multivariate polynomials over finite fields
arXiv:2509.17563
Abstract
We study incidence problems for multivariate polynomials over a finite field . Given two families of -variate polynomials, we count the number of triples such that belongs to the first family, belongs to the second family, , and . We show that for any subsets , where denotes the vector space of all -variate polynomials over of degree at most , the number of such triples is at most We further show that if and are contained in a subspace satisfying a suitable separating condition, then the same estimate holds with replaced by . Our upper bound is essentially sharp when dominates the summation. As applications, we derive incidence bounds for points and multivariate polynomials. These results recover and strengthen several previously known bounds for point-line incidences and point-univariate-polynomial incidences. Our proof is spectral, relying on an expander mixing lemma for general abelian Cayley color graphs together with Fourier analysis over finite fields.