English

Generalized Greatest Common Divisors for the Orbits under Rational Functions

Number Theory 2018-08-09 v2

Abstract

Assume Vojta's Conjecture. Suppose a,b,α,βZa, b, \alpha,\beta \in \mathbb{Z}, and f(x),g(x)Z[x]f(x),g(x) \in \mathbb{Z}[x] are polynomials of degree d2d \ge 2. Assume that the sequence (fn(a),gn(b))n(f^{\circ n}(a), g^{\circ n}(b))_n is generic and α,β\alpha,\beta are not exceptional for f,gf,g respectively, we prove that for each given ε>0\varepsilon > 0, there exists constant C=C(ε,a,b,α,β,f,g)>0C = C(\varepsilon,a,b,\alpha,\beta,f,g)>0, such that for all n1n \ge 1, we have gcd(fn(a)α,gn(b)β)Cexp(εdn).\gcd(f^{\circ n}(a)-\alpha, g^{\circ n}(b) -\beta) \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.

Keywords

Cite

@article{arxiv.1702.03881,
  title  = {Generalized Greatest Common Divisors for the Orbits under Rational Functions},
  author = {Keping Huang},
  journal= {arXiv preprint arXiv:1702.03881},
  year   = {2018}
}

Comments

18 pages

R2 v1 2026-06-22T18:17:08.192Z