Existence of primitive pairs with two prescribed traces over finite fields
Abstract
Given F= Fpt, a field with pt elements, where p is a prime power, t≥ 7, n are positive integers and f=f1/f2 is a rational function, where f1, f2 are relatively prime, irreducible polynomials with deg(f1) + deg(f2) = n in F[x]. We construct a sufficient condition on (p,t) which guarantees primitive pairing (ε, f(ε)) exists in F such that TrFpt/Fp(ε) = a and TrFpt/Fp(f(ε)) = b for any prescribed a,b ∈ Fp. Further, we demonstrate for any positive integer n, such a pair definitely exists for large t. The scenario when n = 2 is handled separately and we verified that such a pair exists for all (p,t) except from possible 71 values of p. A result for the case n=3 is given as well.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.