Counting irreducible polynomials with prescribed coefficients over a finite field (Q2123310): Difference between revisions
From MaRDI portal
Latest revision as of 14:19, 28 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Counting irreducible polynomials with prescribed coefficients over a finite field |
scientific article |
Statements
Counting irreducible polynomials with prescribed coefficients over a finite field (English)
0 references
8 April 2022
0 references
Let \(q\) be a prime power and \(\mathbb{F}_q\) be a finite field of \(q\) elements. The problem of estimating the number of irreducible polynomials of degree \(d\) over the finite field \({\mathbb F}_{q}\) with some prescribed coefficients has been largely studied. In the paper under review, the authors use the generating function approach, which is initiated in [\textit{Z. Gao} et al., Finite Fields Appl. 69, Article ID 101770, 26 p. (2021; Zbl 1500.11087)], to study the problem with several prescribed leading and/or ending coefficients. The authors study the group of equivalent classes for these polynomials with prescribed coefficients and extend ideas from \textit{D. R. Hayes} [Trans. Am. Math. Soc. 117, 101--127 (1965; Zbl 0139.27502)] and \textit{E. N. Kuz'min} [Sov. Math., Dokl. 42, No. 1, 45--48 (1991; Zbl 0729.11064); translation from Dokl. Akad. Nauk SSSR 313, No. 3, 552--555 (1990)]. A similar idea was also used by \textit{V. M. Fomenko} [Algebra Logika 35, No. 4, 476--495 (1996; Zbl 0936.11068); translation in Algebra Logic 35, No. 4, 266--278 (1996)] to study the \(L\) functions for the number of irreducible polynomials over \(\mathbb{F}_2\) with prescribed three coefficients, and for the case such as prescribed \(\ell\) coefficients with \(\ell < p\), where \(p\) is the characteristic of \(\mathbb{F}_q\). Using primitive idempotent decomposition for finite abelian group algebras, the authors obtain general expressions for the generating functions over group algebras. This provides a recipe to obtain an explicit formulae for the number of monic irreducible polynomials with prescribed leading coefficients, as well as prescribed ending coefficients. The authors demonstrate their method by computing these numbers for several concrete examples. Their method is also computationally simpler than that of \textit{R. Granger} [Finite Fields Appl. 57, 156--229 (2019; Zbl 1410.11132)] in the case of prescribed leading coefficients only and it produces simpler formulas in some cases.
0 references
finite fields
0 references
irreducible polynomials
0 references
prescribed coefficients
0 references
generating functions
0 references
group algebras
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references