Papers
Topics
Authors
Recent
Search
2000 character limit reached

Irreducible polynomials with prescribed sums of coefficients

Published 2 May 2016 in math.NT | (1605.00351v1)

Abstract: Let $q$ be a power of a prime, let $\mathbb{F}q$ be the finite field with $q$ elements and let $n \geq 2$. For a polynomial $h(x) \in \mathbb{F}_q[x]$ of degree $n \in \mathbb{N}$ and a subset $W \subseteq [0,n] := {0, 1, \ldots, n}$, we define the sum-of-digits function $$S_W(h) = \sum{w \in W}[x{w}] h(x)$$ to be the sum of all the coefficients of $xw$ in $h(x)$ with $w \in W$. In the case when $q = 2$, we prove, except for a few genuine exceptions, that for any $c \in \mathbb{F}2$ and any $W \subseteq [0,n]$ there exists an irreducible polynomial $P(x)$ of degree $n$ over $\mathbb{F}_2$ such that $S{W}(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 \in \mathbb{F}q$, any $n\geq 2$ and any $W \subseteq [0,n]$, there exists an irreducible polynomial $P(x)$ of degree $n$ such that $S{W}(P) \neq c$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.