English
Related papers

Related papers: Point counting and Wilkie's conjecture for non-arc…

200 papers

We establish a rigid-analytic analog of the Pila-Wilkie counting theorem, giving sub-polynomial upper bounds for the number of rational points in the transcendental part of a $\mathbb{Q}_p$-analytic set, and the number of rational functions…

Number Theory · Mathematics 2025-06-18 Gal Binyamini , Fumiharu Kato

We prove an effective form of Wilkie's conjecture in the structure generated by restricted sub-Pfaffian functions: the number of rational points of height $H$ lying in the transcendental part of such a set grows no faster than some power of…

Logic · Mathematics 2022-02-14 Gal Binyamini , Dmitry Novikov , Benny Zack

We prove an analogue of the Yomdin-Gromov Lemma for $p$-adic definable sets and more broadly in a non-archimedean, definable context. This analogue keeps track of piecewise approximation by Taylor polynomials, a nontrivial aspect in the…

Algebraic Geometry · Mathematics 2015-10-07 R. Cluckers , G. Comte , F. Loeser

We prove an effective version of the Pila-Wilkie Theorem for sets definable using Pfaffian functions, providing effective estimates for the number of algebraic points of bounded height and degree lying on such sets. We also prove effective…

Number Theory · Mathematics 2023-01-25 Gal Binyamini , Gareth O. Jones , Harry Schmidt , Margaret E. M. Thomas

Let X be a set definable in a sharply o-minimal structure. We consider the problem of counting the number of points where X intersects algebraic varieties V over Q of dimension k < codim X, as a function of T := deg(V) + h(V), where h(V) is…

Number Theory · Mathematics 2026-04-17 Gal Binyamini , Noriko Hirata-Kohno , Makoto Kawashima , Yuval Salant

We prove that any finite-degree polynomial functor is topologically Noetherian. This theorem is motivated by the recent resolution of Stillman's conjecture and a recent Noetherianity proof for the space of cubics. Via work by…

Commutative Algebra · Mathematics 2019-05-09 Jan Draisma

We prove upper bounds on the number of rational points on transcendental curves in arbitrary $1$-h-minimal fields, similar to the Pila--Wilkie counting theorem in the o-minimal setting. These results extend results due to…

Number Theory · Mathematics 2025-07-08 Floris Vermeulen

In this article we prove several new uniform upper bounds on the number of points of bounded height on varieties over $\mathbb{F}_q[t]$. For projective curves, we prove the analogue of Walsh' result with polynomial dependence on $q$ and the…

Number Theory · Mathematics 2020-03-27 Floris Vermeulen

We consider an algebraic variety and its foliation, both defined over a number field. We prove upper bounds for the geometric complexity of the intersection between a leaf of the foliation and a subvariety of complementary dimension (also…

Algebraic Geometry · Mathematics 2023-06-22 Gal Binyamini

We consider the structure ${\mathbb R}^{\mathrm{RE}}$ obtained from $({\mathbb R},<,+,\cdot)$ by adjoining the restricted exponential and sine functions. We prove Wilkie's conjecture for sets definable in this structure: the number of…

Logic · Mathematics 2016-05-17 Gal Binyamini , Dmitry Novikov

Let $\Omega\subset{\mathbb R}^n$ be a relatively compact domain. A finite collection of real-valued functions on $\Omega$ is called a \emph{Noetherian chain} if the partial derivatives of each function are expressible as polynomials in the…

Number Theory · Mathematics 2017-04-04 Gal Binyamini

We discuss, in a non-Archimedean setting, the distribution of the coefficients of $L$-polynomials of curves of genus $g$ over $\mathbb{F}_q$. Among other results, this allows us to prove that the $\mathbb{Q}$-vector space spanned by such…

Number Theory · Mathematics 2025-07-25 Francesco Ballini , Davide Lombardo , Matteo Verzobio

We provide the existence of new degree growths in the context of polynomial automorphisms of $\mathbb{C}^k$: if $k$ is an integer $\geq 3$, then for any $\ell\leq \left[\frac{k-1}{2}\right]$ there exist polynomial automorphisms $f$ of…

Dynamical Systems · Mathematics 2018-05-23 Julie Déserti

We prove a special case of a dynamical analogue of the classical Mordell-Lang conjecture. In particular, let $\phi$ be a rational function with no superattracting periodic points other than exceptional points. If the coefficients of $\phi$…

Number Theory · Mathematics 2009-02-06 Robert L. Benedetto , Dragos Ghioca , Par Kurlberg , Thomas J. Tucker

Let $F$ be a number field. Given a quadratic polynomial $f_c(z) = z^2 + c \in F[z]$, we can construct a directed graph $Preper(f_c, F)$ (also called a portrait), whose vertices are $F$-rational preperiodic points for $f_c$, with an edge…

Number Theory · Mathematics 2024-10-08 Ho Chung Siu

We prove an analogue of the classical Bateman-Horn conjecture on prime values of polynomials for the ring of polynomials over a large finite field. Namely, given non-associate, irreducible, separable and monic (in the variable $x$)…

Number Theory · Mathematics 2019-02-20 Alexei Entin

Fix a hyperelliptic curve $C/\mathbb{Q}$ of genus $g$, and consider the number fields $K/\mathbb{Q}$ generated by the algebraic points of $C$. In this paper, we study the number of such extensions with fixed degree $n$ and discriminant…

Number Theory · Mathematics 2025-09-17 Christopher Keyes

We consider the issue of when the L-polynomial of one curve over $\F_q$ divides the L-polynomial of another curve. We prove a theorem which shows that divisibility follows from a hypothesis that two curves have the same number of points…

Number Theory · Mathematics 2014-10-01 Omran Ahmadi , Gary McGuire , Antonio Rojas-León

Let $f$ be a plane curve. We give a procedure based on Abhyankar's approximate roots to detect if it has a single place at infinity, and if so construct its associated $\delta$-sequence, and consequently its value semigroup. Also for fixed…

Algebraic Geometry · Mathematics 2014-12-17 Abdallah Assi , Pedro A. García-Sánchez

This article concerns the computational complexity of a fundamental problem in number theory: counting points on curves and surfaces over finite fields. There is no subexponential-time algorithm known and it is unclear if it can be…

Computational Complexity · Computer Science 2025-11-05 Diptajit Roy , Nitin Saxena , Madhavan Venkatesh
‹ Prev 1 2 3 10 Next ›