2 research outputs found

    Closed formulas for the factorization of Xnβˆ’1X^n-1, the nn-th cyclotomic polynomial, Xnβˆ’aX^n-a and f(Xn)f(X^n) over a finite field for arbitrary positive integers nn

    Full text link
    The factorizations of the polynomial Xnβˆ’1X^n-1 and the cyclotomic polynomial Ξ¦n\Phi_n over a finite field Fq\mathbb F_q have been studied for a very long time. Explicit factorizations have been given for the case that rad(n)∣qwβˆ’1\mathrm{rad}(n)\mid q^w-1 where w=1w=1, ww is prime or ww is the product of two primes. For arbitrary a∈Fqβˆ—a\in \mathbb F_q^\ast the factorization of the polynomial Xnβˆ’aX^n-a is needed for the construction of constacyclic codes. Its factorization has been determined for the case rad(n)∣qβˆ’1\mathrm{rad}(n)\mid q-1 and for the case that there exist at most three distinct prime factors of nn and rad(n)∣qwβˆ’1\mathrm{rad}(n)\mid q^w-1 for a prime ww. Both polynomials Xnβˆ’1X^n-1 and Xnβˆ’aX^n-a are compositions of the form f(Xn)f(X^n) for a monic irreducible polynomial f∈Fq[X]f\in \mathbb F_q[X]. The factorization of the composition f(Xn)f(X^n) is known for the case gcd⁑(n,ord(f)β‹…deg(f))=1\gcd(n, \mathrm{ord}(f)\cdot \mathrm{deg}(f))=1 and rad(n)∣qwβˆ’1\mathrm{rad}(n)\mid q^w-1 for w=1w=1 or ww prime. However, there does not exist a closed formula for the explicit factorization of either Xnβˆ’1X^n-1, the cyclotomic polynomial Ξ¦n\Phi_n, the binomial Xnβˆ’aX^n-a or the composition f(Xn)f(X^n). Without loss of generality we can assume that gcd⁑(n,q)=1\gcd(n,q)=1. Our main theorem, Theorem 18, is a closed formula for the factorization of Xnβˆ’aX^n-a over Fq\mathbb F_q for any a∈Fqβˆ—a\in \mathbb F_q^\ast and any positive integer nn such that gcd⁑(n,q)=1\gcd(n,q)=1. From our main theorem we derive one closed formula each for the factorization of Xnβˆ’1X^n-1 and of the nn-th cyclotomic polynomial Ξ¦n\Phi_n for any positive integer nn such that gcd⁑(n,q)=1\gcd(n,q)=1 (Theorem 2.5 and Theorem 2.6). Furthermore, our main theorem yields a closed formula for the factorization of the composition f(Xn)f(X^n) for any irreducible polynomial f∈Fq[X]f\in \mathbb F_q[X], fβ‰ Xf\neq X, and any positive integer nn such that gcd⁑(n,q)=1\gcd(n,q)=1 (Theorem 27).Comment: We added factorizations of Xnβˆ’1X^n-1 and the nn-th cyclotomic polynomial. We improved the selection of the parameters for our main theorem, gave a more thorough proof for it and corrected the choice of the representative system for the case gcd(s1,s2)>1gcd(s_1,s_2)>1. We included a reference to [WY18]. In Proposition 6 we corrected the choice of rr for the case $a=1
    corecore