Eventually stable polynomial

A non-constant polynomial with coefficients in a field is said to be eventually stable if the number of irreducible factors of the -fold iteration of the polynomial is eventually constant as a function of . The terminology is due to R. Jones and A. Levy,[1] who generalized the seminal notion of stability first introduced by R. Odoni.[2]

Definition

edit

Let   be a field and   be a non-constant polynomial. The polynomial   is called stable or dynamically irreducible if, for every natural number  , the  -fold composition   is irreducible over  .

A non-constant polynomial   is called  -stable if, for every natural number  , the composition   is irreducible over  .

The polynomial   is called eventually stable if there exists a natural number   such that   is a product of  -stable factors. Equivalently,   is eventually stable if there exist natural numbers   such that for every   the polynomial   decomposes in   as a product of   irreducible factors.

Examples

edit
  • If   is such that   and   are all non-squares in   for every  , then   is stable. If   is a finite field, the two conditions are equivalent.[3]
  • Let   where   is a field of characteristic not dividing  . If there exists a discrete non-archimedean absolute value on   such that  , then   is eventually stable. In particular, if   and   is not the reciprocal of an integer, then   is eventually stable.[4]

Generalization to rational functions and arbitrary basepoints

edit

Let   be a field and   be a rational function of degree at least  . Let  . For every natural number  , let   for coprime  .

We say that the pair   is eventually stable if there exist natural numbers   such that for every   the polynomial   decomposes in   as a prodcut of   irreducible factors. If, in particular,  , we say that the pair   is stable.

R. Jones and A. Levy proposed the following conjecture in 2017.[1]

Conjecture: Let   be a field and   be a rational function of degree at least  . Let   be a point that is not periodic[disambiguation needed] for  .
  1. If   is a number field, then the pair   is eventually stable.
  2. If   is a function field and   is not isotrivial, then   is eventually stable.

Several cases of the above conjecture have been proved by Jones and Levy,[1] Hamblen et al.[4], and DeMark et al.[5]

References

edit
  1. ^ a b c Jones, Rafe; Levy, Alon (2017). "Eventually stable rational functions". International Journal of Number Theory. 13 (9): 2299–2318. arXiv:1603.00673. doi:10.1142/S1793042117501263.
  2. ^ Odoni, R.W.K. (1985). "The Galois theory of iterates and composites of polynomials". Proceedings of the London Mathematical Society. 51 (3): 385–414. doi:10.1112/plms/s3-51.3.385.
  3. ^ Jones, Rafe (2012). "An iterative construction of irreducible polynomials reducible modulo every prime". Journal of Algebra. 369: 114–128. doi:10.1016/j.jalgebra.2012.05.020.
  4. ^ a b Hamblen, Spencer; Jones, Rafe; Madhu, Kalyani (2015). "The density of primes in orbits of  ". IMRN International Mathematics Research Notices (7): 1924–1958.
  5. ^ DeMark, David; Hindes, Wade; Jones, Rafe; Misplon, Moses; Stoll, Michael; Stoneman, Michael (2020). "Eventually stable quadratic polynomials over  ". New York Journal of Mathematics. 26: 526–561.