Counting irreducible polynomials with prescribed coefficients over a finite field (Q2123310): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Fibre products of supersingular curves and the enumeration of irreducible polynomials with prescribed coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem of Dickson on Irreducible Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4457543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitive elements and polynomials with arbitrary trace / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform Distribution of Polynomials Over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit theorems on generator polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irreducible polynomials over \(\mathrm{GF}(2)\) with three prescribed coefficients. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947155 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On enumeration of irreducible polynomials and related objects over a finite field with respect to their trace and norm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irreducible polynomials over \(\mathbb{F}_{2^r}\) with three prescribed coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the enumeration of irreducible polynomials over \(\mathrm{GF}(q)\) with prescribed coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Distribution of Irreducibles in GF [ q,x ] / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distribution of irreducible polynomials in \(\mathbb{F}_q[t]\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group ring groups. Volume 2: Structure theorems of unit groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of irreducible polynomials of degree \(n\) over \(\mathbb F_q\) with given trace and constant terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3353129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of irreducible polynomials with the first two prescribed coefficients over a finite field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Zeta Functions of Artin–schreier Curves over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Strings with Given Elementary Symmetric Function Evaluations II: Circular Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elliptic curves and explicit enumeration of irreducible polynomials with two coefficients pre\-scribed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of irreducible polynomials over finite fields of characteristic 2 with given trace and subtrace / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Irreducible Polynomials and Lyndon Words with Given Trace / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generators of finite fields with powers of trace zero and cyclotomic function fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irreducible polynomials over finite fields with prescribed trace/prescribed constant term / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irreducible polynomials over GF(2) with prescribed coefficients. / rank
 
Normal rank

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
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references