Search arXivSearch

arXiv · 1906.08683

Dynamical Uniform Bounds for Fibers and a Gap Conjecture

Abstract

We prove a uniform version of the Dynamical Mordell-Lang Conjecture for étale maps; also, we obtain a gap result for the growth rate of heights of points in an orbit along an arbitrary endomorphism of a quasiprojective variety defined over a number field. More precisely, for our first result, we assume $X$ is a quasi-projective variety defined over a field $K$ of characteristic $0$, endowed with the action of an étale endomorphism $Φ$, and $f\colon X\to Y$ is a morphism with $Y$ a quasi-projective variety defined over $K$. Then for any $x\in X(K)$, if for each $y\in Y(K)$, the set $S_y:=\{n\in \mathbb{N}\colon f(Φ^n(x))=y\}$ is finite, then there exists a positive integer $N$ such that $\#S_y\le N$ for each $y\in Y(K)$. For our second result, we let $K$ be a number field, $f:X\dashrightarrow \mathbb{P}^1$ is a rational map, and $Φ$ is an arbitrary endomorphism of $X$. If $\mathcal{O}_Φ(x)$ denotes the forward orbit of $x$ under the action of $Φ$, then either $f(\mathcal{O}_Φ(x))$ is finite, or $\limsup_{n\to\infty} h(f(Φ^n(x)))/\log(n)>0$, where $h(\cdot)$ represents the usual logarithmic Weil height for algebraic points.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jason Bell, Dragos Ghioca, Matthew Satriano. 2019-06-20. Dynamical Uniform Bounds for Fibers and a Gap Conjecture. https://arxiv.org/abs/1906.08683

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