Search arXivSearch

arXiv · 2605.25164

Simultaneous Periods for Families of Rational Maps Modulo Primes

Abstract

Let $K$ be a number field, and $φ_{1},\ldots,φ_{g}\in K(t)$ be finitely many rational maps, each of degree at least $2$. We first show that for generic finite sets $\mathcal{A}_{1},\ldots,\mathcal{A}_{g}$ consisting entirely of points that are not $φ_{i}$-periodic, there exists a set of primes $\mathfrak p$ of $K$ of positive density such that for each $\mathcal{A}_{i}$ and every $α\in\mathcal{A}_i$, $α$ is not $φ_i$-periodic modulo $\mathfrak p$. The notion of genericity used here is defined in terms of the associated arboreal fields and is sharper than those previously used in the literature. Leveraging our proof in the generic case, we then show that the same conclusion holds for most \textit{expected} cases of non-generic sets $\mathcal{A}_{i}$. Finally, we apply our result to confirm the dynamical Mordell--Lang conjecture for coordinate-wise actions of a class of maps that includes rational maps that are generic in this sense.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bhawesh Mishra. 2026-05-24. Simultaneous Periods for Families of Rational Maps Modulo Primes. https://doi.org/10.1016/j.jnt.2026.05.016

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