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

Composed Products and Explicit Factors of Cyclotomic Polynomials over Finite Fields (1109.4693v1)

Published 22 Sep 2011 in math.NT

Abstract: Let $q = ps$ be a power of a prime number $p$ and let $\mathbb{F}q$ be the finite field with $q$ elements. In this paper we obtain the explicit factorization of the cyclotomic polynomial $\Phi{2nr}$ over $\mathbb{F}q$ where both $r \geq 3$ and $q$ are odd, $\gcd(q,r) = 1$, and $n\in \mathbb{N}$. Previously, only the special cases when $r = 1,\ 3,\ 5$ had been achieved. For this we make the assumption that the explicit factorization of $\Phi_r$ over $\mathbb{F}_q$ is given to us as a known. Let $n = p_1{e_1}p_2{e_2}... p_s{e_s}$ be the factorization of $n \in \mathbb{N}$ into powers of distinct primes $p_i,\ 1\leq i \leq s$. In the case that the orders of $q$ modulo all these prime powers $p_i{e_i}$ are pairwise coprime we show how to obtain the explicit factors of $\Phi{n}$ from the factors of each $\Phi_{p_i{e_i}}$. We also demonstrate how to obtain the factorization of $\Phi_{mn}$ from the factorization of $\Phi_n$ when $q$ is a primitive root modulo $m$ and $\gcd(m,n) = \gcd(\phi(m),\ord_n(q)) = 1$. Here $\phi$ is the Euler's totient function, and $\ord_n(q)$ denotes the multiplicative order of $q$ modulo $n$. Moreover, we present the construction of a new class of irreducible polynomials over $\mathbb{F}_q$ and generalize a result due to Varshamov (1984) \cite{Varshamov}.

Summary

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