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 174 tok/s
Gemini 2.5 Pro 51 tok/s Pro
GPT-5 Medium 38 tok/s Pro
GPT-5 High 34 tok/s Pro
GPT-4o 91 tok/s Pro
Kimi K2 205 tok/s Pro
GPT OSS 120B 438 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

Irreducible polynomials over $\mathbb{F}_{2^r}$ with three prescribed coefficients (1805.07105v2)

Published 18 May 2018 in math.NT

Abstract: For any positive integers $n \ge 3$ and $r \ge 1$, we prove that the number of monic irreducible polynomials of degree $n$ over $\mathbb{F}{2r}$ in which the coefficients of $T{n-1}$, $T{n-2}$ and $T{n-3}$ are prescribed has period $24$ as a function of $n$, after a suitable normalization. A similar result holds over $\mathbb{F}{5r}$, with the period being $60$. We also show that this is a phenomena unique to characteristics $2$ and $5$. The result is strongly related to the supersingularity of certain curves associated with cyclotomic function fields, and in particular it complements an equidistribution result of Katz.

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.

Authors (1)

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

Collections

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