On the enumeration of polynomials with prescribed factorization pattern
Abstract
We use generating functions over group rings to count polynomials over finite fields with the first few coefficients prescribed and a factorization pattern prescribed. In particular, we obtain different exact formulas for the number of monic n-smooth polynomial of degree m over a finite field, as well as the number of monic n-smooth polynomial of degree m with the prescribed trace coefficient.
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.