Infinitely Many Perfect and Unitary Perfect Polynomials Over Some GF(q)
View/Open
Date
197705Author
Harbin, Mickie Sue
Bullock, A.T.
Beard, Jacob T. B., Jr.
Metadata
Show full item recordAbstract
The existence is shown of infinitely many nonsplitting perfect polynomials over GF(2d), GF(3d), GF(5d) for each odd integer d > 1, and over GF(2d)
for each (even) integer d 1 0 (mod 3). Stronger results show that each unitary perfect polynomial over GF(q) determines an infinite equivalence class of unitary perfect polynomials over GF(q). The number SUP(q) of distinct equivalence classes of splitting unitary perfect polynomials over GF(q) is calculated for q = p and shown to be infinite for q # p. The number
NSUP(q) of distinct equivalence classes of nonsplitting unitary perfect polynomials over GF(q) remains undetermined, but is shown to be infinite whenever there are two relatively prime unitary perfect polynomials over GF(q) and one of them does not split. In particular NSUP(2d), NSUP(3d), and NSUP(5d) are infinite for each odd integer d > 1, and NSUP(2d) is
infinite for each (even) integer d 1 0 (mod 3). Examples are given to establish NSUP(2) 33, NSUP(3) 16, and NSUP(5) 6. It is conjectured that for all
primes p and odd integers d 1, NSUP(pd) is infinite.
Collections
Related items
Showing items related by title, author, creator and subject.

A Polynomial Dual of Partitions
Beard, Jacob T. B., Jr.; Dorris, Ann D. (University of Texas at ArlingtonDepartment of Mathematics, 197409)Let [see pdf for notation] be a nonnegative integral polynomial. The polynomial P(x) is mgraphical, and a multigraph G a realization of P(x), provided there exists a multigraph G containing exactly P(1) points where ... 
NonSplitting Unitary Perfect Polynomials Over GF(q)t
Harbin, Mickie Sue; Beard, Jacob T. B., Jr. (University of Texas at ArlingtonDepartment of Mathematics, 197810)It has been conjectured that there are infinitely many distinct pdequivalence classes of nonsplitting unitary perfect polynomials over GF(pd) for each prime p and each odd integer d > 1. The conjecture is proved ... 
Perfect Polynomials Over GF(q)
O'Connell, James R., Jr.; Beard, Jacob T. B., Jr.; West, Karen I. (University of Texas at ArlingtonDepartment of Mathematics, 197503)A monic polynomial [see pdf for notation] is called perfect over GF(q) if and only if the sum [see pdf for notation] of the distinct monic divisors in GF[q,x] of A(x) equals A(x). Principal results characterize all perfect ...