Search arXivSearch

arXiv · 2510.12039

On the Number of Small Points for Rational Maps

Abstract

Let $K$ be a number field and $f: \mathbb{P}^1 \to \mathbb{P}^1$ a rational map of degree $d \geq 2$ with at most $s$ places of bad reduction, where we include all archimedean places. We prove that there exists constants $c_1,c_2 > 0$, depending only on $d$ and not on $f$ or $K$, such that $$ \# \left\{ x \in \mathbb{P}^1(K) \mid \widehat{h}_f(x) \leq \frac{c_1}{s} h_{\operatorname{rat}_d}(\langle f \rangle) \right\} \leq c_2 s \log(s). $$ Here, $\operatorname{rat}_d$ is the moduli space of rational maps up to conjugacy, $h_{\operatorname{rat}_d}$ is an ample height and $\langle f \rangle$ is the equivalence class associated to $f$. This gives a uniform version of a theorem of Baker as well as generalizing the results of Benedetto and Looper from polynomials to rational maps. The main tool used is the degeneration of sequences of rational maps by Luo which has been recently formalized by Favre-Gong via Berkovich spaces.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jit Wu Yap. 2025-10-14. On the Number of Small Points for Rational Maps. https://arxiv.org/abs/2510.12039

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