Stable polynomials over finite fields
Let \(f\) be a polynomial of degree at least 2 with coefficients in a field \(\mathbb K\). We call \(f\in{\mathbb K}[X]\) \textit{stable} if all of its iterates \[ f^{(0)}(X)=X,\quad f^{(n)}(X)=f^{(n-1)}(f(X)),\quad n\geq 1 \] are irreducible over \(\mathbb K\). In the paper under review, the authors are concerned with the case of \({\mathbb K}\) being a finite field \({\mathbb F}_q\) with \(q\) elements, where \(q=p^s\) and \(p\) is an odd prime. The authors first give a summary on discriminants and resultants, and Weil's bound for character sums. Then, in Section 3, they give a \textit{necessary} condition for the stability of arbitrary polynomials over \({\mathbb F}_q\). This partially generalizes the quadratic polynomial case by \textit{R. Jones} and \textit{N. Boston} [Proc. Am. Math. Soc. 140, No. 6, 1849--1863 (2012; Zbl 1243.11115)]. In Section 4, they prove the non-existence of certain cubic polynomial for \(p=3\). In the last section, using Weil's bound for multiplicative character sums, the authors obtain an upper bound \(O(q^{d+1-1/{2\log(2d)}})\) for the number of stable polynomials of degree \(d\).
- An estimate on the number of stable quadratic polynomials
- On stable quadratic polynomials
- Irreducibility of the iterates of a quadratic polynomial over a field
- A note on the stability of trinomials over finite fields
- Eventually stable quadratic polynomials over \(\mathbb{Q}\)
- Stabilité des polynômes
- Dynamical irreducibility of polynomials modulo primes
- Proof of a conjecture of S. Chowla
- On the complexity of exact counting of dynamically irreducible polynomials
- Settled polynomials over finite fields
- Stable sets and polynomials
- The arithmetic of consecutive polynomial sequences over finite fields
- Dynamical irreducibility of polynomials modulo primes
- On irreducible divisors of iterated polynomials
- On the complexity of exact counting of dynamically irreducible polynomials
- A note on the stability of trinomials over finite fields
- Irreducible polynomials over finite fields produced by composition of quadratics
- On stable quadratic polynomials
- Settled polynomials over finite fields
- On some extensions of the Ailon-Rudnick theorem
- On the length of critical orbits of stable quadratic polynomials
- Eventually stable rational functions
- Distribution of polynomial discriminants modulo a prime
- Stabilité des polynômes
- An estimate on the number of stable quadratic polynomials
- Stability of certain higher degree polynomials
- On the stable polynomials of degrees 2, 3, 4
- Stable binomials over finite fields
- Dynamical irreducibility of certain families of polynomials over finite fields
- Square patterns in dynamical orbits
- On the stability of \(b^q (x+a)^{q+1}+x\) from the perspective of periodic sequences
This page was built for publication: Stable polynomials over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q742883)
