On the number of N-free elements with prescribed trace

DOI10.1016/J.JNT.2015.09.008zbMATH Open1396.11138arXiv1409.6961OpenAlexW2964162826MaRDI QIDQ897563FDOQ897563

Qiang Wang, Aleksandr Tuxanidy

Publication date: 7 December 2015

Published in: Journal of Number Theory (Search for Journal in Brave)

Abstract: In this paper we derive a formula for the number of $N$-free elements over a finite field $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=(q^m-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 $mathbb{F}_{q^m}$, with prescribed non-zero trace, is uniformly distributed. Finally we explore the related number, $P_{q,m,N}(c)$, of elements in $mathbb{F}_{q^m}$ with multiplicative order $N$ and having trace $cinmathbb{F}_q$. Let $Nmid{q}^m-1$ such that $L_{Q}midN$, where $L_Q$ is the largest factor of $q^m-1$ with the same radical as that of $Q$. We show there exists an element in $mathbb{F}_{q^m}^{*}$ of (large) order $N$ with trace $0$ if and only if $meq2$ and $(q,m)eq(4,3)$. Moreover we derive an explicit formula for the number of elements in $mathbb{F}_{p^4}$ with the corresponding large order $L_Q=2(p+1)(p^2+1)$ and having absolute trace zero, where $p$ is a Mersenne prime.

Full work available at URL: https://arxiv.org/abs/1409.6961

zbMATH Keywords

primitivefinite fieldstraceuniformcharacterMersenne primeirreducible polynomial\(N\)-freeGaussian periodGaussian sumprescribed coefficientsemi-primitive

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Other character sums and Gauss sums (11T24)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hamming weights in irreducible cyclic codes
• Handbook of finite fields
• Generators and irreducible polynomials over finite fields
• Primary cyclotomic units and a proof of Catalans conjecture
• Primitive elements and polynomials with arbitrary trace
• A Theorem of Dickson on Irreducible Polynomials
• Explicit theorems on generator polynomials
• The Hansen-Mullen primitivity conjecture: completion of proof
• Primitive Polynomials Over Finite Fields
• Distribution of irreducible polynomials of small degrees over finite fields
• Irreducible polynomials over finite fields with prescribed trace/prescribed constant term
• The number of irreducible polynomials of degree \(n\) over \(\mathbb F_q\) with given trace and constant terms
• Primitive finite field elements with prescribed trace
• Irreducible polynomials over a finite field
• The great trinomial hunt

Cited In (3)

• A new proof of the Hansen-Mullen irreducibility conjecture
• Irreducible Polynomials Over a Finite Field with Restricted Coefficients
• Pseudorandom sequences derived from automatic sequences

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)