Eventually stable rational functions

@article{Jones2016EventuallySR,
  title={Eventually stable rational functions},
  author={Rafe Jones and Alon Y. Levy},
  journal={arXiv: Number Theory},
  year={2016}
}
For a field K, rational function phi in K(z) of degree at least two, and alpha in P^1(K), we study the polynomials in K[z] whose roots are given by the solutions to phi^n(z) = alpha, where phi^n denotes the nth iterate of phi. When the number of irreducible factors of these polynomials stabilizes as n grows, the pair (phi, alpha) is called eventually stable over K. We conjecture that (phi, alpha) is eventually stable over K when K is any global field and alpha any point not periodic under phi… 

Cyclotomic and abelian points in backward orbits of rational functions

We prove several results on backward orbits of rational functions over number fields. First, we show that if K is a number field, φ ∈ K(x) and α ∈ K then the extension of K generated by the abelian

EVENTUALLY STABLE QUADRATIC POLYNOMIALS OVER Q

We study the number of irreducible factors (over Q) of the nth iterate of a polynomial of the form fr(x) = x 2 + r for r ∈ Q. When the number of such factors is bounded independent of n, we call

Integral points in orbits in characteristic $p$

We prove a characteristic p version of a theorem of Silverman on integral points in orbits over number fields and establish a primitive prime divisor theorem for polynomials in this setting. In

The size of arboreal images, I: exponential lower bounds for PCF and unicritical polynomials

Let f be a polynomial over a global field K. For each α in K and N in Z≥0 denote by KN(f, α) the arboreal field K(f (α)) and by DN (f, α) its degree over K. It is conjectured that DN (f, α) should

N T ] 3 0 A pr 2 02 0 EVENTUALLY STABLE QUADRATIC POLYNOMIALS OVER Q

We study the number of irreducible factors (over Q) of the nth iterate of a polynomial of the form fr(x) = x 2 + r for r ∈ Q. When the number of such factors is bounded independent of n, we call

Stability of Certain Higher Degree Polynomials

One of the interesting problems in arithmetic dynamics is to study the stability of polynomials over a field. In this paper, we study the stability of f(z) = z + 1 c for d ≥ 2, c ∈ Z \ {0}. We show

Galois representations from pre-image trees: an arboreal survey

Given a global field K and a rational function phi defined over K, one may take pre-images of 0 under successive iterates of phi, and thus obtain an infinite rooted tree T by assigning edges

Rational values of transcendental functions and arithmetic dynamics

We count algebraic points of bounded height and degree on the graphs of certain functions analytic on the unit disk, obtaining a bound which is polynomial in the degree and in the logarithm of the

Arboreal Representations for Rational Maps with Few Critical Points

Jones conjectures the arboreal representation of a degree two rational map will have finite index in the full automorphism group of a binary rooted tree except under certain conditions. We prove a

Eventually stable quadratic polynomials over $\mathbb{Q}$

We study the number of irreducible factors (over $\mathbb{Q}$) of the $n$th iterate of a polynomial of the form $f_r(x) = x^2 + r$ for rational $r$. When the number of such factors is bounded

References

SHOWING 1-10 OF 30 REFERENCES

Galois theory of quadratic rational functions

For a number field K with absolute Galois group G_K, we consider the action of G_K on the infinite tree of preimages of a point in K under a degree-two rational function phi, with particular

ABC implies primitive prime divisors in arithmetic dynamics

Let K be a number field, let φ(x)∈K(x) be a rational function of degree d>1, and let α∈K be a wandering point such that φn(α)≠0 for all n>0. We prove that if the abc‐conjecture holds for K, then for

Integer Points in Backward Orbits

ON STABLE QUADRATIC POLYNOMIALS

Abstract We recall that a polynomial f(X) ∈ K[X] over a field K is called stable if all its iterates are irreducible over K. We show that almost all monic quadratic polynomials f(X) ∈ ℤ[X] are stable

The density of prime divisors in the arithmetic dynamics of quadratic polynomials

Let f ∈ ℤ[x], and consider the recurrence given by an = f(an − 1), with a0 ∈ ℤ. Denote by P(f, a0) the set of prime divisors of this recurrence, that is, the set of primes dividing at least one

Settled polynomials over finite fields

We study the factorization into irreducibles of iterates of a qua- dratic polynomial f over a nite eld. We call f settled when the factorization of its nth iterate for large n is dominated by

Galois theory of iterated endomorphisms

Given an abelian algebraic group A over a global field F, α ∈ A(F), and a prime ℓ, the set of all preimages of α under some iterate of [ℓ] generates an extension of F that contains all ℓ‐power

Galois representations from pre-image trees: an arboreal survey

Given a global field K and a rational function phi defined over K, one may take pre-images of 0 under successive iterates of phi, and thus obtain an infinite rooted tree T by assigning edges

Exceptional Covers and Bijections on Rational Points

We show that if f : X −→ Y is a finite, separable morphism of smooth curves defined over a finite field Fq, where q is larger than an explicit constant depending only on the degree of f and the genus