Papers
Topics
Authors
Recent
Search
2000 character limit reached

Generalized Greatest Common Divisors for the Orbits under Rational Functions

Published 13 Feb 2017 in math.NT | (1702.03881v2)

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 (f<sup></sup>n(a),g<sup></sup>n(b))n(f<sup>{\circ</sup> n}(a), g<sup>{\circ</sup> n}(b))_n is generic and α,β\alpha,\beta are not exceptional for f,gf,g respectively, we prove that for each given $\varepsilon &gt; 0$, there exists constant $C = C(\varepsilon,a,b,\alpha,\beta,f,g)&gt;0$, such that for all n1n \ge 1, we have gcd(f<sup></sup>n(a)α,g<sup></sup>n(b)β)Cexp(εd<sup>n).</sup>\gcd(f<sup>{\circ</sup> n}(a)-\alpha, g<sup>{\circ</sup> n}(b) -\beta) \le C\cdot\exp({\varepsilon\cdot d<sup>n}).</sup> We prove an estimate for rational functions and for a more general gcd and then obtain the above inequality as a consequence.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.