Some Structures of Irreducible Polynomials over a Unique Factorization Domain R
Received:August 18, 1996  Revised:February 28, 1999
Key Words: unique factorization domain   prime element   nonimplicit congruence   irreducible polynomial.  
Fund Project:
Author NameAffiliation
Wang Rui Dept. of Comp. Sci.
Yunnan University
Kunming 650091 
Hits: 2272
Download times: 1532
Abstract:
      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.
Citation:
DOI:10.3770/j.issn:1000-341X.1999.02.009
View Full Text  View/Add Comment  
  Copyright © Journal of Mathematical Research with Applications
Sponsored by：Dalian University of Technology, China Society for Industrial and Applied Mathematics
Address：No.2 Linggong Road, Ganjingzi District, Dalian City, Liaoning Province, P. R. China , Postal code ：116024
Service Tel：86-411-84707392 Email：jmre@dlut.edu.cn
Designed by Beijing E-tiller Co.,Ltd.
Due to security factors, early browsers cannot log in. It is recommended to log in with IE10, IE11, Google, Firefox, and 360 new browsers.