Some Structures of Irreducible Polynomials over a Unique Factorization Domain R
Received:August 18, 1996  Revised:February 28, 1999
Key Word: unique factorization domain   prime element   nonimplicit congruence   irreducible polynomial.  
Fund ProjectL:
Author NameAffiliation
Wang Rui Dept. of Comp. Sci.
Yunnan University
Kunming 650091 
Hits: 1890
Download times: 1351
      In this paper, we give the conception of implicit congruence and nonimplicit congruence in a unique factorization domain R and establish some structures of irreducible polynomials over R . A classical result, Eisenstein′s criterion, is generalized.
View Full Text  View/Add Comment  Download reader