2000 character limit reached
The trace of 2-primitive elements of finite fields (amended version) (1903.03160v3)
Published 7 Mar 2019 in math.NT
Abstract: Let $q$ be a prime power and $n, r$ integers such that $r\mid qn-1$. An element of $\mathbb{F}{qn}$ of multiplicative order $(qn-1)/r$ is called \emph{$r$-primitive}. For any odd prime power $q$, we show that there exists a $2$-primitive element of $\mathbb{F}{qn}$ with arbitrarily prescribed $\mathbb{F}_q$ trace when $n\geq 3$. Also we explicitly describe the values that the trace of such elements may have when $n=2$. A feature of this amended version is the reduction of the discussion to extensions of prime degree $n$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.