正规密码H~#-富足半群的结构

证明了H~#-富足半群S是正规密码H~#-富足半群当且仅当它是完全J~#-单半群的强半格.该结果也是正规密码超富足半群和正规密码群并半群分别在超富足半群和完全正则半群上的相应结构定理的推广.     

正规密码o-超富足半群的结构

证明了ο-超富足半群S是正规密码ο-超富足半群当且仅当它是完全Jο-单半群的强半格.该结果也是正规密码超富足半群和正规密码群并半群分别在超富足半群和完全正则半群上的相应结构定理的推广。     

ON THE STRUCTURE OF REGULAR CRYPTO SEMIGROUPS

Superabundant semigroups are generalizations of completely regular semigroups written the class of abundant semigroups. It has been shown by Fountain that an abundant semigroup is superabundant if and only if it is a semilattice of completely J ^*-simple semigroups. Reilly and Petrich called a semigroup S cryptic if the Green's relation H is a congruence on S. In this paper, we call a superabundant semigroup S a regular crypto semigroup if H ^* is a congruence on S such that S/H ^* is a regular band. It will be proved that a superabundant semigroup S is a regular crypto semigroup if and only if S is a refined semilattice of completely J ^*-simple semigroups. Thus, regular crypto semigroups are generalization of the cryptic semigroups as well as abundant semigroups.     

完全■-单半群

完全■-单半群是完全单半群和完全■~*-单半群在U-半富足半群类中的一个自然推广.本文证明了半群S是完全■-单半群,当且仅当S同构于幺半群T上的正规Rees矩阵半群■(T;I,A;P).这一结果不仅推广了完全单半群的著名Rees定理,而且推广了任学明和岑嘉评在2004年建立的完全■~*-单半群的一个结构定理.     

On Ordered Semigroups Which are Semilattices of Simple and Regular Semigroups

We characterize the ordered semigroups which are decomposable into simple and regular components. We prove that each ordered semigroup which is both regular and intra-regular is decomposable into simple and regular semigroups, and the converse statement also holds. We also prove that an ordered semigroup S is both regular and intra-regular if and only if every bi-ideal of S is an intra-regular (resp. semisimple) subsemigroup of S. An ordered semigroup S is both regular and intra-regular if and only if the left (resp. right) ideals of S are right (resp. left) quasi-regular subsemigroups of S. We characterize the chains of simple and regular semigroups, and we prove that S is a complete semilattice of simple and regular semigroups if and only if S is a semilattice of simple and regular semigroups. While a semigroup which is both π-regular and intra-regular is a semilattice of simple and regular semigroups, this does not hold in ordered semigroups, in general.     

具有中心幂等元的L-弱正则半群

本文定义了具有中心幂等元的(L)-弱正则半群,研究了这类半群的代数结构.利用半群上的右同余(L)+和左同余R+,证明了半群S是一个具有中心幂等元的(L)-弱正则半群,当且仅当S是H-左可消幺半群的强半格.这推广了Clifford半群的相应结果.     

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

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

PI-强Lρ-富足半群的构造

S为半群,如果S中的每个Lρ-类都含幂等元,称S为Lρ-富足半群．特别地,如果对任意的α∈S,集合Iα∩Lα^ρ都只含唯一的元素,称S为强Lρ-富足半群．在S上通过一个非恒等置换σ,给出了PI-强Lρ-富足半群的结构定理．     

The structure of superabundant semigroups

A structure theorem for superabundant semigroups in terms of semilattices of normalized Rees matrix semigroups over some cancellative monoids is obtained. This result not only provides a construction method for superabundant semigroups but also generalizes the well-known result of Petrich on completely regular semigroups. Some results obtained by Fountain on abundant semigroups are also extended and strengthened.     

单的非负有序关联半群

一个负有序关联半群(S,≤,.,*)称为单的关联半群,如果S的所有滤子是{1}和S本身.对负有序关联半群是单的关联半群进行了刻画,给出了一个负的关联半群是单的关联半群的等价条件.     

On the complexity of the word problem for automaton semigroups and automaton groups

In this paper, we study the word problem for automaton semigroups and automaton groups from a complexity point of view. As an intermediate concept between automaton semigroups and automaton groups, we introduce automaton-inverse semigroups, which are generated by partial, yet invertible automata. We show that there is an automaton-inverse semigroup and, thus, an automaton semigroup with a PSpace-complete word problem. We also show that there is an automaton group for which the word problem with a single rational constraint is PSpace-complete. Additionally, we provide simpler constructions for the uniform word problems of these classes. For the uniform word problem for automaton groups (without rational constraints), we show NL-hardness. Finally, we investigate a question asked by Cain about a better upper bound for the length of a word on which two distinct elements of an automaton semigroup must act differently.A detailed listing of the contributions of this paper can be found at the end of this paper.     

On the Embedding of Ordered Semigroups into Ordered Group

It was shown in [7] that any right reversible, cancellative ordered semigroup can be embedded into an ordered group and as a consequence, it was shown that a commutative ordered semigroup can be embedded into an ordered group if and only if it is cancellative. In this paper we introduce the concept of L-maher and R-maher semigroups and use a technique similar to that used in [7] to show that any left reversible cancellative ordered L or R-maher semigroup can be embedded into an ordered group.     

On a Problem of M. Kambites Regarding Abundant Semigroups

A semigroup is regular if it contains at least one idempotent in each ?-class and in each ?-class. A regular semigroup is inverse if it satisfies either of the following equivalent conditions: (i) there is a unique idempotent in each ?-class and in each ?-class, or (ii) the idempotents commute. Analogously, a semigroup is abundant if it contains at least one idempotent in each ?*-class and in each ?*-class. An abundant semigroup is adequate if its idempotents commute. In adequate semigroups, there is a unique idempotent in each ?* and ?*-class. M. Kambites raised the question of the converse: in a finite abundant semigroup such that there is a unique idempotent in each ?* and ?*-class, must the idempotents commute? In this note, we provide a negative answer to this question.     

Super rpp semigroups

We study a class of special strongly rpp semigroups, namely, the class of super rpp semigroups. These super rpp semigroups are generalizations of both superabundant semigroups and Clifford semigroups within the class of rpp semigroups. In particular, we prove that a super rpp semigroup is a semilattice of D ^(l)-simple strongly rpp semigroups. Our result not only generalizes a well-known theorem of Clifford in the class of completely regular semigroups but also strengthens some structure theorems obtained by Ren-Shum for superabundant semigroups which are orthodox. Some special super rpp semigroups are considered and discussed.     

C_0半群在非线性Lipschitz扰动下的范数连续性保持

研究有界线性算子强连续半群在非线性Lipschitz扰动下的正则性质保持问题.具体地,我们证明:如果强连续半群是直接范数连续的,则非线性扰动半群是直接Lipschitz范数连续的.结论推广了线性算子半群的范数连续性质保持,丰富和完善了非线性算子半群的理论.     

基半群为0-J-严格单半群的零直并的代数

设Ａ是代数闭域ｋ上的一个具乘基Ｂ的有限维含幺结合代数，称半群Ｂ∪｛０｝为Ａ的基半群．本文给出了０ Ｊ 严格单半群的定义．对于基半群为０ Ｊ 严格单半群的零直并的代数，完全研究了它的代数表示型     

Medial permutable semigroups of the first kind

We say that a semigroup S is a permutable semigroup if the congruences of S commute with each other, that is, α○β=β○α is satisfied for all congruences α and β of S. A semigroup is called a medial semigroup if it satisfies the identity axyb=ayxb. The medial permutable semigroups were examined in Proc. Coll. Math. Soc. János Bolyai, vol. 39, pp. 21–39 (1981), where the medial semigroups of the first, the second and the third kind were characterized, respectively. In Atta Accad. Sci. Torino, I-Cl. Sci. Fis. Mat. Nat. 117, 355–368 (1983) a construction was given for medial permutable semigroups of the second [the third] kind. In the present paper we give a construction for medial permutable semigroups of the first kind. We prove that they can be obtained from non-archimedean commutative permutable semigroups (which were characterized in Semigroup Forum 10, 55–66, 1975). Research supported by the Hungarian NFSR grant No T042481 and No T043034.     

The New Structure Theorem of Right-e Wlpp Semigroups

Wlpp semigroups are generalizations of lpp semigroups and regular semi-groups. In this paper, we consider some kinds of wlpp semigroups, namely right-e wlpp semigroups. It is proved that such a semigroup S , if and only if S is the strong semilattice of L-right cancellative planks;also if and only if S is a spined product of a right-e wlpp semigroup and a left normal band.     

On Varieties Generated by Minimal Complex Semigroups

A semigroup is complex if it generates a variety the subvariety lattice of which contains an isomorphic copy of every finite lattice. It is known that a complex semigroup has at least four elements and that up to isomorphism and anti-isomorphism, there are four complex semigroups of order four. Subvarieties of the varieties generated by two of these four minimal complex semigroups have previously been described. To complete the study, we describe subvarieties of the varieties generated by the remaining two semigroups. This research was partially supported by the National Natural Science Foundation of China (No.10571077) and the Natural Science Foundation of Gansu Province (No.3ZS052-A25-017)