Search arXivSearch

arXiv · 2509.17563

Incidence theorems for multivariate polynomials over finite fields

Abstract

We study incidence problems for multivariate polynomials over a finite field $\mathbb{F}_q$. Given two families of $m$-variate polynomials, we count the number of triples $(f,g,x)$ such that $f$ belongs to the first family, $g$ belongs to the second family, $x\in\mathbb{F}_q^m$, and $f(x)=g(x)$. We show that for any subsets $\mathcal{L},\mathcal{L}'\subseteq V_{m,r}$, where $V_{m,r}$ denotes the vector space of all $m$-variate polynomials over $\mathbb{F}_q$ of degree at most $r$, the number of such triples is at most $$q^{m-1}|\mathcal{L}||\mathcal{L}'|+O\big(q^{\dim V_{m,r}-1}\sqrt{|\mathcal{L}||\mathcal{L}'|}\big).$$ We further show that if $\mathcal{L}$ and $\mathcal{L}'$ are contained in a subspace $V\subseteq V_{m,r}$ satisfying a suitable separating condition, then the same estimate holds with $\dim V_{m,r}$ replaced by $\dim V$. Our upper bound is essentially sharp when $q^{m-1}|\mathcal{L}||\mathcal{L}'|$ 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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chong Shangguan, Yulin Yang, Tao Zhang. 2026-07-07. Incidence theorems for multivariate polynomials over finite fields. https://arxiv.org/abs/2509.17563

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO