Idempotent-Conjugate Monoids with Nilpotent Unit Groups

Let M be a finite monoid with unit group G such that J-related idempotents in M are conjugate. If G is nilpotent, we prove that the complex monoid algebra CM of M is semisimple if and only if M is an inverse monoid. Conversely let G be a finite group such that for any finite idempotent-conjugate monoid M with unit group G, CM semisimple implies that M is an inverse monoid. We then show that G is a nilpotent group.     

On Presentations of Bruck–Reilly Extensions

We first consider the class of monoids in which every left invertible element is also right invertible, and prove that if a monoid belonging to this class admits a finitely presented Bruck–Reilly extension then it is finitely generated. This allow us to obtain necessary and sufficient conditions for the Bruck–Reilly extensions of this class of monoids to be finitely presented. We then prove that thes 𝒟-classes of a Bruck–Reilly extension of a Clifford monoid are Bruck–Reilly extensions of groups. This yields another necessary and sufficient condition for these Bruck–Reilly extensions to be finitely generated and presented. Finally, we show that a Bruck–Reilly extension of a Clifford monoid is finitely presented as an inverse monoid if and only if it is finitely presented as a monoid, and that this property cannot be generalized to Bruck–Reilly extensions of arbitrary inverse monoids.     

强自同态半群构成并群的图族

该文给出强自同态半群构成并群的图族的特征, 同时文中也明确刻划了其中每个群的单位元.     

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.     

A Note on Prehomomorphisms

We show that if G is a free group with basis X then any map θ from X to an inverse monoid S extends to a monoid prehomomorphism ψ: G\rightarrow S. As an application we give an affirmative answer to a problem of M. Petrich. 1980 Mathematics Subject Classification: Primary 20M10. September 14, 1999     

右型A半群的F-覆盖

A right adequate semigroup of type F is defined as a right adequate semigroup which is an F-rpp semigroup. A right adequate semigroup T of type F is called an F-cover for a right type-A semigroup S if S is the image of T under an L＊-homomorphism. In this paper, we will prove that any right type-A monoid has F-covers and then establish the structure of F-covers for a given right type-A monoid. Our results extend and enrich the related results for inverse semigroups.     

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.     

Isomorphisms of finite semi-Cayley graphs

Let G be a finite group. A Cayley graph over G is a simple graph whose automorphism group has a regular subgroup isomorphic to G. A Cayley graph is called a CI-graph(Cayley isomorphism) if its isomorphic images are induced by automorphisms of G. A well-known result of Babai states that a Cayley graph Γ of G is a CI-graph if and only if all regular subgroups of Aut(Γ) isomorphic to G are conjugate in Aut(Γ). A semi-Cayley graph(also called bi-Cayley graph by some authors) over G is a simple graph whose automorphism group has a semiregular subgroup isomorphic to G with two orbits(of equal size). In this paper, we introduce the concept of SCI-graph(semi-Cayley isomorphism)and prove a Babai type theorem for semi-Cayley graphs. We prove that every semi-Cayley graph of a finite group G is an SCI-graph if and only if G is cyclic of order 3. Also, we study the isomorphism problem of a special class of semi-Cayley graphs.     

Naturally ordered regular semigroups with an inverse monoid transversal

The notion of an inverse transversal of a regular semigroup is well-known. Here we investigate naturally ordered regular semigroups that have an inverse transversal. Such semigroups are necessarily locally inverse and the inverse transversal is a quasi-ideal. After considering various general properties that relate the imposed order to the natural order, we highlight the situation in which the inverse transversal is a monoid. The regularity of Green’s relations is also characterised. Finally, we determine the structure of a naturally ordered regular semigroup with an inverse monoid transversal.     

FP-injective semirings,semigroup rings and Leavitt path algebras

In this paper we give characterisations of FP-injective semirings (previously termed “exact” semirings in work of the first author). We provide a basic connection between FP-injective semirings and P-injective semirings, and establish that FP-injectivity of semirings is a Morita invariant property. We show that the analogue of the Faith-Menal conjecture (relating FP-injectivity and self-injectivity for rings satisfying certain chain conditions) does not hold for semirings. We prove that the semigroup ring of a locally finite inverse monoid over an FP-injective ring is FP-injective and give a criterion for the Leavitt path algebra of a finite graph to be FP-injective.     

Some graphs which have ascending subgraph decomposition

1.IntroductionIn[1],Alavietal.gavethefollowingdecompositionconjecture.Conjecture.LetGbeagraphwith("1')edges.ThentheedgesetofGcanbedecomposedintonsetsgeneratinggraphsGI,G2,'IG.suchthatIE(Gi)I=i(fori=1,2,',n)andGiisisomorphictoasubgraphofGi 1fori=1,2,'.)n--1.AgraphGthatcanbedecomposedasdescribedinConjecturewillbesaidtohaveanAscendingSubgraphDecomposition(AlsoabbreviatedasASD).ThesubgraphsGIIG2,',G.aresaidtobemembersofsuchadecomposition.Furthermore,ifeachGiisastar(matching,pat…     

On sofic monoids

We investigate a notion of soficity for monoids. A group is sofic as a group if and only if it is sofic as a monoid. All finite monoids, all commutative monoids, all free monoids, all cancellative one-sided amenable monoids, all multiplicative monoids of matrices over a field, and all monoids obtained by adjoining an identity element to a semigroup are sofic. On the other hand, although the question of the existence of a non-sofic group remains open, we prove that the bicyclic monoid is not sofic. This shows that there exist finitely presented amenable inverse monoids that are non-sofic.     

Inverse monoids and rational Schreier subsets of the free group

An inverse monoidM is an idempotent-pure image of the free inverse monoid on a setX if and only ifM has a presentation of the formM=Inv<X:e_o=f_i, i∈I>, wheree _i ,f _i are idempotents of the free inverse monoid: every inverse monoid is an idempotent-separating image of one of this type. IfR is anR-class of such an inverse monoid, thenR may be regarded as a Schreier subset of the free group onX. This paper is concerned with an examination of which Schreier subsets arise in this way. In particular, ifI is finite, thenR is a rational Schreier subset of the free group. Not every rational Schreier set arises in this way, but every positively labeled rational Schreier set does. Research supported by National Science Foundation grant #DMS8702019.     

关于超欧拉图的一个注记

设G是无向无环的有限图 ,若G有一个生成子图是欧拉图 (Euler) ,则称G是超欧拉图 (Supereulerian) .本文不利用收缩方法 ,直接证明了 :当图G至多差一边有两棵边不相交的生成树时 ,G是超欧拉图或者G有割边 .     

2-边连通图的线图的P3因子

如果图G有一个生成子图使得这个生成子图的每一个分支都是3个点的路，则称G有P3-因子．本文证明了对任何一个2-边连通图G，只要G的边数能被3整除，则G的线图就有P3-因子。     

图半群中幂等元生成的子半群(英)

本文明确刻划了图的强自同态么半群中幂等元生成的子半群．     

图的边覆盖染色中的分类问题(英文)

设 G是一个图 ,其边集是 E( G) ,E( G)的一个子集 S称为 G的一个边覆盖 ,若 G的每一点都是 S中一条边的端点 .G的一个 (正常 )边覆盖染色是对 G的边进行染色 ,使得每一色组都是 G的一个边覆盖 ,使 G有 (正常 )边覆盖染色所需最多颜色数 ,称为 G的边覆盖色数 ,用χ′c( G)表示 .已知的结果是对于任意简单图 G,都有 δ- 1≤ χ′c( G)≤ δ,δ是 G的最小度 .若 χ′c( G) =δ,则称 G是 CI类的 ;否则称为 CII类的 .本文主要研究了平面图及平衡的完全 r分图的分类问题     

相对于幺半群的McCoy环的扩张

对于幺半群~$M$, 本文引入了~$M$-McCoy~环.~证明了~$R$~是~$M$-McCoy~环当且仅当~$R$~上的~$n$~阶上三角矩阵环~$aUT_n(R)$~是~$M$-McCoy~环;得到了若~$R$~是~McCoy~环,~$R[x]$~是~$M$-McCoy~环,则~$R[M]$~是~McCoy~环;对于包含无限循环子半群的交换可消幺半群~$M$,证明了若~$R$~是~$M$-McCoy~环,则半群环~$R[M]$~是~McCoy~环及~$R$~上的多项式环~$R[x]$~是~$M$-McCoy~环.     

Clifford semigroups as functors and their cohomology

We prove that the category of Clifford semigroups and prehomomorphisms CSP\mathcal{CSP} is isomorphic to a certain subcategory of the category of diagrams over groups. Under this isomorphism, Clifford semigroups are identified with certain functors. As an application of the isomorphism theorem, we show that the category with objects commutative inverse semigroups having the same semilattice of idempotents and with morphisms, the inverse semigroup homomorphisms that fix the semilattice, imbeds into a category of right modules over a certain ring. Also we find a very close relationship between the cohomology groups of a commutative inverse monoid and the cohomology groups of the colimit group of the functor giving the monoid.