scholarly journals Inverse semigroups with certain types of partial automorphism monoids

1990 ◽  
Vol 32 (2) ◽  
pp. 189-195 ◽  
Author(s):  
Simon M. Goberstein
Keyword(s):  
Inverse Semigroup ◽  
General Expression ◽  
Inverse Semigroups ◽  
Inverse Monoid ◽  
Exceptional Groups ◽  
Completely Semisimple

AbstractFor an inverse semigroup S, the set of all isomorphisms betweeninverse subsemigroups of S is an inverse monoid under composition which is denoted by (S) and called the partial automorphism monoid of S. Kirkwood [7] and Libih [8] determined which groups have Clifford partial automorphism monoids. Here we investigate the structure of inverse semigroups whose partial automorphism monoids belong to certain other important classes of inverse semigroups. First of all, we describe (modulo so called “exceptional” groups) all inverse semigroups S such that (S) is completely semisimple. Secondly, for an inverse semigroup S, we find a convenient description of the greatest idempotent-separating congruence on (S), using a well-known general expression for this congruence due to Howie, and describe all those inverse semigroups whose partial automorphism monoids are fundamental.

scholarly journals A note on shortly connected inverse semigroups

1991 ◽  
Vol 43 (3) ◽  
pp. 463-466 ◽  
Author(s):  
S.M. Goberstein
Keyword(s):  
Inverse Semigroup ◽  
Inverse Semigroups ◽  
The Other ◽  
Inverse Subsemigroups ◽  
Completely Semisimple

Shortly connected and shortly linked inverse semigroups arise in the study of inverse semigroups determined by the lattices of inverse subsemigroups and by the partial automorphism semigroups. It has been shown that every shortly linked inverse semigroup is shortly connected, but the question of whether the converse is true has not been addressed. Here we construct two examples of combinatorial shortly connected inverse semigroups which are not shortly linked. One of them is completely semisimple while the other is not.

Inverse semigroup homomorphisms via partial group actions

2001 ◽  
Vol 64 (1) ◽  
pp. 157-168 ◽  
Author(s):  
Benjamin Steinberg
Keyword(s):  
Inverse Semigroup ◽  
Group Actions ◽  
Inverse Semigroups ◽  
Inverse Monoid ◽  
Partial Group ◽  
Inverse Monoids ◽  
Maximal Group ◽  
Special Cases ◽  
Quick Proof ◽  
Group Component

This papar constructs all homomorphisms of inverse semigroups which factor through an E-unitary inverse semigroup; the construction is in terms of a semilattice component and a group component. It is shown that such homomorphisms have a unique factorisation βα with α preserving the maximal group image, β idempotent separating, and the domain I of β E-unitary; moreover, the P-representation of I is explicitly constructed. This theory, in particular, applies whenever the domain or codomain of a homomorphism is E-unitary. Stronger results are obtained for the case of F-inverse monoids.Special cases of our results include the P-theorem and the factorisation theorem for homomorphisms from E-unitary inverse semigroups (via idempotent pure followed by idempotent separating). We also deduce a criterion of McAlister–Reilly for the existence of E-unitary covers over a group, as well as a generalisation to F-inverse covers, allowing a quick proof that every inverse monoid has an F-inverse cover.

Some completely semisimple HNN-extensions of inverse semigroups

2019 ◽  
Vol 30 (02) ◽  
pp. 217-243
Author(s):  
Mohammed Abu Ayyash ◽  
Alessandra Cherubini
Keyword(s):  
Inverse Semigroup ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Inverse Semigroups ◽  
Bicyclic Semigroup ◽  
Hnn Extensions ◽  
Necessary And Sufficient ◽  
Completely Semisimple

We give necessary and sufficient conditions in order that lower bounded HNN-extensions of inverse semigroups and HNN-extensions of finite inverse semigroups are completely semisimple semigroups. Since it is well known that an inverse semigroup is completely semisimple if and only if it does not contain a copy of the bicyclic semigroup, we first characterize such HNN-extensions containing a bicyclic subsemigroup making use of the special feature of their Schützenberger automata.

scholarly journals Inverse semigroups determined by their lattices of inverse subsemigroups

1981 ◽  
Vol 30 (3) ◽  
pp. 321-346 ◽  
Author(s):  
P. R. Jones
Keyword(s):  
Inverse Semigroup ◽  
Free Product ◽  
Inverse Semigroups ◽  
Lattice Isomorphism ◽  
Free Inverse Semigroup ◽  
Inverse Subsemigroups ◽  
Completely Semisimple

AbstractIn a previous paper ([14]) the author showed that a free inverse semigroup is determined by its lattice of inverse subsemigroups, in the sense that for any inverse semigroup T, implies . (In fact, the lattice isomorphism is induced by an isomorphism of upon T.) In this paper the results leading up to that theorem are generalized (from completely semisimple to arbitrary inverse semigroups) and applied to various classes, including simple, fundamental and E-unitary inverse semigroups. In particular it is shown that the free product of two groups in the category of inverse semigroups is determined by its lattice of inverse subsemigroups.

BICYCLIC SUBSEMIGROUPS IN AMALGAMS OF FINITE INVERSE SEMIGROUPS

2010 ◽  
Vol 20 (01) ◽  
pp. 89-113 ◽  
Author(s):  
EMANUELE RODARO
Keyword(s):  
Inverse Semigroup ◽  
Free Product ◽  
Sufficient Conditions ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Inverse Semigroups ◽  
Amalgamated Free Product ◽  
Free Product With Amalgamation ◽  
Necessary And Sufficient ◽  
Completely Semisimple

It is well known that an inverse semigroup is completely semisimple if and only if it does not contain a copy of the bicyclic semigroup. We characterize the amalgams [S1, S2; U] of two finite inverse semigroups S1, S2whose free product with amalgamation is completely semisimple and we show that checking whether the amalgamated free product of finite inverse semigroups contains a bicyclic subsemigroup is decidable by means of a polynomial time algorithm with respect to max {|S1|,|S2|}. Moreover we consider amalgams of finite inverse semigroups respecting the [Formula: see text]-order proving that the free product with amalgamation is completely semisimple and we also provide necessary and sufficient conditions for the [Formula: see text]-classes to be finite.

scholarly journals Trace functions on inverse semigroup algebras

1995 ◽  
Vol 52 (3) ◽  
pp. 359-372 ◽  
Author(s):  
D. Easdown ◽  
W.D. Munn
Keyword(s):  
Inverse Semigroup ◽  
Sufficient Conditions ◽  
Semigroup Algebra ◽  
Inverse Semigroups ◽  
Trace Function ◽  
Complex Field ◽  
Semigroup Algebras ◽  
Complex Conjugation ◽  
Necessary And Sufficient ◽  
Completely Semisimple

Let S be an inverse semigroup and let F be a subring of the complex field containing 1 and closed under complex conjugation. This paper concerns the existence of trace functions on F[S], the semigroup algebra of S over F. Necessary and sufficient conditions on S are found for the existence of a trace function on F[S] that takes positive integral values on the idempotents of S. Although F[S] does not always admit a trace function, a weaker form of linear functional is shown to exist for all choices of S. This is used to show that the natural involution on F[S] is special. It also leads to the construction of a trace function on F[S] for the case in which F is the real or complex field and S is completely semisimple of a type that includes countable free inverse semigroups.

scholarly journals Inverse semigroups determined by their partial automorphism monoids

2006 ◽  
Vol 81 (2) ◽  
pp. 185-198 ◽  
Author(s):  
Simon M. Goberstein
Keyword(s):  
Inverse Semigroup ◽  
Partial Order ◽  
Inverse Semigroups ◽  
Natural Partial Order ◽  
Inverse Monoid ◽  
Inverse Monoids ◽  
Inverse Subsemigroups

AbstractThe partial automorphism monoid of an inverse semigroup is an inverse monoid consisting of all isomorphisms between its inverse subsemigroups. We prove that a tightly connected fundamental inverse semigroup S with no isolated nontrivial subgroups is lattice determined ‘modulo semilattices’ and if T is an inverse semigroup whose partial automorphism monoid is isomorphic to that of S, then either S and T are isomorphic or they are dually isomorphic chains relative to the natural partial order; a similar result holds if T is any semigroup and the inverse monoids consisting of all isomorphisms between subsemigroups of S and T, respectively, are isomorphic. Moreover, for these results to hold, the conditions that S be tightly connected and have no isolated nontrivial subgroups are essential.

Combinatorially Factorizable Cryptic Inverse Semigroups

2014 ◽  
Vol 57 (3) ◽  
pp. 621-630
Author(s):  
Mario Petrich
Keyword(s):  
Inverse Semigroup ◽  
Inverse Semigroups ◽  
Inverse Monoid ◽  
Direct Products ◽  
Inverse Subsemigroup ◽  
Equality Relation ◽  
Special Case

AbstractAn inverse semigroup S is combinatorially factorizable if S = TG where T is a combinatorial (i.e., 𝓗 is the equality relation) inverse subsemigroup of S and G is a subgroup of S. This concept was introduced and studied byMills, especially in the case when S is cryptic (i.e., 𝓗 is a congruence on S). Her approach is mainly analytical considering subsemigroups of a cryptic inverse semigroup.We start with a combinatorial inverse monoid and a factorizable Clifford monoid and from an action of the former on the latter construct the semigroups in the title. As a special case, we consider semigroups that are direct products of a combinatorial inverse monoid and a group.

scholarly journals A NOTE ON THE HOWSON PROPERTY IN INVERSE SEMIGROUPS

2016 ◽  
Vol 94 (3) ◽  
pp. 457-463 ◽  
Author(s):  
PETER R. JONES
Keyword(s):  
Inverse Semigroup ◽  
Inverse Semigroups ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Finitely Generated ◽  
Necessary And Sufficient

An algebra has the Howson property if the intersection of any two finitely generated subalgebras is again finitely generated. A simple necessary and sufficient condition is given for the Howson property to hold on an inverse semigroup with finitely many idempotents. In addition, it is shown that any monogenic inverse semigroup has the Howson property.

scholarly journals Inverse semigroups and their natural order

1978 ◽  
Vol 19 (1) ◽  
pp. 59-65 ◽  
Author(s):  
H. Mitsch
Keyword(s):  
Inverse Semigroup ◽  
Partial Order ◽  
Homomorphic Image ◽  
Point Of View ◽  
Inverse Semigroups ◽  
Natural Order ◽  
Theoretical Point ◽  
Trivial Group

The natural order of an inverse semigroup defined by a ≤ b ⇔ a′b = a′a has turned out to be of great importance in describing the structure of it. In this paper an order-theoretical point of view is adopted to characterise inverse semigroups. A complete description is given according to the type of partial order an arbitrary inverse semigroup S can possibly admit: a least element of (S, ≤) is shown to be the zero of (S, ·); the existence of a greatest element is equivalent to the fact, that (S, ·) is a semilattice; (S, ≤) is directed downwards, if and only if S admits only the trivial group-homomorphic image; (S, ≤) is totally ordered, if and only if for all a, b ∈ S, either ab = ba = a or ab = ba = b; a finite inverse semigroup is a lattice, if and only if it admits a greatest element. Finally formulas concerning the inverse of a supremum or an infimum, if it exists, are derived, and right-distributivity and left-distributivity of multiplication with respect to union and intersection are shown to be equivalent.

Sign in / Sign up

Export Citation Format

Share Document