On enumeration of irreducible polynomials and related objects over a finite field with respect to their trace and norm
Let \(\mathbb F_q\) be the finite field with \(q\) elements and let \(p=\text{char }\mathbb F_q\). For \(\gamma_1\in\mathbb F_q\), \(\gamma_2\in\mathbb F_q^*\) and \(m>0\), let \(I_m(\gamma_1,\gamma_2)\) denote the number of irreducible polynomials \(f(x)=x^m-a_{m-1}x^{m-1}+\cdots+(-1)^ma_0\in\mathbb F_q[x]\) with \(a_{m-1}=\gamma_1\) and \(a_0=\gamma_2\). The asymptotic formula for \(I_m(\gamma_1,\gamma_2)\), as \(m\to\infty\) and/or \(q\to\infty\), was a topic studied by many authors. The main term in the asymptotic formula for \(I_m(\gamma_1,\gamma_2)\) is known to be \(q^{m-1}/m(q-1)\). The objective of the present paper is to improve the previous bounds for the error term in the asymptotic formula for \(I_m(\gamma_1,\gamma_2)\). It is known that \[ I_m(\gamma_1,\gamma_2)=\frac 1m\sum_{d\mid m}\mu(m/d)\sum_{\alpha,\beta\in\mathbb F_q}N_d(\alpha,\beta)[\![(m/d)\alpha=\gamma_1,\,\beta^{m/d}=\gamma_2]\!], \] where \(\mu\) is the Möbius function, \[ N_d(\alpha,\beta)=|\{u\in\mathbb F_{q^d}:\text{trace}_{q^d/q}(\alpha)=\gamma_1,\; \text{norm}_{q^d/q}(\alpha)=\gamma_2\}|, \] and \[ [\![P]\!]=\begin{cases} 1&\text{if property \(P\) is true},\cr 0&\text{otherwise}. \end{cases} \] Moreover, \[ N_d(\gamma_1,\gamma_2)=\frac{q^{d-1}-1}{q-1}+(-1)^{d-1}\Bigl(M_d(\gamma_1,\gamma_2)-\frac{(q-1)^{d-1}-(-1)^{d-1}}q\Bigr), \] where \[ M_d(\gamma_1,\gamma_2)=\Bigl|\Bigl\{(\alpha_1,\dots,\alpha_d)\in{\mathbb F_q^*}^d:\sum_{j=1}^d\alpha_j=\gamma_1,\ \prod_{j=1}^d\alpha_j=\gamma_2\Bigr\}\Bigr|. \] A proof of the formula for \(N_d(\gamma_1,\gamma_2)\) using generating functions is included in the paper. The number \(M_d(\gamma_1,\gamma_2)\) can be expressed in terms of Gauss sums over \(\mathbb F_q\). The estimates for \(I_m(\gamma_1,\gamma_2)\) are obtained from the relation between \(I_m(\gamma_1,\gamma_2)\) and \(M_d(\gamma_1,\gamma_2)\) and the basic properties of Gauss sums. The main result (Theorem 2) gives two upper bounds for \(|I_m(0,\gamma_2)-A|\) and \(|I_m(\gamma_1,\gamma_2)-B|\) (\(\gamma_1\ne 0\)), respectively, where \(A\) and \(B\) contain more than just the main term in the asymptotic formula. In the corollaries, these bounds are simplified under additional assumptions. It is observed that these bounds improve the previous ones when \(m\) is large relative to \(q\).
- Irreducible polynomials with prescribed trace and restricted norm
- Kloosterman sums, elliptic curves, and irreducible polynomials with prescribed trace and norm
- The number of irreducible polynomials of degree n over F_q with given trace and constant terms
- On the number of irreducible polynomials of special kinds in finite fields
- Irreducible polynomials over a finite field and an analogue of Gauss sums over a field of characteristic 2
- A Theorem of Dickson on Irreducible Polynomials
- Analytic combinatorics
- Elliptic curves and explicit enumeration of irreducible polynomials with two coefficients pre\-scribed
- Estimates for Soto-Andrade sums.
- Explicit theorems on generator polynomials
- Generators and irreducible polynomials over finite fields
- Handbook of finite fields
- scientific article; zbMATH DE number 4204482 (Why is no real title available?)
- scientific article; zbMATH DE number 607286 (Why is no real title available?)
- scientific article; zbMATH DE number 2061795 (Why is no real title available?)
- Irreducible polynomials over \(\mathrm{GF}(2)\) with three prescribed coefficients.
- Irreducible polynomials over a finite field and an analogue of Gauss sums over a field of characteristic 2
- Irreducible polynomials over finite fields with prescribed trace/prescribed constant term
- Irreducible polynomials over GF(2) with prescribed coefficients.
- Irreducible polynomials with prescribed trace and restricted norm
- Kloosterman sums, elliptic curves, and irreducible polynomials with prescribed trace and norm
- Moment zeta functions for toric Calabi-Yau hypersurfaces
- On Katz's bound for the number of elements with given trace and norm
- Primitive elements and polynomials with arbitrary trace
- PRIMITIVE POLYNOMIALS WITH PRESCRIBED SECOND COEFFICIENT
- The Distribution of Irreducibles in GF [ q,x ]
- The number of irreducible polynomials of degree n over F_q with given trace and constant terms
- Counting irreducible polynomials with prescribed coefficients over a finite field
- On the enumeration of polynomials with prescribed factorization pattern
- Pseudorandom sequences derived from automatic sequences
- Weight of irreducible polynomials with coefficients in a finite field
- Generators of finite fields with powers of trace zero and cyclotomic function fields
- Counting polynomials over finite fields with prescribed leading coefficients and linear factors
- The number of irreducible polynomials over finite fields with vanishing trace and reciprocal trace
- Irreducible polynomials with prescribed trace and restricted norm
- The number of irreducible polynomials over finite fields of characteristic 2 with given trace and subtrace
This page was built for publication: On enumeration of irreducible polynomials and related objects over a finite field with respect to their trace and norm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1995203)
