Skip to content
Preprint

A Szemer\'edi-Trotter Theorem in Arbitrary Fields

Sep 2026 · 8 citations · ⚡ 3 influential · 25 references
Mathematics

Abstract

Let $k$ be a field of characteristic $p\ge0$. We prove that $m$ points and $n$ lines in $k^2$ determine at most $3(mn)^{2/3}+m+n+2mn/p$ incidences, the last term being omitted in characteristic zero. Over the prime field $\mathbb{F}_p$ the coefficient of $mn/p$ can be replaced by $1$. The proof uses the polynomial method, and for $m=n$ the bound is sharp up to an absolute constant over prime fields. As applications, over prime fields in which $-1$ is not a square we obtain the $L^2\to L^r$ extension estimate for the paraboloid in $\mathbb{F}_p^3$ for $r>10/3$. Over every odd prime field, we show that a two-source extractor construction of Bourgain has exponentially small error at every min-entropy rate greater than $1/3$. We also improve sum-product estimates for small sets in positive characteristic and obtain projection and Furstenberg estimates over prime fields. The incidence inequalities with exact constants have been formalized in Lean.

View source

Similar papers

Preprint Oct 2026

Szemer\'edi's theorem with random differences and arithmetic Kakeya

We prove that there exists an absolute constant $c>0$ such that the following holds for every $k \ge 3$ and $p \ge n^{-c / \log \log k}$. Letting $\delta>0$ and $D \sim [n]_p$, with high probability every ${S \subset [n]}$ with $|S| \ge \delta n$ contains a $k$-term arithmetic progression whose common difference lies i...

Gabriel Dahia · 0 citations
Preprint Oct 2026

Two proofs and a tight Szemer\'edi--Trotter theorem

The Szemer\'edi--Trotter theorem, a fundamental theorem in incidence geometry, states that $n$ points and $m$ lines in $\mathbb{R}^2$ form at most $O(m+n+m^{2/3}n^{2/3})$ incidences. Recently, Lewko and independently Miao--Xie extended the Szemer\'edi--Trotter theorem to arbitrary fields with a correction term $O(\frac...

Hung-Hsun Hans Yu · 1 citation
Preprint Oct 2026

On Lehmer's Problem

Let $m\geq 2$ be an integer, and let $d\geq 2$ be an even integer. We study monic, reciprocal, non-cyclotomic polynomials $$ P(x)=x^d+a_{d-1}x^{d-1}+\cdots+a_1x+1\in\mathbb{Z}[x]. $$ For a fixed residue class $r\in\{0,1,\ldots,m-1\}$, we prove that there exists an effectively computable constant $c_{r,m}>1$ such that t...

Piyush Kumar Jha, R. Thangadurai · 0 citations
Preprint Nov 2026

Linear-exponent bounds for the automatic complexity of rational diagonals modulo prime powers

Let $p$ be a prime and let $G$ be the diagonal of $N/Q$ in $m$ variables over the $p$-adic integers, with $Q(0)$ a unit. We prove that the $p$-kernel of the coefficients of $G$ modulo $p^\alpha$ has size $K_\alpha(G)\le p^{(|J|+1)\alpha-1}+(p^\alpha-1)/(p-1)$, where $J$ is an explicit finite support set determined by t...

Alexey A. Shvets · 0 citations
Preprint Sep 2026

Polynomial identities, central polynomials and cocharacters of $M_2(F)$ with transpose superinvolution

Let $F$ be a field of characteristic zero and consider $M_2(F),$ the algebra of $2\times 2$ matrices over $F,$ with canonical $\mathbb{Z}_2$-grading and endowed with transpose superinvolution. In this paper, we present the generators of the $T_2^*$-ideal of $*$-identities and of the $T_2^*$-subspace of central $*$-poly...

R. B. dos Santos, L. Reis · 1 citation
Preprint Oct 2026

Wendt's determinant and finiteness of prime characteristics for permutation binomials

For $f(X)=X^r(X^s+a)\in\mathbb F_{p^m}[X]$, with $m,r,s\geqslant1$ and $a\in\mathbb F_{p^m}^\times$, put $g=\gcd(s,p^m-1)$. We prove that, for each fixed $g$, only finitely many prime characteristics $p$ admit such permutation binomials, even as $m,r,s,a$ vary. If $6\nmid g$, every such $p$ divides Wendt's determinant...

Zhi-Chao Tang, Xiang Fan · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.