On the enumeration of polynomials with prescribed factorization pattern
From MaRDI portal
Publication:2135566
DOI10.1016/j.ffa.2022.102030zbMath1494.11097arXiv2105.07550OpenAlexW3163777611WikidataQ114179450 ScholiaQ114179450MaRDI QIDQ2135566
Publication date: 9 May 2022
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.07550
Polynomials over finite fields (11T06) Exponential sums (11T23) Arithmetic theory of polynomial rings over finite fields (11T55)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Counting polynomials with distinct zeros in finite fields
- Enumeration of decomposable combinatorial structures with restricted patterns
- Elliptic curves and explicit enumeration of irreducible polynomials with two coefficients pre\-scribed
- Counting irreducible factors of polynomials over a finite field
- Irreducible polynomials over \(\mathrm{GF}(2)\) with three prescribed coefficients.
- On enumeration of irreducible polynomials and related objects over a finite field with respect to their trace and norm
- Counting irreducible polynomials with prescribed coefficients over a finite field
- Irreducible polynomials over finite fields with prescribed trace/prescribed constant term
- The Number of Irreducible Polynomials and Lyndon Words with Given Trace
- Counting polynomials with a given number of zeros in a finite field
- Théorèmes de densité dans $F_q[X$]
- Distance Distribution in Reed-Solomon Codes
- Degree distribution of the greatest common divisor of polynomials over 𝔽q
This page was built for publication: On the enumeration of polynomials with prescribed factorization pattern