English

Existence of primitive pairs with two prescribed traces over finite fields

Number Theory 2023-01-09 v1

Abstract

Given F=FptF= \mathbb{F}_{p^{t}}, a field with ptp^t elements, where pp is a prime power, t7t\geq 7, nn are positive integers and f=f1/f2f=f_1/f_2 is a rational function, where f1,f2f_1, f_2 are relatively prime, irreducible polynomials with deg(f1)+deg(f2)=ndeg(f_1) + deg(f_2) = n in F[x]F[x]. We construct a sufficient condition on (p,t)(p,t) which guarantees primitive pairing (ϵ,f(ϵ))(\epsilon, f(\epsilon)) exists in FF such that TrFpt/Fp(ϵ)=aTr_{\mathbb{F}_{p^t}/\mathbb{F}_p}(\epsilon) = a and TrFpt/Fp(f(ϵ))=bTr_{\mathbb{F}_{p^t}/\mathbb{F}_p}(f(\epsilon)) = b for any prescribed a,bFpa,b \in \mathbb{F}_{p}. Further, we demonstrate for any positive integer nn, such a pair definitely exists for large tt. The scenario when n=2n = 2 is handled separately and we verified that such a pair exists for all (p,t)(p,t) except from possible 71 values of pp. A result for the case n=3n=3 is given as well.

Keywords

Cite

@article{arxiv.2301.02381,
  title  = {Existence of primitive pairs with two prescribed traces over finite fields},
  author = {Aakash Choudhary and R. K. Sharma},
  journal= {arXiv preprint arXiv:2301.02381},
  year   = {2023}
}