On 2-superirreducible polynomials over finite fields
We investigate k-superirreducible polynomials, by which we mean irreducible polynomials that remain irreducible under any polynomial substitution of positive degree at most k. Let F be a finite field of characteristic p. We show that no 2-superirreducible polynomials exist in F[t] when p=2 and that no such polynomials of odd degree exist when p is odd. We address the remaining case in which p is odd and the polynomials have even degree by giving an explicit formula for the number of monic 2-superirreducible polynomials having even degree d. This formula is analogous to that given by Gauss for the number of monic irreducible polynomials of given degree over a finite field. We discuss the associated asymptotic behaviour when either the degree of the polynomial or the size of the finite field tends to infinity.
Authors
- Dan Fretwell (ORCID: https://orcid.org/0000-0001-6473-0430)
- Lara Du (ORCID: https://orcid.org/0000-0001-6749-4867)
- Jonathan Bober
- Trevor D. Wooley (ORCID: https://orcid.org/0000-0002-8781-4706)
- Gene S. Kopp (ORCID: https://orcid.org/0000-0003-1285-4532)
Institutions
- Louisiana State University (US)
- Purdue University West Lafayette (US)
- University of Bristol (GB)
- Heilbronn Institute for Mathematical Research (GB)
- Lancaster University (GB)
- Berea College (US)
Publication Details
- Journal
- Indagationes Mathematicae
- Published
- 2024-08-30
- DOI
- https://doi.org/10.1016/j.indag.2024.08.005
- Primary Topic
- Coding theory and cryptography
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Science Foundation
- National Sleep Foundation