共查询到18条相似文献,搜索用时 562 毫秒
1.
通过引入环的幂等自反自同态α的概念,研究幂等自反α-环,它是幂等自反环概念的拓广.给出幂等自反α-环的一些特征和扩张性质,推广了已有的一些相关结果. 相似文献
2.
研究了广义半交换环的幂零结构,定义了一类新的环类,即幂零$\alpha$-半交换环.说明了$\alpha$-半交换环与半交换环, $\alpha$-半交换环和$\alpha$-刚性环等环密切相关,通过构造反例说明了幂零$\alpha$-半交换环未必是$\alpha$-半交换环.研究了幂零$\alpha$-半交换环的各种性质,推广和统一了与环的半交换性质有关的若干结论. 相似文献
3.
4.
5.
将Nicholson提出的幂等元强提升概念进行了推广,定义了L-环,弱L-环,使用通常环论方法研究了L-环中本原幂等元的Local性和L-环与potent环之间的关系,证明了一个环是L-环的充分必要条件是R/J(R)是Boole环,且幂等元模J(R)可强提升,同时对具有一对零同态的Morita Context环C=A VW B,关于L-性讨论了C与A,B之间的关系. 相似文献
6.
正规幂环和一致幂环 总被引:7,自引:1,他引:6
张振良 《纯粹数学与应用数学》2001,17(1):6-13
文[1]首次提出了HX环(幂环)的概念,文[2]探索了幂环的性质和结构,本文类似于幂群的研究,提出了正规幂环和一致幂环的概念,研究了它们的结构和它们之间的关系,对它们进行了分类,并讨论了它们的交与和,从而构造了它们的子环链和理想链。 相似文献
7.
环并半环称为纯整环并半环, 若其加法幂等元集是一个带半环. 若纯整环并半环的加法幂等元集是一个T带半环, 称为$T$纯整环并半环. 研究了纯整环并半环以及一些$T$纯整环并半环的半群结构. 相似文献
8.
如果R中每个元素(对应地,可逆元)均可表示为一个幂等元与环R的Jacobson根中一个元素之和,则称环R是J-clean环(对应地,UJ环).所有的J-clean环都是UJ环.作为UJ环的真推广,本文引入GUJ环的概念,研究GUJ环的基本性质和应用.进一步地,研究每个元素均可表示为一个幂等元与一个方幂属于环的Jacobson根的元素之和的环. 相似文献
9.
斜幂级数环的主拟Baer性 总被引:4,自引:0,他引:4
设R是环,并且R的左半中心幂等元都是中心幂等元, α是R的一个弱刚性自同态. 本文证明了斜幂级数环R[[x,α]]是右主拟Baer环当且仅当R是右主拟Baer环,并且R的任意可数幂等元集在I(R)中有广义交,其中I(R)是R的幂等元集. 相似文献
10.
本文研究了Morita Context环C的T-幂零性、T-幂等性、T-稳定性和周期性、弱周期性、广义周期性、拟周期性.利用经典环论方法,获得了C的上述性质与C中A, B, V, W的性质之间的关系. 相似文献
11.
12.
设S={x1,x2,...,xn}是由n个不同的正整数组成的集合,并设a为正整数.如果一个n阶矩阵的第i行j列元素是S中元素xi和xj的最大公因子的a次幂(xi,xj)a,则称该矩阵为定义在S上的a次幂最大公因子(GCD)矩阵,用(Sa)表示;类似定义a次幂LCM矩阵[Sa].如果存在{1,2,...,n}上的一个置换σ使得xσ(1)|xσ(2)|···|xσ(n),则称S为一个因子链.如果存在正整数k,使得S=S1∪S2∪···∪Sk,其中每一个Si(1ik)均为一个因子链,并且对所有的1i=jk,Si中的每个元素与Sj中的每个元素互素,则称S由有限个互素因子链构成.本文中,设S由有限个互素的因子链构成,并且1∈S.我们首先给出幂GCD矩阵与幂LCM矩阵的行列式的公式,然后证明:如果a|b,则det(Sa)|det(Sb),det[Sa]|det[Sb],det(Sa)|det[Sb].最后我们指出:如果构成S的有限个因子链不互素,则此结论一般不成立. 相似文献
13.
14.
Eitan Altman Konstantin Avrachenkov Richard Marquez Gregory Miller 《Mathematical Methods of Operations Research》2005,62(3):375-386
We consider a zero-sum stochastic game with side constraints for both players with a special structure. There are two independent
controlled Markov chains, one for each player. The transition probabilities of the chain associated with a player as well
as the related side constraints depend only on the actions of the corresponding player; the side constraints also depend on
the player’s controlled chain. The global cost that player 1 wishes to minimize and that player 2 wishes to maximize, depend
however on the actions and Markov chains of both players. We obtain a linear programming formulations that allows to compute
the value and saddle point policies for this problem. We illustrate the theoretical results through a zero-sum stochastic
game in wireless networks in which each player has power constraints 相似文献
15.
Mabrouk Ben Nasr 《Monatshefte für Mathematik》2009,158(1):97-102
An extension of integral domains is said to have the “finite length of intermediate chains of domains” property (for short FICP) if each chain of intermediate
rings between R and S is finite. The main purpose of this paper is to characterize when has FICP in case R
* (the integral closure of R in S) is a finite dimensional semilocal domain. This generalizes a theorem due to Gilmer, in which S is the quotient field of R. Examples illustrating the sharpness and the limits of our results are settled.
相似文献
16.
17.
《代数通讯》2013,41(4):1295-1305
Abstract If R ? T is an extension of (commutative integral) domains, Λ(T/R) is defined as the supremum of the lengths of chains of intermediate fields in the extension k R (Q ∩ R) ? k T (Q), where Q runs over the prime ideals of T. The invariant Λ(T/R) is determined in case R and T are adjacent rings and in case Spec(R) = Spec(T) as sets. It is proved that if R is a domain with integral closure R′, then Λ(T/R) = 0 for all overrings T of R if and only if R′ is a Prüfer domain such that Λ(R′/R) = 0. If R ? T are domains such that the canonical map Spec(T) → Spec(R) is a homeomorphism (in the Zariski topology), then Λ(T/R) is bounded above by the supremum of the lengths of chains of rings intermediate between R and T. Examples are given to illustrate the sharpness of the results. 相似文献