research

On the number of NN-free elements with prescribed trace

Abstract

In this paper we derive a formula for the number of NN-free elements over a finite field Fq\mathbb{F}_q 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 Q=(qmβˆ’1)/(qβˆ’1)Q = (q^m-1)/(q-1) is prime. More generally, for a positive integer NN whose prime factors divide QQ and satisfy the so called semi-primitive condition, we give an explicit formula for the number of NN-free elements with arbitrary trace. In addition we show that if all the prime factors of qβˆ’1q-1 divide mm, then the number of primitive elements in Fqm\mathbb{F}_{q^m}, with prescribed non-zero trace, is uniformly distributed. Finally we explore the related number, Pq,m,N(c)P_{q, m, N}(c), of elements in Fqm\mathbb{F}_{q^m} with multiplicative order NN and having trace c∈Fqc \in \mathbb{F}_q. Let N∣qmβˆ’1N \mid q^m-1 such that LQ∣NL_Q \mid N, where LQL_Q is the largest factor of qmβˆ’1q^m-1 with the same radical as that of QQ. We show there exists an element in Fqmβˆ—\mathbb{F}_{q^m}^* of (large) order NN with trace 00 if and only if mβ‰ 2m \neq 2 and (q,m)β‰ (4,3)(q,m) \neq (4,3). Moreover we derive an explicit formula for the number of elements in Fp4\mathbb{F}_{p^4} with the corresponding large order LQ=2(p+1)(p2+1)L_Q = 2(p+1)(p^2+1) and having absolute trace zero, where pp is a Mersenne prime

    Similar works

    Full text

    thumbnail-image

    Available Versions