On the Recursive Behaviour of the Number of Irreducible Polynomials with Certain Properties over Finite Fields
Abstract
Let Fq be the field with q elements and of characteristic p. For a∈Fp consider the set equation* Sa(n)=\f∈Fq[x]deg(f)=n,~f irreducible, monic and Tr(f)=a\. equation* In a recent paper, Robert Granger proved for q=2 and n 2 that |S1(n)|-|S0(n)|= 0 if 2 n and |S1(n)|-|S0(n)|=|S1(n/2)| if 2 n. We will prove a generalization of this result for all finite fields. This is possible due to an observation about the size of certain subsets of monic irreducible polynomials arising in the context of a group action of subgroups of PGL2(Fq) on monic polynomials. Additionally, it enables us to apply these methods to prove two further results that are very similar in nature.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.