On the number of N-free elements with prescribed trace

Abstract

In this paper we derive a formula for the number of N-free elements over a finite field Fq 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) is prime. More generally, for a positive integer N whose prime factors divide Q and satisfy the so called semi-primitive condition, we give an explicit formula for the number of N-free elements with arbitrary trace. In addition we show that if all the prime factors of q-1 divide m, then the number of primitive elements in Fqm, with prescribed non-zero trace, is uniformly distributed. Finally we explore the related number, Pq, m, N(c), of elements in Fqm with multiplicative order N and having trace c ∈ Fq. Let N qm-1 such that LQ N, where LQ is the largest factor of qm-1 with the same radical as that of Q. We show there exists an element in Fqm* of (large) order N with trace 0 if and only if m ≠ 2 and (q,m) ≠ (4,3). Moreover we derive an explicit formula for the number of elements in Fp4 with the corresponding large order LQ = 2(p+1)(p2+1) and having absolute trace zero, where p is a Mersenne prime.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…