Stability of certain higher degree polynomials
From MaRDI portal
Abstract: 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 for , . We show that for infinite families of , whenever is irreducible, all its iterates are irreducible, that is, is stable. For , we show that all the iterates of are irreducible. Also we show that for , if is reducible, then the number of irreducible factors of each iterate of is exactly for .
Recommendations
Cites work
- scientific article; zbMATH DE number 2186391 (Why is no real title available?)
- scientific article; zbMATH DE number 5171555 (Why is no real title available?)
- Baker's explicit abc-conjecture and applications
- Current trends and open problems in arithmetic dynamics
- Eventually stable quadratic polynomials over \(\mathbb{Q}\)
- Eventually stable rational functions
- Finite index theorems for iterated Galois groups of cubic polynomials
- Finite index theorems for iterated Galois groups of unicritical polynomials
- Generalized Fermat equations: a miscellany
- Integer points in backward orbits
- On the irreducibility of the iterates of \(x^{n}-b\)
- Primary cyclotomic units and a proof of Catalans conjecture
- Prime factors of dynamical sequences
- Primitive divisors in arithmetic dynamics
- Primitive prime divisors in the critical orbit of \(z^d+c\)
- The density of prime divisors in the arithmetic dynamics of quadratic polynomials
- The density of primes in orbits of \(z^d+c\)
- \(ABC\) implies primitive prime divisors in arithmetic dynamics
Cited in
(2)
This page was built for publication: Stability of certain higher degree polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6186052)