Let k be a positive integer. A polynomial is called k-unitary perfectif the sum of the k-th powers of its distinct unitary divisors equals . In this paper, we study the case and prove that every -unitary perfect polynomial over is even. Moreover, we completely classify all even -unitary perfect polynomials having at most three distinct irreducible factors. In particular, we characterize all such polynomials of the form , where P is a Mersenne prime over and . As a consequence, several explicit infinite families of k-unitary perfect polynomials over are obtained.
Let k be a positive integer. A polynomial A∈F_2[x] is called k-unitary perfect if the sum of the k-th powers of its distinct unitary divisors equals A^k. In this paper, we focus on the case k=2^n and prove that every 2^n-unitary perfect polynomial over F_2 is necessarily even. Moreover, we obtain a complete classification of all even 2^n-unitary perfect polynomials having at most three distinct irreducible factors. In particular, we characterize all such polynomials of the formA=x^a (x+1)^b P^h, where P is a Mersenne prime over F_2 and a, b, and h are positive integers. As a consequence, several explicit infinite families of k-unitary perfect polynomials over F_2 are obtained.
An extension of the GCED matrices from the domain of natural integers to the unique factorization domain is given. The structure of these type of matrices defined on both arbitrary sets and GCED-closed sets are presented. Moreover, we present exact expressions for the determinant and the inverse of such matrices. The domains of Gaussian integers and polynomials over finite fields are used to illustrate the work.