Factorization of composed polynomials and applications
Abstract
Let Fq be the finite field with q elements, where q is a prime power and n be a positive integer. In this paper, we explore the factorization of f(xn) over Fq, where f(x) is an irreducible polynomial over Fq. Our main results provide generalizations of recent works on the factorization of binomials xn-1. As an application, we provide an explicit formula for the number of irreducible factors of f(xn) under some generic conditions on f and n.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.