On the number of $N$-free elements with prescribed trace
Aleksandr Tuxanidy, Qiang Wang

TL;DR
This paper derives explicit formulas for counting N-free elements with prescribed trace in finite fields, including primitive elements with trace zero, using Gaussian periods, and explores their distribution and existence conditions.
Contribution
It introduces new explicit formulas for counting N-free elements with prescribed trace, extending to primitive elements and elements with specific order in finite fields.
Findings
Explicit formula for N-free elements with prescribed trace in finite fields.
Distribution of primitive elements with non-zero trace is uniform under certain conditions.
Existence of elements with large order and trace zero in finite fields is characterized.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Algebraic Geometry and Number Theory · Finite Group Theory Research
