Number of irreducible polynomials whose compositions with monic monomials have large irreducible factors

Abstract: Given a prime power

q

and positive integers

m, t, e

with

e > m t / 2

, we determine the number of all monic irreducible polynomials

f (x)

of degree

m

with coefficients in

m a t h b b F_{q}

such that

f (x^{t})

contains an irreducible factor of degree

e

. Polynomials with these properties are important for justifying randomised algorithms for computing with matrix groups.

This page was built for publication: Number of irreducible polynomials whose compositions with monic monomials have large irreducible factors