Counting Theorems for Algebraic Relations
Pith reviewed 2026-05-10 09:45 UTC · model grok-4.3
The pith
For trajectories of polynomial differential equations satisfying a Nesterenko-type condition, intersections with algebraic varieties of dimension k below sqrt(n) minus one lie in polynomially many exponentially small balls.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
Let X be a compact piece of a trajectory of a polynomial differential equation in C^n that satisfies a variant of Nesterenko's D-property. Then, for every algebraic variety V defined over Q of dimension k less than sqrt(n) minus one, the intersection X intersect V is contained in a collection of polynomially many balls of radius e^{-T}, where T equals the degree plus the logarithmic height of V.
What carries the argument
The weakened covering conjecture stating that intersections are contained in polynomially many balls of radius exponential in minus T, established for differential-equation trajectories under the explicit dimension restriction k less than sqrt(n) minus one.
If this is right
- The full polynomial-growth conjecture implies solutions to selected open problems in algebraic independence theory.
- For the indicated differential-equation trajectories the intersections are covered by polynomially many balls of radius e^{-T}.
- The covering holds precisely when the dimension k obeys k less than sqrt(n) minus one.
- The result supplies a concrete case of the generalized Wilkie conjecture in the setting of trajectories of polynomial differential equations.
Where Pith is reading between the lines
- Improving the dimension threshold beyond sqrt(n) minus one would immediately enlarge the range of varieties for which the covering applies.
- The same covering technique might adapt to other classes of sets definable in o-minimal structures that are not necessarily differential-equation trajectories.
- Effective bounds obtained this way could be inserted into existing transcendence proofs that rely on counting algebraic relations.
Load-bearing premise
X must be a compact trajectory segment of a polynomial differential equation obeying a variant of Nesterenko's D-property, together with the restriction that the variety dimension k satisfies k less than sqrt(n) minus one.
What would settle it
Exhibit a single polynomial differential equation in some dimension n and a value k less than sqrt(n) minus one together with a sequence of rational varieties V_i of increasing T such that the intersections of the trajectory with the V_i cannot be covered by any fixed polynomial number of balls of radius e^{-T}.
read the original abstract
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 the log-height of V. In particular, we conjecture that after removing a suitable "algebraic part", this number grows polynomially in T -- a generalization of Wilkie's conjecture. We show that this full conjecture implies some open problems in algebraic independence theory. We also formulate a weaker conjecture stating that all intersections above are contained in a poly(T) amount of balls of radius e^{-T}. We then consider the case where X (subset of C^n) is a (compact piece of a) trajectory of a polynomial differential equation satisfying a variant of Nesterenko's D-property. Our main theorem is a proof of the weakened conjecture for such curves when k < sqrt(n) - 1.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript studies the problem of counting intersections of a definable set X in a sharply o-minimal structure with algebraic varieties V over Q of dimension k less than the codimension of X, measured in terms of T = deg(V) + h(V). It formulates a conjecture that, after removing a suitable algebraic part, the number of such intersections grows at most polynomially in T (a generalization of Wilkie's conjecture), and shows that the full conjecture would imply certain open problems in algebraic independence theory. A weaker conjecture is stated, asserting that all intersections lie in a polynomial number of balls of radius e^{-T}. The main theorem establishes this weakened conjecture when X is a compact piece of a trajectory of a polynomial differential equation satisfying a variant of Nesterenko's D-property, under the restriction k < sqrt(n) - 1.
Significance. If the main theorem holds, the work supplies a non-trivial instance of a Wilkie-type counting result for a geometrically natural class of sets arising from differential equations. The combination of sharply o-minimal cell decomposition with differential-equation transcendence estimates yields an explicit dimension threshold k < sqrt(n) - 1 that is derived directly from the Diophantine bounds; this is a concrete, falsifiable advance. The observation that the full conjecture implies open algebraic-independence statements also clarifies the logical strength of the conjecture.
minor comments (2)
- Abstract: the statement of the main theorem would be clearer if it briefly indicated the two main ingredients (sharply o-minimal cell decomposition and the variant of Nesterenko's D-property) rather than only naming the setting and the dimension restriction.
- The definition and precise statement of the 'variant of Nesterenko's D-property' should be given in a dedicated subsection early in the paper, with an explicit comparison to the classical D-property, so that the dependence of the dimension bound on this hypothesis is transparent.
Simulated Author's Rebuttal
We thank the referee for the careful reading, accurate summary of our results, and positive recommendation for minor revision. We appreciate the recognition that the explicit dimension threshold k < sqrt(n)-1 arises directly from the Diophantine bounds and that the full conjecture's implications for algebraic independence are clarified.
Circularity Check
No significant circularity in the derivation chain
full rationale
The paper states a main theorem proving the weakened conjecture (intersections contained in poly(T) balls of radius e^{-T}) for compact pieces of trajectories of polynomial differential equations satisfying a variant of Nesterenko's D-property, under the explicit hypothesis k < sqrt(n)-1. The argument is described as combining sharply o-minimal cell decomposition with differential-equation transcendence estimates to bound intersections after removing algebraic parts. Both the D-property variant and dimension restriction are stated as hypotheses supplying control on algebraic independence measures and Diophantine estimates, rather than being derived from or equivalent to the result itself. No equations, predictions, or self-citations are shown reducing the central claim to fitted inputs, self-definitions, or unverified prior results by construction; the theorem is presented as independent content for the restricted class.
Axiom & Free-Parameter Ledger
axioms (2)
- domain assumption X is definable in a sharply o-minimal structure
- domain assumption X satisfies a variant of Nesterenko's D-property
Reference graph
Works this paper leans on
-
[1]
Gal Binyamini. Zero counting and invariant sets of differential equations.In- ternational Mathematics Research Notices, page rnx199, 2017
work page 2017
-
[2]
GalBinyamini, DmitriNovikov, andBennyZack. Sharplyo-minimalstructures and sharp cellular decomposition.Preprint, arXiv:1407.1183, September 2022
-
[3]
Wilkie’s conjecture for pfaf- fian structures.Annals of Mathematics, 199(2):795 – 821, 2024
Gal Binyamini, Dmitry Novikov, and Benny Zak. Wilkie’s conjecture for pfaf- fian structures.Annals of Mathematics, 199(2):795 – 821, 2024
work page 2024
-
[4]
Sharp zero estimates for trajectories of poly- nomial vector fields.In preparation, 2026
Gal Binyamini and Yuval Salant. Sharp zero estimates for trajectories of poly- nomial vector fields.In preparation, 2026
work page 2026
-
[5]
Zeroes and rational points of analytic functions.Ann
Georges Comte and Yosef Yomdin. Zeroes and rational points of analytic functions.Ann. Inst. Fourier (Grenoble), 68(6):2445–2476, 2018
work page 2018
-
[6]
Yulii Il’yashenko and Sergei Yakovenko. Counting real zeros of analytic func- tions satisfying linear ordinary differential equations.Journal of Differential Equations, 126:87–105, 1996
work page 1996
-
[7]
A. G. Khovanski˘ ı.Fewnomials, volume 88 ofTranslations of Mathematical Monographs. American Mathematical Society, Providence, RI, 1991. Trans- lated from the Russian by Smilka Zdravkovska
work page 1991
-
[8]
Addison-Wesley Publish- ing Co., Reading, Mass.-London-Don Mills, Ont., 1966
Serge Lang.Introduction to transcendental numbers. Addison-Wesley Publish- ing Co., Reading, Mass.-London-Don Mills, Ont., 1966
work page 1966
-
[9]
Yu. V. Nesterenko. Estimates for the number of zeros of certain functions. InNew advances in transcendence theory (Durham, 1986), pages 263–269. Cambridge Univ. Press, Cambridge, 1988
work page 1986
-
[10]
Yuri V. Nesterenko. Estimates for the characteristic function of a prime ideal. Mathematics of the USSR-Sbornik, 51(1):9–32, 1985
work page 1985
-
[11]
Yuri V. Nesterenko. Modular functions and transcendence questions.Sbornik: Mathematics, 187(9):1319–1348, 1996
work page 1996
-
[12]
Nesterenko and Patrice Philippon.Introduction to Algebraic Indepen- dence Theory
Yuri V. Nesterenko and Patrice Philippon.Introduction to Algebraic Indepen- dence Theory. Springer, 1st edition, 2001
work page 2001
-
[13]
D. Novikov and S. Yakovenko. Trajectories of polynomial vector fields and as- cending chains of polynomial ideals.Ann. Inst. Fourier (Grenoble), 49(2):563– 609, 1999
work page 1999
-
[14]
J. Pila and A. J. Wilkie. The rational points of a definable set.Duke Math. J., 133(3):591–616, 2006
work page 2006
-
[15]
On the algebraic points of a definable set.Selecta Math
Jonathan Pila. On the algebraic points of a definable set.Selecta Math. (N.S.), 15(1):151–170, 2009
work page 2009
-
[16]
Cambridge University Press, Cambridge, 2022
Jonathan Pila.Point-counting and the Zilber-Pink conjecture, volume 228 of Cambridge Tracts in Mathematics. Cambridge University Press, Cambridge, 2022. 26 G. BINYAMINI, N. HIRATA-KOHNO, M. KA W ASHIMA, AND Y. SALANT Weizmann Institute of Science, Rehovot, Israel Email address:gal.binyamini@weizmann.ac.il Nihon University, College of Science and Technolog...
work page 2022
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.