Translator Disclaimer
2022 Point counting and Wilkie’s conjecture for non-Archimedean Pfaffian and Noetherian functions
Gal Binyamini, Raf Cluckers, Dmitry Novikov
Author Affiliations +
Duke Math. J. Advance Publication 1-20 (2022). DOI: 10.1215/00127094-2022-0013


We consider the problem of counting polynomial curves on analytic or definable subsets over the field C((t)) as a function of the degree r. A result of this type could be expected by analogy with the classical Pila–Wilkie counting theorem in the Archimedean situation.

Some non-Archimedean analogues of this type have been developed in the work of Cluckers, Comte, and Loeser for the field Qp, but the situation in C((t)) appears to be significantly different. We prove that the set of polynomial curves of a fixed degree r on the transcendental part of a subanalytic set over C((t)) is automatically finite, but we give examples that show their number may grow arbitrarily quickly even for analytic sets. Thus no analogue of the Pila–Wilkie theorem can be expected to hold for general analytic sets. On the other hand, we show that if one restricts to varieties defined by Pfaffian or Noetherian functions, then the number grows at most polynomially in r, thus showing that the analogue of the Wilkie conjecture does hold in this context.


Download Citation

Gal Binyamini. Raf Cluckers. Dmitry Novikov. "Point counting and Wilkie’s conjecture for non-Archimedean Pfaffian and Noetherian functions." Duke Math. J. Advance Publication 1 - 20, 2022.


Received: 11 September 2020; Revised: 29 June 2021; Published: 2022
First available in Project Euclid: 10 May 2022

Digital Object Identifier: 10.1215/00127094-2022-0013

Primary: 11U09
Secondary: 03C98 , 11D88 , 11G50 , 14G05

Keywords: Noetherian functions , non-Archimedean geometry , Pfaffian functions , rational points of bounded height , Wilkie’s conjecture

Rights: Copyright © 2022 Duke University Press


This article is only available to subscribers.
It is not available for individual sale.

Advance Publication
Back to Top