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.     

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

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

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

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

Model-theoretic properties of regular polygons

This work is devoted to results obtained in the model theory of regular polygons. We give a characterization of monoids with axiomatizable and model-complete class of regular polygons. We describe monoids with complete class of regular polygons that satisfy some additional conditions. We study monoids whose regular core is represented as a union of finitely many principal right ideals and all regular polygons over which have a stable and superstable theory. We prove the stability of the class of all regular polygons over a monoid provided this class is axiomatizable and model-complete. We also describe monoids for which the class of all regular polygons is superstable and ω-stable provided this class is axiomatizable and model-complete. __________ Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 10, No. 4, pp. 107–157, 2004.     

图的强收缩核与图的强自同态幺半群的正则性

本文研究图及其强自同态幺半群．首先刻画了图的强自同态幺半群的正则元，然后给出了此幺半群正则的充要条件．这推广了［１］和［２］中关于有限图的强自同态幺半群正则的结果．     

On graphs with a given endomorphism monoid

Hedrlín and Pultr proved that for any monoid M there exists a graph G with endomorphism monoid isomorphic to M . In this paper we give a construction G(M) for a graph with prescribed endomorphism monoid M . Using this construction we derive bounds on the minimum number of vertices and edges required to produce a graph with a given endomorphism monoid for various classes of finite monoids. For example we show that for every monoid M , | M |=m there is a graph G with End(G)? M and |E(G)|≤(1 + 0(1))m². This is, up to a factor of 1/2, best possible since there are monoids requiring a graph with \begin{eqnarray*} && \frac{m^{2}}{2}(1 -0(1)) \end{eqnarray*} edges. We state bounds for the class of all monoids as well as for certain subclasses—groups, k‐cancellative monoids, commutative 3‐nilpotent monoids, rectangular groups and completely simple monoids. © 2009 Wiley Periodicals, Inc. J Graph Theory 62, 241–262, 2009     

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半群的半直积,给出了这种半群半直积的充要条件,推广了一些已知的结果.     

Graph expansions of unipotent monoids

Margolis and Meakin use the Cayley graph of a group presentation to construct E-unitary inverse monoids [11]. This is the technique we refer to as graph expansion. In this paper we consider graph expansions of unipotent monoids, where a monoid is unipotent if it contains a unique idempotent. The monoids arising in this way are E-unitary and belong to the quasivariety of weakly left ample monoids. We give a number of examples of such monoids. We show that the least unipotent congruence on a weakly left ample monoid is given by the same formula as that for the least group congruence on an inverse monoid and we investigate the notion of proper for weakly left ample monoids.

Using graph expansions we construct a functor F^e from the category U of unipotent monoids to the category PWLA of proper weakly left ample monoids. The functor F^e is an expansion in the sense of Birget and Rhodes [2]. If we equip proper weakly left ample monoids with an extra unary operation and denote the corresponding category by PWLA ⁰ then regarded as a functor U→PWLA ⁰ F^e is a left adjoint of the functor F^σ : PWLA ⁰ → U that takes a proper weakly left ample monoid to its greatest unipotent image.

Our main result uses the covering theorem of [8] to construct free weakly left ample monoids.     

Graphs whose strong endomorphism monoids are regular

Let X be a graph, S End X be its strong endomorphism monoid. It is proved that S End X is a regular monoid if and only if the canonical strong factor graph U of X contains no proper subgraph which is isomorphic to U. The result generalizes that of U. Knauer about the regularity of strong endomorphism monoids of graphs.     

Constructions and presentations for monoids

Presentations are found for the wreath product of two monoids, the Schützenberger product of two monoids, the Bruck-Reilly extension of a monoid, strong semilattices of monoids and Rees matrix semigroups of monoids.     

右消去幺半群、左正则带和左正则型A幺半群

本文利用右消去幺半群,左正则带建立了真左正则型A幺半群．在证明了任一左正则型A幺半群均有P－覆盖后,给出P－覆盖的结构．     

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...     

Monoides de comptage et langages rationnels

We study some syntactic properties of languages obtained from rational languages through counting operations. These counting operations use the congruences-threshold p, modulo n—on the set of integers. We show that in some cases they preserve the properties of syntactic monoids: the structure of idempotent and commutative monoids is not modified, aperiodic monoids with central idempotents keep their central idempotents and their regular D-classes still are groups although not trivial, aperiodic left (right) nilsimple semigroups still have regular R (L)-classes which are (non trivial) groups. If possible results are expressed in terms of varieties of semigroups or monoids.     

Primely generated refinement monoids

We extend both Dobbertin’s characterization of primely generated regular refinement monoids and Pierce’s characterization of primitive monoids to general primely generated refinement monoids.     

Fixed points of endomorphisms of trace monoids

It is proved that the fixed point submonoid and the periodic point submonoid of a trace monoid endomorphism are always finitely generated. If the dependence alphabet is a transitive forest, it is proved that the set of regular fixed points of the (Scott) continuous extension of an endomorphism to real traces is Ω-rational for every endomorphism if and only if the monoid is a free product of free commutative monoids.     

A Generalization of Regular Left Acts

ＡＧｅｎｅｒａｌｉｚａｔｉｏｎｏｆＲｅｇｕｌａｒＬｅｆｔＡｃｔｓ＊）ＬｉｕＺｈｏｎｇｋｕｉ（刘仲奎）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＮｏｒｔｈｗｅｓｔＮｏｒｍａｌＵｎｉｖｅｒｓｉｔｙ，Ｌａｎｚｈｏｕ，７３００７０）Ｊ．Ａｈｓａｎ（Ｄ...     

n-正则幺半群的平坦性刻画

本文研究了主弱平坦性质的推广问题.利用张量积相等的等式组,以及同调分类方法,获得了对广义正则的幺半群的刻画结果,推广了关于正则幺半群刻画的主要的结果.