On nilpotent subsemigroups of a finite symmetrical inverse semigroup

1994 ◽  
Vol 56 (3) ◽  
pp. 896-899
Author(s):  
A. G. Ganyushkin ◽  
T. V. Kormysheva
Keyword(s):  
Inverse Semigroup ◽  
Nilpotent Subsemigroups

Spectra in Some Inverse Semigroup Algebras

2004 ◽  
Vol 104 (2) ◽  
pp. 211-218 ◽  
Author(s):  
M. J. Crabb ◽  
J. Duncan ◽  
C. M. McGregor
Keyword(s):  
Inverse Semigroup ◽  
Semigroup Algebras

scholarly journals Simplicity of inverse semigroup and étale groupoid algebras

2021 ◽  
Vol 380 ◽  
pp. 107611
Author(s):  
Benjamin Steinberg ◽  
Nóra Szakács
Keyword(s):  
Inverse Semigroup ◽  
Étale Groupoid

XII.—The Lattice of Congruences on a Bisimple ω-Semigroup

1967 ◽  
Vol 67 (3) ◽  
pp. 175-184
Author(s):  
W. D. Munn
Keyword(s):  
Inverse Semigroup ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Natural Numbers ◽  
Necessary And Sufficient ◽  
Lattice Of Congruences

SynopsisA necessary and sufficient condition is determined for the modularity of the lattice of congruences on a bisimple inverse semigroup whose semilattice of idempotents is order-anti-isomorphic to the set of natural numbers.

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.

scholarly journals FACTORIZATION THEOREMS FOR MORPHISMS OF ORDERED GROUPOIDS AND INVERSE SEMIGROUPS

2001 ◽  
Vol 44 (3) ◽  
pp. 549-569 ◽  
Author(s):  
Benjamin Steinberg
Keyword(s):  
Inverse Semigroup ◽  
Regular Semigroup ◽  
Classical Theory ◽  
Derived Category ◽  
Inverse Semigroups ◽  
Subject Classification

AbstractAdapting the theory of the derived category to ordered groupoids, we prove that every ordered functor (and thus every inverse and regular semigroup homomorphism) factors as an enlargement followed by an ordered fibration. As an application, we obtain Lawson’s version of Ehresmann’s Maximum Enlargement Theorem, from which can be deduced the classical theory of idempotent-pure inverse semigroup homomorphisms and $E$-unitary inverse semigroups.AMS 2000 Mathematics subject classification: Primary 20M18; 20L05; 20M17

scholarly journals FREE ADEQUATE SEMIGROUPS

2011 ◽  
Vol 91 (3) ◽  
pp. 365-390 ◽  
Author(s):  
MARK KAMBITES
Keyword(s):  
Inverse Semigroup ◽  
Word Problem ◽  
Explicit Description ◽  
Finitely Generated ◽  
Free Objects ◽  
Ample Semigroup ◽  
Free Inverse Semigroup ◽  
Adequate Semigroup

AbstractWe give an explicit description of the free objects in the quasivariety of adequate semigroups, as sets of labelled directed trees under a natural combinatorial multiplication. The morphisms of the free adequate semigroup onto the free ample semigroup and into the free inverse semigroup are realised by a combinatorial ‘folding’ operation which transforms our trees into Munn trees. We use these results to show that free adequate semigroups and monoids are 𝒥-trivial and never finitely generated as semigroups, and that those which are finitely generated as (2,1,1)-algebras have decidable word problem.

Sign in / Sign up

Export Citation Format

Share Document