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 , and are polynomials of degree . Assume that the sequence is generic and are not exceptional for respectively, we prove that for each given $\varepsilon > 0$, there exists constant $C = C(\varepsilon,a,b,\alpha,\beta,f,g)>0$, such that for all , we have We prove an estimate for rational functions and for a more general gcd and then obtain the above inequality as a consequence.
Paper Prompts
Sign up for free to create and run prompts on this paper.