Number of irreducible polynomials in several variables over finite fields
Arnaud Bodin
TL;DR
This paper provides a formula and an estimate for counting irreducible polynomials in multiple variables over finite fields, advancing understanding in algebraic structures and polynomial enumeration.
Contribution
It introduces a new formula and estimation method for the number of irreducible multivariable polynomials over finite fields.
Findings
Derived a formula for counting irreducible polynomials in several variables.
Provided an estimation technique for their enumeration.
Enhanced understanding of polynomial irreducibility over finite fields.
Abstract
We give a formula and an estimation for the number of irreducible polynomials in two (or more) variables over a finite field.
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.
Taxonomy
TopicsCoding theory and cryptography · Analytic Number Theory Research · Algorithms and Data Compression