English

Composed Products and Explicit Factors of Cyclotomic Polynomials over Finite Fields

Number Theory 2011-09-23 v1

Abstract

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

Keywords

Cite

@article{arxiv.1109.4693,
  title  = {Composed Products and Explicit Factors of Cyclotomic Polynomials over Finite Fields},
  author = {Aleksandr Tuxanidy and Qiang Wang},
  journal= {arXiv preprint arXiv:1109.4693},
  year   = {2011}
}

Comments

24 pages