HackerPapers

arXiv:1702.03881math.NT

Generalized Greatest Common Divisors for the Orbits under Rational Functions

Keping Huang

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

Abstract

Assume Vojta's Conjecture. Suppose $a, b, α,β\in \mathbb{Z}$, and $f(x),g(x) \in \mathbb{Z}[x]$ are polynomials of degree $d \ge 2$. Assume that the sequence $(f^{\circ n}(a), g^{\circ n}(b))_n$ is generic and $α,β$ are not exceptional for $f,g$ respectively, we prove that for each given $\varepsilon > 0$, there exists constant $C = C(\varepsilon,a,b,α,β,f,g)>0$, such that for all $n \ge 1$, we have $$\gcd(f^{\circ n}(a)-α, g^{\circ n}(b) -β) \le C\cdot\exp({\varepsilon\cdot d^n}). $$ We prove an estimate for rational functions and for a more general gcd and then obtain the above inequality as a consequence.

arXiv comments
18 pages
Journal reference
DOI
Subjects
math.NTNumber Theory

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Aug 2018 to Aug 2018. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.