On the number of N-free elements with prescribed trace
From MaRDI portal
Abstract: In this paper we derive a formula for the number of -free elements over a finite field with prescribed trace, in particular trace zero, in terms of Gaussian periods. As a consequence, we derive a simple explicit formula for the number of primitive elements, in quartic extensions of Mersenne prime fields, having absolute trace zero. We also give a simple formula in the case when is prime. More generally, for a positive integer whose prime factors divide and satisfy the so called semi-primitive condition, we give an explicit formula for the number of -free elements with arbitrary trace. In addition we show that if all the prime factors of divide , then the number of primitive elements in , with prescribed non-zero trace, is uniformly distributed. Finally we explore the related number, , of elements in with multiplicative order and having trace . Let such that , where is the largest factor of with the same radical as that of . We show there exists an element in of (large) order with trace if and only if and . Moreover we derive an explicit formula for the number of elements in with the corresponding large order and having absolute trace zero, where is a Mersenne prime.
Recommendations
Cites work
- A Theorem of Dickson on Irreducible Polynomials
- Distribution of irreducible polynomials of small degrees over finite fields
- Explicit theorems on generator polynomials
- Generators and irreducible polynomials over finite fields
- Hamming weights in irreducible cyclic codes
- Handbook of finite fields
- scientific article; zbMATH DE number 4204482 (Why is no real title available?)
- scientific article; zbMATH DE number 4045816 (Why is no real title available?)
- scientific article; zbMATH DE number 918133 (Why is no real title available?)
- Irreducible polynomials over a finite field
- Irreducible polynomials over finite fields with prescribed trace/prescribed constant term
- Primary cyclotomic units and a proof of Catalans conjecture
- Primitive elements and polynomials with arbitrary trace
- Primitive finite field elements with prescribed trace
- Primitive Polynomials Over Finite Fields
- The great trinomial hunt
- The Hansen-Mullen primitivity conjecture: completion of proof
- The number of irreducible polynomials of degree n over F_q with given trace and constant terms
Cited in
(7)- Pseudorandom sequences derived from automatic sequences
- Computing the number of finite field elements with prescribed absolute trace and co-trace
- A new proof of the Hansen-Mullen irreducibility conjecture
- Irreducible polynomials over a finite field with restricted coefficients
- On the number of zero trace elements in polynomial bases for \(\mathbb F_{2^n}\)
- Existence of normal elements with prescribed norms
- Prescribing traces of primitive elements in finite fields
This page was built for publication: On the number of \(N\)-free elements with prescribed trace
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897563)