Abstract
In this paper we consider squarefree polynomials over finite fields whose gcd with their reciprocal and Frobenius conjugate polynomial is trivial, respectively. Our focus is on the enumeration of these special sets of polynomials, in particular, we give the number of squarefree palindromes. These investigations make it possible to estimate the efficiency of the prefactorization of polynomials over finite fields based on such gcd calculations.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call