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 Modular inverse semigroups

1987 ◽  
Vol 43 (1) ◽  
pp. 47-63 ◽  
Author(s):  
Katherine G. Johnston ◽  
Peter R. Jones ◽  
T. E. Hall
Keyword(s):  
Inverse Semigroup ◽  
Homomorphic Image ◽  
Inverse Semigroups ◽  
A Chain ◽  
Inverse Subsemigroups ◽  
Maximum Group

AbstractAn inverse semigroup S is said to be modular if its lattice 𝓛𝓕 (S) of inverse subsemigroups is modular. We show that it is sufficient to study simple inverse semigroups which are not groups. Our main theorem states that such a semigroup S is modular if and only if (I) S is combinatorial, (II) its semilattice E of idempotents is “Archimedean” in S, (III) its maximum group homomorphic image G is locally cyclic and (IV) the poset of idempotents of each 𝓓-class of S is either a chain or contains exactly one pair of incomparable elements, each of which is maximal. Thus in view of earlier results of the second author a simple modular inverse semigroup is “almost” distributive. The bisimple modular inverse semigroups are explicitly constructed. It is remarkable that exactly one of these is nondistributive.

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.

scholarly journals THE ÉTALE GROUPOID OF AN INVERSE SEMIGROUP AS A GROUPOID OF FILTERS

2013 ◽  
Vol 94 (2) ◽  
pp. 234-256 ◽  
Author(s):  
M. V. LAWSON ◽  
S. W. MARGOLIS ◽  
B. STEINBERG
Keyword(s):  
Functional Analysis ◽  
Inverse Semigroup ◽  
Inverse Semigroups ◽  
Topological Groupoid ◽  
Linear Representations ◽  
Inverse Subsemigroups ◽  
Étale Groupoid

AbstractPaterson showed how to construct an étale groupoid from an inverse semigroup using ideas from functional analysis. This construction was later simplified by Lenz. We show that Lenz’s construction can itself be further simplified by using filters: the topological groupoid associated with an inverse semigroup is precisely a groupoid of filters. In addition, idempotent filters are closed inverse subsemigroups and so determine transitive representations by means of partial bijections. This connection between filters and representations by partial bijections is exploited to show how linear representations of inverse semigroups can be constructed from the groups occurring in the associated topological groupoid.

On growth, identities and free subsemigroups for inverse semigroups of deficiency one

2015 ◽  
Vol 25 (01n02) ◽  
pp. 233-258 ◽  
Author(s):  
L. M. Shneerson
Keyword(s):  
Positive Integer ◽  
Inverse Semigroup ◽  
Exponential Growth ◽  
Polynomial Growth ◽  
Inverse Semigroups ◽  
Defining Relations ◽  
Rank 2 ◽  
Inverse Subsemigroups

For any positive integer n > 1 we construct an example of inverse semigroup with n generators and n - 1 defining relations which has cubic growth and at least n generators in any presentation. This semigroup has the same set of identities as the free monogenic inverse semigroup. In particular, we give the first example of a one relation nonmonogenic inverse semigroup having polynomial growth. We also prove that for any positive integer n there exists an inverse semigroup ϒn of deficiency 1 and rank n + 1 such that ϒn has exponential growth and it does not contain nonmonogenic free inverse subsemigroups. Furthermore, ϒn satisfies the identity [[x, y], [z, t]]2 = [[x, y], [z, t]] of quasi-solvability and it contains a free subsemigroup of rank 2.

scholarly journals Lattice isomorphisms of inverse semigroups

1978 ◽  
Vol 21 (2) ◽  
pp. 149-157 ◽  
Author(s):  
P. R. Jones
Keyword(s):  
Inverse Semigroup ◽  
Free Groups ◽  
Inverse Semigroups ◽  
Strong Sense ◽  
Lattice Isomorphism ◽  
Free Inverse Semigroup ◽  
Subgroup Lattices ◽  
The Subject ◽  
Inverse Subsemigroups

A largely untouched problem in the theory of inverse semigroups has been that of finding to what extent an inverse semigroup is determined by its lattice of inverse subsemigroups. In this paper we discover various properties preserved by lattice isomorphisms, and use these results to show that a free inverse semigroup ℱℐx is determined by its lattice of inverse subsemigroups, in the strong sense that every lattice isomorphism of ℱℐx upon an inverse semigroup T is induced by a unique isomorphism of ℱℐx upon T. (A similar result for free groups was proved by Sadovski (12) in 1941. An account of this may be found in Suzuki's monograph on the subject of subgroup lattices (14)).

scholarly journals A rank for right congruences on inverse semigroups

2007 ◽  
Vol 76 (1) ◽  
pp. 55-68 ◽  
Author(s):  
Victoria Gould
Keyword(s):  
Inverse Semigroup ◽  
Maximal Subgroup ◽  
Inverse Semigroups ◽  
The Other ◽  
Brandt Semigroup ◽  
Group Congruence ◽  
Existentially Closed ◽  
Bicyclic Monoid ◽  
A Chain ◽  
Lattice Of Congruences

The S-rank (where ‘S’ abbreviates ‘sandwich’) of a right congruence ρ on a semigroup S is the Cantor-Bendixson rank of ρ in the lattice of right congruences ℛ of S with respect to a topology we call the finite type topology. If every ρ ϵ ℛ possesses S-rank, then S is ranked. It is known that every right Noetherian semigroup is ranked and every ranked inverse semigroup is weakly right Noetherian. Moreover, if S is ranked, then so is every maximal subgroup of S. We show that a Brandt semigroup 0(G, I) is ranked if and only if G is ranked and I is finite.We establish a correspondence between the lattice of congruences on a chain E, and the lattice of right congruences contained within the least group congruence on any inverse semigroup S with semilattice of idempotents E(S) ≅ E. Consequently we argue that the (inverse) bicyclic monoid B is not ranked; moreover, a ranked semigroup cannot contain a bicyclic -class. On the other hand, B is weakly right Noetherian, and possesses trivial (hence ranked) subgroups.Our notion of rank arose from considering stability properties of the theory Ts of existentially closed (right) S-sets over a right coherent monoid S. The property of right coherence guarantees that the existentially closed S-sets form an axiomatisable class. We argue that B is right coherent. As a consequence, it follows from known results that TB is a theory of B-sets that is superstable but not totally transcendental.

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.

Sign in / Sign up

Export Citation Format

Share Document