Search arXivSearch

arXiv · 1311.5617

T-modules and Pila-Wilkie estimates

Abstract

The $T-$modules, introduced by G. Anderson in the '80s, are the natural analogue of abelian varieties in Function Field Arithmetic in positive characteristic. For a special class of them we highlight that a totally similar description of the classic Weierstrass function still holds. In particular, torsion points correspond modulo a finite-rank lattice to rational points of the tangent space. We present in this work an upper bound estimate of the number of rational points of the trascendent part of the analytic set corresponding, into the tangent space, to a nontrivial algebraic subvariety of a $T-$module of this special class. Such an estimate, which takes the same shape of that proved by J. Pila and J. Wilkie, represents our first step of our strategy to prove Manin-Mumford conjecture for such special $T-$modules, based on the ideas developped by U. Zannier and J. Pila.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Luca Demangos. 2015-01-22. T-modules and Pila-Wilkie estimates. https://doi.org/10.1016/j.jnt.2015.02.014

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

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT