Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 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

Upper Bounds for Cyclotomic Numbers (1903.07314v1)

Published 18 Mar 2019 in math.NT

Abstract: Let $q$ be a power of a prime $p$, let $k$ be a nontrivial divisor of $q-1$ and write $e=(q-1)/k$. We study upper bounds for cyclotomic numbers $(a,b)$ of order $e$ over the finite field $\mathbb{F}_q$. A general result of our study is that $(a,b)\leq 3$ for all $a,b \in \mathbb{Z}$ if $p> (\sqrt{14}){k/ord_k(p)}$. More conclusive results will be obtained through separate investigation of the five types of cyclotomic numbers: $(0,0), (0,a), (a,0), (a,a)$ and $(a,b)$, where $a\neq b$ and $a,b \in {1,\dots,e-1}$. The main idea we use is to transform equations over $\mathbb{F}_q$ into equations over the field of complex numbers on which we have more information. A major tool for the improvements we obtain over known results is new upper bounds on the norm of cyclotomic integers.

Summary

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