Some results on the dot-depth hierarchy

In this paper we pursue the study of the decidability of the dot-depth hierarchy. We give an effective lower bound for the dotdepth of an aperiodic monoid. The main tool for this is the study of a certain operation on varieties of finite monoids in terms of Mal'cev product. We also prove the equality of two decidable varieties which were known to contain all dot-depth two monoids. Finally, we restrict our attention to inverse monoids, and we prove that the class of inverse dot-depth two monoids is locally finite.     

C-rpp半群的半直积

给出了两个幺半群的半直积是C-rpp半群的充要条件及结构。     

On Graph Products of Automatic and Biautomatic Monoids

It is shown that the graph product of automatic monoids is always automatic thereby improving on a result by Veloso da Costa [22] who showed this result provided the factors have finite geometric type. Secondly, we prove that, in general, the free product (and therefore the graph product) of biautomatic monoids need not be biautomatic. Imposing a restriction on the factors that is symmetric to Veloso da Costa's "finite geometric type", the biautomaticity of all graph products of biautomatic monoids is shown.     

弱Clifford拟正则半群的半直积和圈积

本文给出两个么半群Ｓ和Ｔ的半直积和圈积为弱Ｃｌｉｆｆｏｒｄ拟正则么半群的充要条件和半直积的结构，同时还讨论了弱Ｃｌｉｆｆｏｒｄ拟正则么半群的最小群同余与半直积的最小群同余之间的关系．     

幺半群左正则纯整半直积上的同余

研究了幺半群半直积上的同余，给出了幺半群半直积的所谓同余分解定理，并特别讨论了幺半群左正则纯整半直积及其子类上的同余．     

Endomorphism monoids of free acts and O-wreath products of monoids

Monoids and acts which may have zero elements are considered. In Section 1 we construct a O-wreath product of monoids. In 2 we prove the theorem that the endomorphism monoid of a free act over a monoid with zero can be represented as a O-wreath product. Considering monoids with tero we are interested in their annihilator properties. In 3 we give necessary and sufficient conditions for a O-wreath product of monoids to be a right (left) Baer (Rickart) monoid. In 4 we obtain as a consequence corresponding conditions for the endomorphism monoid of a free act over a monoid with zero.     

Graph products of monoids

The main aim of this paper is to characterize the Green relations in the graph product of monoids. Necessary and sufficient conditions for an element in a graph product of monoids to be idempotent, regular or completely regular, are established. These characterizations immediately lead to decidability results. A new proof for the word problem is also presented. May 22, 2000     

Bruck–Reilly extensions of direct products of monoids and completely (0-)simple semigroups

We say that a class of monoids satisfies the property ℘ if every monoid in that class that admits a finitely presented Bruck–Reilly extension is finitely generated. We show that completely (0-)simple semigroups satisfy ℘, and that the direct product of two monoids in a class that satisfy ℘ also satisfies ℘ subject to a certain condition on the endomorphisms of the direct product. As a consequence of this result we obtain a new class of bands and a new class of completely regular semigroups that satisfy property ℘.     

左中心rpp半群的半直积

讨论了幂等元都是左中心元的rpp半群的半直积,给出了这种半群半直积的充要条件,推广了一些已知的结果.     

Factorizable inverse monoids

Factorizable inverse monoids constitute the algebraic theory of those partial symmetries which are restrictions of automorphisms; the formal definition is that each element is the product of an idempotent and an invertible. This class of monoids has theoretical significance, and includes concrete instances which are important in various contexts. This survey is organised around the idea of group acts on semilattices and contains a large range of examples. Topics also include methods for construction of factorizable inverse monoids, and aspects of their inner structure, morphisms, and presentations.     

右（左）逆半群的半直积及圈积

给出了两个幺半群的半直积及圈积为右（左）逆半群的充分必要条件，从而推广了[2]中两个幺半群的半幺直积和圈积为逆半群的充分必要条件．     

Self-adjunctions and matrices

It is shown that the multiplicative monoids of Temperley-Lieb algebras are isomorphic to monoids of endomorphisms in categories where an endofunctor is adjoint to itself. Such a self-adjunction is found in a category whose arrows are matrices, and the functor adjoint to itself is based on the Kronecker product of matrices. This self-adjunction underlies the orthogonal group case of Brauer's representation of the Brauer centralizer algebras.     

Brauer and Jones tied monoids

We introduce a ramified monoid, attached to each Brauer–type monoid, that is, to the symmetric group, to the Jones and Brauer monoids among others. Ramified monoids correspond to a class of tied monoids arising from knot theory and are interesting in themselves. The ramified monoid attached to the symmetric group is the Coxeter-like version of the so–called tied braid monoid. We give a presentation of the ramified monoid attached to the Brauer monoid. Also, we introduce and study two tied-like monoids that cannot be described as ramified monoids. However, these monoids can also be regarded as tied versions of the Jones and Brauer monoids.     

Globals of Completely Regular Monoids

An element of a semigroup S is called irreducible if it cannot be expressed as a product of two elements in S both distinct from itself. In this paper we show that the class C of all completely regular...     

Regularity of the wreath product of monoids

The main theorem of this paper gives necessary and sufficient conditions for the regularity of the wreath product of monoids.     

独异点的同构定理和独异点列

随着自动机理论的发展,独异点(monoid,即含单位元的半群)理论得到了重要的应用,其地位也日益提高。虽然,作为泛代数(universal algebra)的特例之独异点的同构定理等早巳随着泛代数有关定理的给出(见[1],[2])而给出了,但其反映不出独异点的特点。特别是如何把独异点与群在这方面统一地描述出来,更是许多人所关注的问题。Jacobson在[3]内就这样做了,但很不完美;[4]就一种极特殊的情形,给出了     

图的P-正则自同态幺半群

刻划了具有Ｐ－正则自同态幺半群的二分图,讨论了字典序积图的自同态幺半群的Ｐ－正则性。     

Fundamental groups,inverse schützenberger automata,and monoid presentations

This paper gives decidable conditions for when a finitely generated subgroup of a free group is the fundamental group of a Schützenberger automaton corresponding to a monoid presentation of an inverse monoid. Also, generalizations are given to specific types of inverse monoids as well as to monoids which are "nearly inverse." This result has applications to computing membership for inverse monoids in a Mal'cev product of the pseudovariety of semilattices with a pseudovariety of groups.

This paper also shows that there is a bijection between strongly connected inverse automata and subgroups of a free group, generated by positive words. Hence, we also obtain that it is decidable whether a finite strongly connected inverse automaton is a Schützenberger automaton corresponding to a monoid presentation of an inverse monoid. Again, we have generalizations to other types of inverse monoids and to "nearly inverse" monoids. We show that it is undecidable whether a finite strongly connected inverse automaton is a Schützenberger automaton of a monoid presentation of anE-unitary inverse monoid.     

On one-relator products induced by generalized triangle groups II

This is the second of two papers in which we study a group which is the quotient of a free product of groups by the normal closure of a single word that is contained in a subgroup which has the form of a free product of two cyclic groups. We use known properties of generalized triangle groups, together with detailed analysis of pictures and of words in free monoids, to prove a number of results such as a Freiheitssatz and the existence of Mayer-Vietoris sequences for such groups under suitable hypotheses. The results generalize those in an earlier article of the second author and Shwartz.