Stability of binomials over finite fields

arXiv2212.10518MaRDI QIDQ6421144FDOQ6421144

Authors: Mohamed Ayad, Boualem Benseba, Mohamed T. Madi 

Publication date: 20 December 2022

Abstract: 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 given in order that a given binomial is stable over $mathbb{F}_q$. These conditions are used to construct a table listing the stable binomials over $mathbb{F}_q$ of the form $f(x)=x^d-a$, $ainmathbb{F}_{q}setminus0,1$, for $qleq27$ and $dleq10$. The paper ends with a brief link with Mersenne primes.

This page was built for publication: Stability of binomials over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6421144)