Irreducible polynomials with prescribed sums of coefficients
Abstract
Let q be a power of a prime, let Fq be the finite field with q elements and let n ≥ 2. For a polynomial h(x) ∈ Fq[x] of degree n ∈ N and a subset W ⊂eq [0,n] := \0, 1, …, n\, we define the sum-of-digits function SW(h) = Σw ∈ W[xw] h(x) to be the sum of all the coefficients of xw in h(x) with w ∈ W. In the case when q = 2, we prove, except for a few genuine exceptions, that for any c ∈ F2 and any W ⊂eq [0,n] there exists an irreducible polynomial P(x) of degree n over F2 such that SW(P) = c. In particular, restricting ourselves to the case when \# W = 1, we obtain a new proof of the Hansen-Mullen irreducibility conjecture (now a theorem) in the case when q = 2. In the case of q> 2, we prove that, for any c ∈ Fq, any n≥ 2 and any W ⊂eq [0,n], there exists an irreducible polynomial P(x) of degree n such that SW(P) ≠ c.
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.