半群上的模糊群同余

设 S是一个半群 ,ρ是 S上的一个模糊同余。引进半群的模糊半正规子半群的概念 ,证明ρ是 S上的一个模糊群同余当且仅当它的模糊核 K(ρ)是 S的模糊半正规子半群 ;而且对每个给定的模糊半正规子半群 μ可以构造一个模糊同余 ρμ 使得它的模糊核 K(ρμ) =μ.     

正规子半群与旁集群

在群Ｇ中，正规子群、商群、同余关系、群的同态之间存在着互相唯一决定的关系，本文从Ｇ的正规子半群出发，建立了与商群、同余关系相对应的各种概念，得到了类似的结果。     

π—逆半群的局部化及应用

本文证明了π-逆半群在其满幂π-正则子半群上的局部化在同构意义下存在唯一，且为其最大群同态象。由此可得π-逆半群的最小群同余。     

π－逆半群的局部化及应用

本文证明了π－逆半群在其满幂π－正则子半群上的局部化在同构意义下存在唯一，且为其最大群同态象．由此可得π－逆半群的最小群同余．     

拟哈密顿局部半群

本文证明了拟哈密顿半群Ｓ是局部的，当且仅当Ｓ为下三种情形这一；（１）局部群；（２）幂零循环半群；（３）群Ｇ和幂零半群Ｉ的半格，且关于任一ｇ属于Ｇ，有ＧＩ＝Ｉ。     

幺半群的半直积及其同余

给出了两个幺半群的半直积是Ｃｌｉｆｆｏｒｄ半群的充要条件及其结构。并讨论了逆半群半直积的Ｇｒｅｅｎ关系、最小群同余和极大幂等元分离同余。     

半群的半直积及其同余

给出了两个幺半群的半直积是Ｃｌｉｆｏｒｄ半群的充要条件及其结构．并讨论了逆半群半直积的Ｇｒｅｅｎ关系、最小群同余和极大幂等元分离同余．     

强双单严格纯正半群上同余的刻划

本文利用正则半群同余的概念，找到了任一强双单严格纯正半群Ｓ的一个正规子半群ＮＫ和Ｅ上的一个正规同余ГＰ，证明了Ｓ的任何一同余可由余偶确定，从而给出了Ｓ上任一同余的一个具体刻划。     

灰色数学的新分支——灰群

给出灰子半群、强灰子半群、灰子幺半群、强灰子幺半群、灰子群和强灰子群的定义和有关定理，在此基础上，讨论灰子群一模糊子群、一般子群的关系。并且研究了灰正规子群。     

关于弱交换PO—半群

在本文中我们引入弱交换ＰＯ－半群的概念，并研究这类半群到其Ａｒｃｈｉｍｅｄｅｓ子半群的半格分解，给出这类半群似于无序半群的相应结果的一个刻画。作为推论，我们得到弱交换ＰＯｅ－群和无序半群的相应刻画。     

序半群的阿基米德半群的半格分解

本文通过一个序半群S上的一些二元关系以及它的理想的根集的性质该序半群是阿基米德半群的半格,特别地是阿基米德半群的链的刻划,证明了S是阿基米德链当且仅当S是准素的.通过序半群的m-系的概念,证明了S的任意半素理想是含它的所有素理想的交,并通过该结论,证明了S是阿基米德半群的链当且仅当S是阿基米德半群的半格且S的所有素理想关于集包含关系构成链.作为应用,该结论在一般的半群（没有序）[1]中也成立.     

A dynamical systems approach to the Kadison-Singer problem

In these notes we develop a link between the Kadison-Singer problem and questions about certain dynamical systems. We conjecture that whether or not a given state has a unique extension is related to certain dynamical properties of the state. We prove that if any state corresponding to a minimal idempotent point extends uniquely to the von Neumann algebra of the group, then every state extends uniquely to the von Neumann algebra of the group. We prove that if any state arising in the Kadison-Singer problem has a unique extension, then the injective envelope of a C*-crossed product algebra associated with the state necessarily contains the full von Neumann algebra of the group. We prove that this latter property holds for states arising from rare ultrafilters and δ-stable ultrafilters, independent, of the group action and also for states corresponding to non-recurrent points in the corona of the group.     

Uniquely factorizable elements and solvability of finite groups

In a finite group G every element can be factorized in such a way that there is one factor for each prime divisor p of | G |, and the order of this factor is p^α for some integer α ≧ 0. We define g ∈G to be uniquely factorizable if it has just one such factorization (whose factors must be pairwise commuting). We consider the existence of uniquely factorizable elements and its relation to the solvability of the group. We prove that G is solvable if and only if the set of all uniquely factorizable elements of G is the Fitting subgroup of G. We also prove various sufficient conditions for the non-existence of uniquely factorizable elements in non-solvable groups. Received: 9 June 2005     

A criterion for unit-regularity

Summary A von Neumann regular ring is unit-regular if and only if every principal right ideal is uniquely generated.     

A Degree Constraint for Uniquely Hamiltonian Graphs

A graph, G, is called uniquely Hamiltonian if it contains exactly one Hamilton cycle. We show that if G=(V, E) is uniquely Hamiltonian then Where #(G)=1 if G has even number of vertices and 2 if G has odd number of vertices. It follows that every n-vertex uniquely Hamiltonian graph contains a vertex whose degree is at most c log₂n+2 where c=(log₂3−1)⁻¹≈1.71 thereby improving a bound given by Bondy and Jackson [3].     

A condition on finitely generated soluble groups

In this note we show that if Gis a finitely generated soluble group, then every infinite subset of Gcontains two elements generating a nilpotent group of class at most kif and only if Gis finite by a group in which every two generator subgroup is nilpotent of class at most k.     

Classes of Almost Clean Rings

A ring is clean (almost clean) if each of its elements is the sum of a unit (regular element) and an idempotent. A module is clean (almost clean) if its endomorphism ring is clean (almost clean). We show that every quasi-continuous and nonsingular module is almost clean and that every right CS (i.e. right extending) and right nonsingular ring is almost clean. As a corollary, all right strongly semihereditary rings, including finite AW ^*-algebras and noetherian Leavitt path algebras in particular, are almost clean. We say that a ring R is special clean (special almost clean) if each element a can be decomposed as the sum of a unit (regular element) u and an idempotent e with aR?∩?eR?=?0. The Camillo-Khurana Theorem characterizes unit-regular rings as special clean rings. We prove an analogous theorem for abelian Rickart rings: an abelian ring is Rickart if and only if it is special almost clean. As a corollary, we show that a right quasi-continuous and right nonsingular ring is left and right Rickart. If a special (almost) clean decomposition is unique, we say that the ring is uniquely special (almost) clean. We show that (1) an abelian ring is unit-regular (equiv. special clean) if and only if it is uniquely special clean, and that (2) an abelian and right quasi-continuous ring is Rickart (equiv. special almost clean) if and only if it is uniquely special almost clean. Finally, we adapt some of our results to rings with involution: a *-ring is *-clean (almost *-clean) if each of its elements is the sum of a unit (regular element) and a projection (self-adjoint idempotent). A special (almost) *-clean ring is similarly defined by replacing “idempotent” with “projection” in the appropriate definition. We show that an abelian *-ring is a Rickart *-ring if and only if it is special almost *-clean, and that an abelian *-ring is *-regular if and only if it is special *-clean.     

I-hedrite图平面嵌入的唯一性

本文研究每一个面圈的圈长仅为2,3或4的无割点的4·正则连通平面图,称之为I-hedrite图.证明在相等意义上,I-hedrite图的平面嵌入是唯一的.这个唯一性结论意味着,两个i-hedrite图(即每一个面的度仅为2,3或4的4-正则连通平图)是相等的当且仅当它们是同构的,从而解决了i-hedrite图的同构构造在相等意义上的唯一性问题.     

Strongly P-Clean and Semi-Boolean Group Rings

Ukrainian Mathematical Journal - A ring R is called clean (resp., uniquely clean) if every element is (uniquely represented as) the sum of an idempotent and a unit. A ring R is called strongly...     

Uniquely pairable graphs

The concept of a k-pairable graph was introduced by Z. Chen [On k-pairable graphs, Discrete Mathematics 287 (2004), 11-15] as an extension of hypercubes and graphs with an antipodal isomorphism. In the present paper we generalize further this concept of a k-pairable graph to the concept of a semi-pairable graph. We prove that a graph is semi-pairable if and only if its prime factor decomposition contains a semi-pairable prime factor or some repeated prime factors. We also introduce a special class of k-pairable graphs which are called uniquely k-pairable graphs. We show that a graph is uniquely pairable if and only if its prime factor decomposition has at least one pairable prime factor, each prime factor is either uniquely pairable or not semi-pairable, and all prime factors which are not semi-pairable are pairwise non-isomorphic. As a corollary we give a characterization of uniquely pairable Cartesian product graphs.