Counting irreducible binomials over finite fields
Randell Heyman, Igor E. Shparlinski
TL;DR
This paper investigates the enumeration of irreducible binomials over finite fields using analytic number theory techniques to address various counting problems.
Contribution
It applies analytic number theory methods to derive new results on counting irreducible binomials over finite fields.
Findings
Derived formulas for counting irreducible binomials
Established bounds on the number of such binomials
Provided asymptotic estimates for large fields
Abstract
We consider various counting questions for irreducible binomials over finite fields. We use various results from analytic number theory to investigate these questions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.