Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 150 tok/s
Gemini 2.5 Pro 50 tok/s Pro
GPT-5 Medium 31 tok/s Pro
GPT-5 High 26 tok/s Pro
GPT-4o 105 tok/s Pro
Kimi K2 185 tok/s Pro
GPT OSS 120B 437 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

Existence of primitive pairs with two prescribed traces over finite fields (2301.02381v1)

Published 6 Jan 2023 in math.NT

Abstract: Given $F= \mathbb{F}{p{t}}$, a field with $pt$ elements, where $p $ is a prime power, $t\geq 7$, $n$ are positive integers and $f=f_1/f_2$ is a rational function, where $f_1, f_2$ are relatively prime, irreducible polynomials with $deg(f_1) + deg(f_2) = n $ in $F[x]$. We construct a sufficient condition on $(p,t)$ which guarantees primitive pairing $(\epsilon, f(\epsilon))$ exists in $F$ such that $Tr{\mathbb{F}{pt}/\mathbb{F}_p}(\epsilon) = a$ and $Tr{\mathbb{F}{pt}/\mathbb{F}_p}(f(\epsilon)) = b$ for any prescribed $a,b \in \mathbb{F}{p}$. 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.

Citations (2)

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.