Direct products of finite monogenic inverse semigroups

1982 ◽  
Vol 92 (3-4) ◽  
pp. 301-317 ◽  
Author(s):  
D. C. Trueman
Keyword(s):  
Inverse Semigroup ◽  
Direct Product ◽  
Finite Semigroup ◽  
Inverse Semigroups ◽  
Direct Products

SynopsisWe characterize direct products of finite monogenic inverse semigroups; we show that a finite monogenic inverse semigroup which is not a group is directly indecomposable and that a finite semigroup which is decomposable into a direct product of monogenic inverse semigroups which are not groups is uniquely so decomposable. We determine when a finite semigroup can be decomposed into a direct product of non-group monogenic inverse semigroups and show how the direct factors, if they exist, can be found.

scholarly journals Semigroups whose idempotents form a subsemigroup

1990 ◽  
Vol 41 (2) ◽  
pp. 161-184 ◽  
Author(s):  
Jean-Camille Birget ◽  
Stuart Margolis ◽  
John Rhodes
Keyword(s):  
Inverse Semigroup ◽  
Finite Semigroup ◽  
Orthodox Semigroup ◽  
Inverse Semigroups ◽  
Type Ii ◽  
Finite Semigroups ◽  
Case Type ◽  
Orthodox Semigroups

We prove that if the “type-II-construct” subsemigroup of a finite semigroup S is regular, then the “type-II” subsemigroup of S is computable (actually in this case, type-II and type-II-construct are equal). This, together with certain older results about pseudo-varieties of finite semigroups, leads to further results:(1) We get a new proof of Ash's theorem: If the idempotents in a finite semigroup S commute, then S divides a finite inverse semigroup. Equivalently: The pseudo-variety generated by the finite inverse semigroups consists of those finite semigroups whose idempotents commute.(2) We prove: If the idempotents of a finite semigroup S form a subsemigroup then S divides a finite orthodox semigroup. Equivalently: The pseudo-variety generated by the finite orthodox semigroups consists of those finite semigroups whose idempotents form a subsemigroup.(3) We prove: The union of all the subgroups of a semigroup S forms a subsemigroup if and only if 5 belongs to the pseudo-variety u * G if and only if Sn belongs to u. Here u denotes the pseudo-variety of finite semigroups which are unions of groups.For these three classes of semigroups, type-II is equal to type-II construct.

A description of E-unitary inverse semigroups

1983 ◽  
Vol 95 (3-4) ◽  
pp. 239-242 ◽  
Author(s):  
Ross Wilkinson
Keyword(s):  
Inverse Semigroup ◽  
Direct Product ◽  
Inverse Semigroups ◽  
Maximal Group ◽  
Morphic Image ◽  
New Interpretation

SynopsisAn E-unitary inverse semigroup, S, has the property that, if x=S, and e2 = e=S, then (xe)2 = xe implies that x2 = x. As a consequence of this, we can see that S is an extension of its semilattice of idempotents, E, by its maximal group morphic image, G. Thus, following McAlister (1974), we attempt to describe S in terms of E and G. If we extend the semilattice E to a larger semilattice F, we are able to describe S in terms of a semi-direct product of F and G, giving a new interpretation to the approach of Schein (1975).

Finite direct products of finite cyclic semigroups and their characterization

1980 ◽  
Vol 85 (3-4) ◽  
pp. 337-351 ◽  
Author(s):  
D. C. Trueman
Keyword(s):  
Direct Product ◽  
Finite Semigroup ◽  
Direct Products

SynopsisWe prove that a finite semigroup which is decomposable into a direct product of cyclic semigroups which are not groups is uniquely so decomposable, and show how the non-group cyclic direct factors of a finite semigroup, if they exist, can be found.

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 ON THE NUMBER OF SUBSEMIGROUPS OF DIRECT PRODUCTS INVOLVING THE FREE MONOGENIC SEMIGROUP

2019 ◽  
Vol 109 (1) ◽  
pp. 24-35
Author(s):  
ASHLEY CLAYTON ◽  
NIK RUŠKUC
Keyword(s):  
Direct Product ◽  
Finite Semigroup ◽  
Identity Element ◽  
Direct Products ◽  
Monogenic Semigroup ◽  
Subdirect Products

The direct product $\mathbb{N}\times \mathbb{N}$ of two free monogenic semigroups contains uncountably many pairwise nonisomorphic subdirect products. Furthermore, the following hold for $\mathbb{N}\times S$, where $S$ is a finite semigroup. It contains only countably many pairwise nonisomorphic subsemigroups if and only if $S$ is a union of groups. And it contains only countably many pairwise nonisomorphic subdirect products if and only if every element of $S$ has a relative left or right identity element.

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 ON NEAR-RING IDEMPOTENTS AND POLYNOMIALS ON DIRECT PRODUCTS OF Ω-GROUPS

2001 ◽  
Vol 44 (2) ◽  
pp. 379-388 ◽  
Author(s):  
Erhard Aichinger
Keyword(s):  
Direct Product ◽  
Subject Classification ◽  
Idempotent Element ◽  
Direct Products ◽  
Primary 16Y30 ◽  
Secondary 08A40

AbstractLet $N$ be a zero-symmetric near-ring with identity, and let $\sGa$ be a faithful tame $N$-group. We characterize those ideals of $\sGa$ that are the range of some idempotent element of $N$. Using these idempotents, we show that the polynomials on the direct product of the finite $\sOm$-groups $V_1,V_2,\dots,V_n$ can be studied componentwise if and only if $\prod_{i=1}^nV_i$ has no skew congruences.AMS 2000 Mathematics subject classification: Primary 16Y30. Secondary 08A40

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

Sign in / Sign up

Export Citation Format

Share Document