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.

scholarly journals Inverse semigroups with isomorphic partial automorphism semigroups

1989 ◽  
Vol 47 (3) ◽  
pp. 399-417 ◽  
Author(s):  
Simon M. Goberstein
Keyword(s):  
Inverse Semigroup ◽  
Partial Order ◽  
Modular Lattice ◽  
Inverse Semigroups ◽  
Natural Partial Order ◽  
Dual Isomorphism ◽  
Combinatorial Inverse Semigroup ◽  
Inverse Subsemigroups

AbstractIt is shown that a so-called shortly connected combinatorial inverse semigroup is strongly lattice-determined “modulo semilattices”. One of the consequences of this theorem is the known fact that a simple inverse semigroup with modular lattice of full inverse subsemigroups is strongly lattice-determined [7]. The partial automorphism semigroup of an inverse semigroup S consists of all isomorphisms between inverse subsemigroups of S. It is proved that if S is a shortly connected combinatorial inverse semigroup, T an inverse semigroup and the partial automorphism semigroups of S and T are isomorphic, then either S and T are isomorphic or they are dually isomorphic chains (with respect to the natural partial order); moreover, any isomorphism between the partial automorphism semigroups of S and T is induced either by an isomorphism or, if S and T are dually isomorphic chains, by a dual isomorphism between S and T. Counter-examples are constructed to demonstrate that the assumptions about S being shortly connected and combinatorial are essential.

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.

A ∗-prehomomorphism of a type B semigroup

2020 ◽  
pp. 2150222
Author(s):  
Chunhua Li ◽  
Zhi Pei ◽  
Baogen Xu
Keyword(s):  
New York ◽  
Inverse Semigroup ◽  
Partial Order ◽  
Inverse Semigroups ◽  
Natural Partial Order ◽  
Type B ◽  
Abundant Semigroup ◽  
Basic Properties ◽  
Structure Theorems

Type B semigroups are generalizations of inverse semigroups, and every inverse semigroup admits an [Formula: see text]-unitary cover (M. Petrich, Inverse Semigroups (Wiley, New York, 1984)). Motivated by studying [Formula: see text]-unitary cover for inverse semigroups, and as a continuation of Petrich’s works in inverse semigroups, in this paper, we first introduce the concept of ∗-prehomomorphism of a type B semigroup. After obtaining some basic properties, we get some structure theorems and give some conditions for a type B semigroup which is constructed by using the ∗-prehomomorphism to be proper. In particular, we introduce the notion of [Formula: see text]-unitary good cover for an abundant semigroup, and prove that every type B semigroup with compatible natural partial order admits an [Formula: see text]-unitary good cover.

scholarly journals JOINS AND COVERS IN INVERSE SEMIGROUPS AND TIGHT -ALGEBRAS

2014 ◽  
Vol 90 (1) ◽  
pp. 121-133 ◽  
Author(s):  
ALLAN P. DONSIG ◽  
DAVID MILAN
Keyword(s):  
Inverse Semigroup ◽  
Partial Order ◽  
Inverse Semigroups ◽  
Natural Partial Order ◽  
Higher Rank ◽  
Special Case

AbstractWe show Exel’s tight representation of an inverse semigroup can be described in terms of joins and covers in the natural partial order. Using this, we show that the ${C}^{\ast } $-algebra of a finitely aligned category of paths, developed by Spielberg, is the tight ${C}^{\ast } $-algebra of a natural inverse semigroup. This includes as a special case finitely aligned higher-rank graphs: that is, for such a higher-rank graph $\Lambda $, the tight ${C}^{\ast } $-algebra of the inverse semigroup associated to $\Lambda $ is the same as the ${C}^{\ast } $-algebra of $\Lambda $.

scholarly journals The natural partial order on a regular semigroup

1980 ◽  
Vol 23 (3) ◽  
pp. 249-260 ◽  
Author(s):  
K. S. Subramonian Nambooripad
Keyword(s):  
Inverse Semigroup ◽  
Regular Semigroup ◽  
Partial Order ◽  
Inverse Semigroups ◽  
Natural Partial Order ◽  
Simple Description ◽  
Regular Semigroups ◽  
Simple Congruence ◽  
Pseudo Inverse ◽  
Completely Simple

It is well-known that on an inverse semigroup S the relation ≦ defined by a ≦ b if and only if aa−1 = ab−1 is a partial order (called the natural partial order) on S and that this relation is closely related to the global structure of S (cf. (1, §7.1), (10)). Our purpose here is to study a partial order on regular semigroups that coincides with the relation defined above on inverse semigroups. It is found that this relation has properties very similar to the properties of the natural partial order on inverse semigroups. However, this relation is not, in general, compatible with the multiplication in the semigroup. We show that this is true if and only if the semigroup is pseudo-inverse (cf. (8)). We also show how this relation may be used to obtain a simple description of the finest primitive congruence and the finest completely simple congruence on a regular semigroup.

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.

scholarly journals Inverse semigroups whose full inverse subsemigroups form a chain

1981 ◽  
Vol 22 (2) ◽  
pp. 159-165 ◽  
Author(s):  
P. R. Jones
Keyword(s):  
Inverse Semigroup ◽  
Inverse Semigroups ◽  
Analogous Problem ◽  
A Chain ◽  
Inverse Subsemigroups

The structure of semigroups whose subsemigroups form a chain under inclusion was determined by Tamura [9]. If we consider the analogous problem for inverse semigroups it is immediate that (since idempotents are singleton inverse subsemigroups) any inverse semigroup whose inverse subsemigroups form a chain is a group. We will therefore, continuing the approach of [5, 6], consider inverse semigroups whose full inverse subsemigroups form a chain: we call these inverse ▽-semigroups.

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.

scholarly journals Homogeneity of inverse semigroups

2018 ◽  
Vol 28 (05) ◽  
pp. 837-875 ◽  
Author(s):  
Thomas Quinn-Gregson
Keyword(s):  
Inverse Semigroup ◽  
Finite Groups ◽  
Abelian Groups ◽  
Semigroup Theory ◽  
Inverse Semigroups ◽  
Finitely Generated ◽  
Homogeneous Groups ◽  
Inverse Subsemigroups

An inverse semigroup [Formula: see text] is a semigroup in which every element has a unique inverse in the sense of semigroup theory, that is, if [Formula: see text] then there exists a unique [Formula: see text] such that [Formula: see text] and [Formula: see text]. We say that a countable inverse semigroup [Formula: see text] is a homogeneous (inverse) semigroup if any isomorphism between finitely generated (inverse) subsemigroups of [Formula: see text] extends to an automorphism of [Formula: see text]. In this paper, we consider both these concepts of homogeneity for inverse semigroups, and show when they are equivalent. We also obtain certain classifications of homogeneous inverse semigroups, in particular periodic commutative inverse semigroups. Our results may be seen as extending both the classification of homogeneous semilattices and the classification of certain classes of homogeneous groups, such as homogeneous abelian groups and homogeneous finite groups.

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.

Sign in / Sign up

Export Citation Format

Share Document