On stable quadratic polynomials
Let \(K\) be a field. A polynomial \(f\in K[X]\) is called stable if all its iterates \(f^{(1)}=f, f^{(2)}=f(f),\dots, f^{(n)},\dots\) are irreducible over \(K\). The main result of the paper states that almost all irreducible quadratic polynomials in \(\mathbb Z[X]\) are stable (Theorem 1), but there are no stable quadratic polynomials over a finite field of characteristic \(2\) (Corollary 11). In the case of finite fields \(\mathbb F_q\) of odd characteristic it is shown (Theorem 8) that if \(F(X)=g(aX^2+bX+c)\) is stable and \(\deg g=d\), then the orbit of \(-b/2a\) under \(F\) has \(O(q^{1-\alpha_d})\) elements with \(\alpha_d=\log 2/2\log(4d)\).NEWLINENEWLINEIt was shown by \textit{R. Jones} and \textit{N. Boston} [Proc. Am. Math. Soc., 140, No. 6, 1849--1863 (2012; Zbl 1243.11115)] that if \(f(X)=aX^2+bX+c\) (with \(a\neq 0\)), \(\gamma=-b/2a\) and the sequence \(-f(\gamma),f^{(2)}(\gamma),\dots,f^{(n)}(\gamma),\dots\) contains no squares, then \(f\) is stable. The authors present (Theorem 5) an effective algorithm based on Baker's method to test whether the assumption of this assertion is satisfied.
- Stable polynomials over finite fields
- Irreducibility of the iterates of a quadratic polynomial over a field
- An estimate on the number of stable quadratic polynomials
- Settled polynomials over finite fields
- Dynamical irreducibility of polynomials modulo primes
- Eventually stable quadratic polynomials over \(\mathbb{Q}\)
- Irreducibility of iterates of post-critically finite quadratic polynomials over \(\mathbb{Q}\)
- On the complexity of exact counting of dynamically irreducible polynomials
- Irreducible polynomials over finite fields produced by composition of quadratics
- On the length of critical orbits of stable quadratic polynomials
- Algebraic Function Fields and Codes
- An estimate on the number of stable quadratic polynomials
- scientific article; zbMATH DE number 3657869 (Why is no real title available?)
- scientific article; zbMATH DE number 1038336 (Why is no real title available?)
- Iterated Galois towers, their associated martingales, and the p-adic Mandelbrot set
- On S-integral solutions of the equation y^ m=f(x)
- On the length of critical orbits of stable quadratic polynomials
- Stabilité des polynômes
- The density of prime divisors in the arithmetic dynamics of quadratic polynomials
- The Galois Theory of Iterates and Composites of Polynomials
- Families of stable quasipolynomials
- An iterative construction of irreducible polynomials reducible modulo every prime
- On stable and fixed polynomials
- Eventually stable quadratic polynomials over \(\mathbb{Q}\)
- On the complexity of exact counting of dynamically irreducible polynomials
- A note on the stability of trinomials over finite fields
- A refined conjecture for factorizations of iterates of quadratic polynomials over finite fields
- Settled polynomials over finite fields
- On the length of critical orbits of stable quadratic polynomials
- Eventually stable rational functions
- Newly reducible polynomial iterates
- On sets of irreducible polynomials closed by composition
- An estimate on the number of stable quadratic polynomials
- A new direction on constructing irreducible polynomials over finite fields
- On the stable polynomials of degrees 2, 3, 4
- Stable binomials over finite fields
- Eventual stability of pure polynomials over the rational field
- The inverse stability of Artin-Schreier polynomials over finite fields
- Iterating additive polynomials over finite fields
- Dynamical irreducibility of certain families of polynomials over finite fields
- On the stability of \(b^q (x+a)^{q+1}+x\) from the perspective of periodic sequences
- Stable polynomials over finite fields
This page was built for publication: On stable quadratic polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2882500)
