Generalization of a Theorem of Carlitz
Omran Ahmadi

TL;DR
This paper extends Carlitz's theorem by deriving explicit formulas for counting irreducible polynomials obtained through quadratic transformations over finite fields, using combinatorial methods and Hurwitz genus formula.
Contribution
It introduces a generalization of Carlitz's result, providing explicit formulas for a broader class of irreducible polynomials over finite fields.
Findings
Explicit formulas for irreducible polynomials via quadratic transformations
Application of combinatorial arguments and Hurwitz genus formula
Extension of Carlitz's original theorem
Abstract
We generalize Carlitz' result on the number of self reciprocal monic irreducible polynomials over finite fields by showing that similar explicit formula hold for the number of irreducible polynomials obtained by a fixed quadratic transformation. Our main tools are a combinatorial argument and Hurwitz genus formula.
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 · semigroups and automata theory
