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.     

AF inverse monoids and the structure of countable MV-algebras

This paper is a further contribution to the developing theory of Boolean inverse monoids. These monoids should be regarded as non-commutative generalizations of Boolean algebras; indeed, classical Stone duality can be generalized to this non-commutative setting to yield a duality between Boolean inverse monoids and a class of étale topological groupoids. MV-algebras are also generalizations of Boolean algebras which arise from many-valued logics. It is the goal of this paper to show how these two generalizations are connected. To do this, we define a special class of Boolean inverse monoids having the property that their lattices of principal ideals naturally form an MV-algebra. We say that an arbitrary MV-algebra can be co-ordinatized if it is isomorphic to an MV-algebra arising in this way. Our main theorem is that every countable MV-algebra can be so co-ordinatized. The particular Boolean inverse monoids needed to establish this result are examples of what we term AF inverse monoids and are the inverse monoid analogues of AF $C^{?}$-algebras. In particular, they are constructed from Bratteli diagrams as direct limits of finite direct products of finite symmetric inverse monoids.     

Tarski monoids: Matui’s spatial realization theorem

This paper continues the study of a class of inverse monoids, called Tarski monoids, that can be regarded as non-commutative generalizations of the unique countable, atomless Boolean algebra. These inverse monoids are related to a class of étale topological groupoids under a non-commutative generalization of classical Stone duality and, significantly, they arise naturally in the theory of dynamical systems as developed by Matui. We are thereby able to reinterpret a theorem of Matui (à la Rubin) on a class of étale groupoids as an equivalent theorem about a class of Tarski monoids: two simple Tarski monoids are isomorphic if and only if their groups of units are isomorphic. The inverse monoids in question may also be viewed as countably infinite generalizations of finite symmetric inverse monoids. Their groups of units therefore generalize the finite symmetric groups and include amongst their number the Thompson groups \(V_{n}\).     

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.     

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.     

Equivaleces between D-categories of Inverse Monoids

There exist two equivalent small categories associated to an inverse monoid which reflect its divisorial structure, called its D-categories. It is well known the relationship between the Green's relation D and the structure, of certain subsemigroups, of an inverse monoid. In this work, an analogous result is established between the Green's relation J and the D-categories of those subsemigroups. They are also given equivalent conditions for the equivalence of the D-categories of two inverse monoids and likewise equivalent conditions for the isomorphism of two inverse monoids in terms of its D-categories. It is proved that for many important classes of inverse monoids the multiplicative structure is determined by the associated category. On the contrary, a sufficient condition to obtain families of counterexamples to the above is provided and three examples are explicitely exhibited.     

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.     

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

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

Partial symmetry, reflection monoids and Coxeter groups

This is the first of a series of papers in which we initiate and develop the theory of reflection monoids, motivated by the theory of reflection groups. The main results identify a number of important inverse semigroups as reflection monoids, introduce new examples, and determine their orders.     

Presentations of Bruck-Reilly Extensions and Decision Problems

We show that any Bruck-Reilly extension of an inverse monoid is an HNN extension of a certain inverse monoid. We also discuss several decision problems. The word problem for a Bruck-Reilly extension of an inverse monoid is solvable under a reasonable condition. On the other hand, many algebraic properties for Bruck-Reilly extensions of inverse monoids are undecidable. Key words : Inverse monoids, Bruck-Reilly extensions, HNN extensions, Decision problems. AMS Mathematics Subject Classification: 20M18, 20M05     

Constructing an ample monoid from a weak Loganathan pair

This paper is based on a categorical approach to the study of inverse monoids. The main idea is to extend this to the class called ample monoids (type A monoids). We generalise the notion of a Loganathan category pair to obtain what we call a weak Loganathan category pair and take two categories associated with an ample monoid and examine their properties. We prove that each of these categories together with its subcategory of idempotents forms a weak Loganathan category pair. Then we construct an ample monoid from them.     

Contractive presentations: A family of inverse monoids and semigroups with finiteR-classes

There has recently been considerable interest in inverse monoids which are presented by generators and relations. In this work the author employs graphical techniques to investigate the word problem for presentations of inverse monoids which generalize the case in which all relations in a presentation are of the formw=w ² . The work also investigates free objects in finitely based varieties of inverse semigroups, where the free objects have similar presentations. A fundamental charecteristic of the monoids (semigroups) investigated is: ifF is a free inverse monoid andM=F/θ, then form∈F, theR-class ofmθ has no more elements than theR-class ofm.     

Partially commutative inverse monoids

Free partially commutative inverse monoids are investigated. As in the case of free partially commutative monoids or groups (trace monoids or graph groups), free partially commutative inverse monoids are defined as quotients of free inverse monoids modulo a partially defined commutation relation on the generators. A quasi linear time algorithm for the word problem is presented. More precisely, we give an algorithm for a RAM. -completeness of the submonoid membership problem (also known as the generalized word problem) and the membership problem for rational sets is shown. Moreover, free partially commutative inverse monoids modulo a finite idempotent presentation are studied. It turns out that the word problem is decidable if and only if the complement of the partial commutation relation is transitive. The work on this paper has been supported by the DFG research project GELO (Graphen mit entscheidbaren Logiken).     

Abelian Kernels of Monoids of Order-preserving Maps and of Some of Its Extensions

We compute the abelian kernels of some monoids of partial transformations. More precisely, the cases of the symmetric inverse monoid, monoids of order-preserving or order-reversing transformations and monoids of orientation-preserving or orientation-reversing transformations are treated.     

Coset decomposition of positively self-conjugate inverse submonoids of polycyclic monoids

We obtain several new results about the coding of a monoid by an appropriate submonoid of a polycyclic monoid. In particular, we characterize groups, periodic monoids, and right cancellative monoids in terms of the coset decomposition of positively self-conjugate inverse submonoids of polycyclic monoids.     

含幺逆半群的半格的同余对

本文利用一族含幺逆半群的同余对刻画了其半格的同余对,并给出了含幺逆半群半格的正规同余对族的格与其标准同余对的格之间的同构关系.     

Generation of infinite factorizable inverse monoids

We investigate the generation of factorizable inverse monoids, paying special attention to the factorizable parts of the symmetric and dual symmetric inverse monoids. Key ideas covered include rank, relative rank, Sierpiński rank, and the semigroup Bergman property. The results for finite monoids are well-known or follow quickly from well-known facts, so most of the paper concerns the infinite case.     

Coset Decomposition of Positively Self-Conjugate Inverse Submonoids of Polycyclic Monoids

Abstract. We obtain several new results about the coding of a monoid by an appropriate submonoid of a polycyclic monoid. In particular, we characterize groups, periodic monoids, and right cancellative monoids in terms of the coset decomposition of positively self-conjugate inverse submonoids of polycyclic monoids.     

Localization with respect to endomorphisms

We introduce the class of localizable monoids. It contains inverse monoids. Then we define localizations of monoids with respect to localizable submonoids of their monoid of endomorphisms. These constructions can be applied to a category of left modules or to a category of A-rings. As a result, we are able to invert endomorphisms within the original category, unlike inversive localizations of Cohn’s type which need a base change.     

Localization with Respect to Endomorphisms

Abstract. We introduce the class of localizable monoids. It contains inverse monoids. Then we define localizations of monoids with respect to localizable submonoids of their monoid of endomorphisms. These constructions can be applied to a category of left modules or to a category of A -rings. As a result, we are able to invert endomorphisms within the original category, unlike inversive localizations of Cohn's type which need a base change.