English

Existence of Primitive Pairs with Prescribed Traces over Finite Fields

Number Theory 2020-04-23 v1

Abstract

Let F=FqmF=\mathbb{F}_{q^m}, m>6m>6, nn a positive integer, and f=p/qf=p/q with pp, qq co-prime irreducible polynomials in F[x]F[x] and deg(p)(p) ++ deg(q)=n(q)= n. A sufficient condition has been obtained for the existence of primitive pairs (α,f(α))(\alpha, f(\alpha)) in FF such that for any prescribed a,ba, b in E=FqE=\mathbb{F}_q, TrF/E(α)=aF/E (\alpha) = a and TrF/E(α1)=bF/E (\alpha^{-1}) = b. Further, for every positive integer nn, such a pair definitely exists for large enough (q,m)(q,m). The case n=2n = 2 is dealt separately and proved that such a pair exists for all (q,m)(q,m) apart from at most 6464 choices.

Keywords

Cite

@article{arxiv.2004.10719,
  title  = {Existence of Primitive Pairs with Prescribed Traces over Finite Fields},
  author = {Hariom Sharma and R. K. Sharma},
  journal= {arXiv preprint arXiv:2004.10719},
  year   = {2020}
}