Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 161 tok/s
Gemini 2.5 Pro 50 tok/s Pro
GPT-5 Medium 36 tok/s Pro
GPT-5 High 37 tok/s Pro
GPT-4o 127 tok/s Pro
Kimi K2 197 tok/s Pro
GPT OSS 120B 435 tok/s Pro
Claude Sonnet 4.5 26 tok/s Pro
2000 character limit reached

Irreducible polynomials with prescribed sums of coefficients (1605.00351v1)

Published 2 May 2016 in math.NT

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

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

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

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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