Search arXivSearch

arXiv · 2511.08506

Holomorphic maps sharing preimages over finitely generated fields

Abstract

Let $ R$ be a compact Riemann surface, and let $ P: R \to \mathbb P^1(\mathbb C) $ and $ Q: R \to \mathbb P^1(\mathbb C) $ be holomorphic maps. In this paper, we investigate the following problem: under what conditions do the preimages $ P^{-1}(K) $ and $ Q^{-1}(K) $ coincide for some infinite set $K$ contained in $\mathbb P^1(k)$, where $k$ is a finitely generated subfield of $\mathbb C$ (e.g., a number field)? Equivalently, we study holomorphic correspondences that admit an infinite completely invariant set contained in $\mathbb P^1(k)$. We show that if such a set exists, then there is a holomorphic Galois covering $Θ: R_0 \to \mathbb P^1(\mathbb C)$, where $R_0$ has genus zero or one, such that $ P $ and $ Q $ are ``compositional left factors" of $ Θ.$ We also consider a more general equation $ P^{-1}(K_1) = Q^{-1}(K_2),$ where $K_1$ and $K_2$ are infinite subsets of $\mathbb P^1(k)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Fedor Pakovich. 2025-11-11. Holomorphic maps sharing preimages over finitely generated fields. https://arxiv.org/abs/2511.08506

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