2000 character limit reached
Existence of Primitive Pairs with Prescribed Traces over Finite Fields
Published 22 Apr 2020 in math.NT | (2004.10719v1)
Abstract: Let $F=\mathbb{F}_{qm}$, $m>6$, $n$ a positive integer, and $f=p/q$ with $p$, $q$ co-prime irreducible polynomials in $F[x]$ and deg$(p)$ $+$ deg$(q)= n$. A sufficient condition has been obtained for the existence of primitive pairs $(\alpha, f(\alpha))$ in $F$ such that for any prescribed $a, b$ in $E=\mathbb{F}_q$, Tr$F/E (\alpha) = a$ and Tr$F/E (\alpha{-1}) = b$. Further, for every positive integer $n$, such a pair definitely exists for large enough $(q,m)$. The case $n = 2$ is dealt separately and proved that such a pair exists for all $(q,m)$ apart from at most $64$ choices.
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.