唯一分解整环R上不可约多项式的一个判别准则

本获得了一个判别唯一分解整环R及其商域Q上的n次（n＞2)多项式不可约的充分条件。     

唯一分解整环R上不可约多项式的若干结构

本文在唯一分解整环Ｒ上引入隐含同余和非隐含同余概念．从而获得Ｒ上多项式不可约性的若干结构．一百多年来首次对著名的Ｅｉｓｅｎｓｔｅｉｎ不可约定理作出重要推广     

唯一分解整环及其比域上多项式不可约性判定

唯一分解整环及其比域上多项式不可约性判定王瑞（云南大学数学系研究生６５００９１）早在十九世纪中叶，德国数学家Ｅｉｓｅｎｓｔｅｉｎ提出一个判定唯一分解整环及其比域上多项式不可约的方法，即著名的Ｅｉｓｅｎｓｔｅｉｎ判定法［１］，［２］，［４］（下称Ｅ法）...     

Z[√-m]为唯一因子分解整环的刻画

利用一类整环Z[√-m]={x＋y√-m｜x,y∈z,m∈N}中不可约元的几个性质,给出了这类整环成为唯一因子分解整环的一个充分必要条件．     

再论整数环上多项式的不可约性的判别法

本研究整系数多项式的不可约因式，给出了低次不可约多项式的判别的一种方法和一些不可约问题的处理方法。     

整多项式可约性的一个判别法

整多项式可约性的一个判别法王琳（中央财院数学教研室）整系数多项式可约性的判定是多项式研究的一个基本问题，也是一个比较困难的问题．在这方面有著名的艾森斯坦因判别法．为论述方便先引人下面记号．设ｆ（ｘ）＝…＋ａ１ｘ＋ａｏ（ａｎ０）为一整系数多项式ｐ是一个...     

一个欧氏环的素因子分解方法

本文研究了整数环的一个代数扩环的性质.利用最优化理论证明了这个代数扩环是一个欧氏环,给出了它的单位和素元的刻画,得到了对这个代数扩环中任意素进行素因子分解的方法.     

整环上广义幂级数环的分解性质

设A(て)B是整环的扩张,(S,≤)是满足一定条件的严格偏序幺半群,[[BS,≤]]是整环B上的广义幂级数环.本文研究整环[Bs,≤]]和{f∈[[Bs,≤]]|f(0)∈A}的ACCP条件和BFD性质.结果表明,整环{f∈[[BS,≤]]|f(0)∈A}的分解性质不仅依赖于A和B的分解性质以及U(A)和U(B),而且还依赖于幺半群S的分解性质.该结果能够构造出具有某种分解性质的整环的新例子.     

整环上广义幂级数环的分解性质

设A■B是整环的扩张, (S,≤)是满足一定条件的严格偏序幺半群, [[BS,≤]]是整环B上的广义幂级数环.本文研究整环[[BS,≤]]和{f∈[[BS,≤]]|f(0)∈A}的ACCP条件和BFD性质. 结果表明,整环{f∈[[BS,≤]]|f(0)∈A}的分解性质不仅依赖于A和B的分解性质以及U(A)和U(B),而且还依赖于幺半群S的分解性质.该结果能够构造出具有某种分解性质的整环的新例子.     

唯一分解整半群上的Mobius函数及其反演公式

陈兆斗首先在文献[1]中定义出了有单位元并满足消去律的唯一分解交换半群上的Mbius函数.本文我们首先证明了Mbius函数作为半群(M1,*)上的元素是常值函数ζ(·)的逆函数.其后获得了该Mbius函数的一些相关结果并给出了三个Mbius反演公式.     

Irreducible Divisor Graphs and Factorization Properties of Domains

This article examines the connections between the factorization properties of a domain, e.g., unique factorization domain (UFD), finite factorization domain (FFD), and the domain's irreducible divisor graphs. In particular, we show that although there are some nice correlations between the properties of the domain D and the set of irreducible divisor graphs {G(x): x ∈ D*  U(D)} when D is an FFD, it is very unlikely that any information about the domain D can be gleaned from the collection {G(x): x ∈ D*  U(D)} when D is not an FFD. We also introduce an alternate irreducible divisor graph called the compressed irreducible divisor graph and study some of its properties.     

Constructing Almost Excellent Unique Factorization Domains

Abstract

Let (T, M) be a complete local normal integral domain containing the rationals such that |T/M | ≥ c where c is the cardinality of the real numbers. Let p be a non-maximal prime ideal of T such that _{T p} is a regular local ring. We construct a local Unique Factorization Domain (UFD) A such that the M-adic completion of A is T, p is maximal in the generic formal fiber and all fibers of A are geometrically regular except for those over some height one prime ideals.

     

Closed Polynomials in Polynomial Rings over Unique Factorization Domains

Let R be a UFD, and let M(R, n) be the set of all subalgebras of the form R[f], where f ∈ R[x ₁,…, x _n ]?R. For a polynomial f ∈ R[x ₁,…, x _n ]?R, we prove that R[f] is a maximal element of M(R, n) if and only if it is integrally closed in R[x ₁,…, x _n ] and Q(R)[f] ∩ R[x ₁,…, x _n ] = R[f]. Moreover, we prove that, in the case where the characteristic of R equals zero, R[f] is a maximal element of M(R, n) if and only if there exists an R-derivation on R[x ₁,…, x _n ] whose kernel equals R[f].     

1. Introduction

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.     

On the Ascent of Properties Related to Unique Factorization Domains

In this article, we develop equivalent conditions for a certain class of monoidal transform to inherit either the property of being a completely integrally closed domain that satisfies the ascending chain condition on principal ideals, the property of being a Mori domain, the property of being a Krull domain, or the property of being a unique factorization domain, respectively. Such a class of monoidal transform is given in terms of an (analytically) independent set that forms a prime ideal in the base domain. Characterizations are provided illustrating the necessity of the “prime ideal” hypothesis when the base domain is a Noetherian unique factorization domain.     

棋盘游戏与有限域上多项式分解算法

将有限域F_2上多项式分解问题转化为一种对应的棋盘游戏,利用后者的性质设计了一个F_2上m+n-2次多项式f(x)分解为一个m-1次多项式与一个n-1次多项式的判断、分解算法,并对算法的复杂度进行了分析.算法的一个优势是,如果f(x)不能按要求分解,也可以找到一个与f(x)相近(这里指系数相异项较少)的多项式的分解.