Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
120 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A primitive normal pair with prescribed prenorm (2406.03571v2)

Published 5 Jun 2024 in math.NT

Abstract: For any positive integers $q$, $n$, $m$ with $q$ being a prime power and $n \geq 5$, we establish a condition sufficient to ensure the existence of a primitive normal pair $(\epsilon,f(\epsilon))$ in $\mathbb{F}{q{n}}$ over $\mathbb{F}{q}$ such that $\mathrm{PN}{qn/q}(\epsilon)=a$, where $a\in\mathbb{F}{q}$ is prescribed. Here $f={f_{1}}/{f_{2}}\in\mathbb{F}{qn}(x)$ is a rational function subject to some minor restrictions such that deg($f{1}$)+deg($f_{2}$)$=m$ and $\mathrm{PN}{qn/q}(\epsilon) =\sum{i=0}{n-1}\Bigg(\underset{j\neq i}{\underset{0\leq j\leq n-1}{\prod_{}{}}}\epsilon{qj}\Bigg)$. Finally, we conclude that for $m=3$, $n\geq 6$, and $q=7k$ where $k\in\mathbb{N}$, such a pair will exist certainly for all $(q,n)$ except possibly $10$ choices at most.

Summary

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