Search arXiv⌕ Search

arXiv · 2610.37532

Relative distality and incidence bounds in positive characteristic

Abstract

We prove Szemerédi-Trotter-type incidence bounds for algebraic relations in any field $F$ admitting a valuation with finite residue field. This includes $\mathbb F_q(t)$, $\mathbb F_q((t))$, and all finitely generated extensions of finite fields. Bays and Martin show that any algebraic $K_{d,s}$-free relation $E\subseteq F^k\times F^\ell$ admits a power-saving in the classical Zarankiewicz bound of Kővári, Sós, and Turán. Answering a question of the authors, we show that this power-saving is uniform in $F$: There is some $ε>0$ depending only on $d$ and the complexity of $E$ (and not on $F$) such that for $A\subseteq F^k$ and $B\subseteq F^\ell$, the number of edges $|E(A,B)|$ is at most $O(|A|^{1-ε}|B|^{1-\frac{1-ε}{d}}+|A|+|B|)$. For the case where $A$ is a set of points and $B$ is a set of lines in $F^2$ and $E$ is the incidence relation, we prove the explicit bound $O(|P|^{\frac{8}{9}}|L|^{\frac{5}{9}}+|P|+|L|)$. As the central ingredient of the proof, we introduce the model-theoretic notion of distality relative to a definable set. We begin developing this notion and prove that the theory of algebraically closed valued fields is distal relative to the residue field. An application of a result of Chernikov, Peterzil, and Starchenko, based on work of Chernikov, Galvin, and Starchenko, yields our incidence bounds.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mira Tartarotti. 2026-10-27. Relative distality and incidence bounds in positive characteristic. https://arxiv.org/abs/2610.37532

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

KEEP EXPLORING

Related papers

Complexity of deep computations via topology of function spaces

We bring Shelah's theory of independence and Todorčević's classification of Rosenthal compacta to bear on limits of computations beyond the continuous case. The first paper of this series characterized computability through continuous extendibility in a framework for floating-point computation. Limits of continuous computations may nevertheless be discontinuous, as familiar iterative algorithms demonstrate. We identify the regime in which these limits remain of the first Baire class and apply its structure theory to classify their complexity. For countably many real-valued features, and assuming continuous extendibility of computations, the absence of the independence property on the prescribed invariant bounded regions is equivalent to first-Baire-class regularity of all limits of the extended computations on the corresponding completed regions. Every such limit is consequently the pointwise limit of a sequence of extended computations on each completed region. For countable families acting continuously on a compact metrizable state space, this is the tame regime of topological dynamics, whose hierarchy Glasner and Megrelishvili obtained from Todorčević's trichotomy. We transport that classification to computation structures and realize every level by a rotation, the power method, the planar and spatial Bresenham algorithms, and the action generated by Euclidean steps on the projective line. Newton's method for the square roots of unity on the Riemann sphere lies beyond the tame regime. Under the same extendibility assumption, a measure-theoretic counterpart for arbitrary feature families characterizes the absence of independence by featurewise universal measurability of the same limits. For every Radon input probability measure, each output feature is then uniformly approximable by polynomials in the input features outside a set of arbitrarily small probability.

math.LO↗

Forcing square with small conditions

We show that if $κ^{<κ} = κ$, then there is a $κ$-strategically closed, $κ^+$-c.c. partial order that forces $\square_κ$. We discuss consequences for generic large cardinals.

math.LO↗

Dependent choice and iterated beta_n-model reflection

In this paper, we consider conservation results for iterated $β_n$-model reflection principles. Using these principles, we characterize the $Π^1_{m+2}$-, $Σ^1_{m+2}$- and $\mathsf{B}(Π^1_{m+2})$-consequences of $Σ^1_{n+1}$-$\mathsf{DC}_0$ and $Σ^1_{n+1}$-$\mathsf{TDC}_0$ for $m \leq n$. Here, $\mathsf{B}(Π^1_{m+2})$ denotes the set of Boolean combinations of $Π^1_{m+2}$-formulas, and $\mathsf{TDC}$ stands for transfinite $\mathsf{DC}$. We also show that, in each case, the stronger theory has a super-exponential speed-up over the corresponding conservative subtheory.

math.LO↗