A polynomial f(x) over a field K is said to be stable if all its iterates are irreducible over K. L. Danielson and B. Fein have shown that over a large class of fields K, if f(x) is an irreducible monic binomial, then it is stable over K. In this paper it is proved that this result no longer holds over finite fields. Necessary and sufficient conditions are provided under which a given binomial is stable over F_q. The paper ends with a brief link to Mersenne primes.
No takes yet. Share an insight, caveat, or question.
Ayad et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: