Combinatorially factorizable inverse monoids

DOI10.1007/PL00006005MaRDI QIDQ1300597zbMATH OpenOpenAlexFDO

Authors Janet E. Mills

Publication date 21 February 2000

Published in Semigroup Forum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/pl00006005

zbMATH Keywords

Clifford semigroupscombinatorial semigroupsfactorizable semigroupsidempotent-separating extensionsinverse semigroups

Mathematics Subject Classification ID

Inverse semigroups (20M18)

Review text

An inverse semigroup \(S\) is combinatorially factorizable if there exist a combinatorial inverse subsemigroup \(T\) of \(S\) and a group \(G\) such that \(S=TG\). Combinatorially factorizable semigroups which are cryptic are investigated. Such semigroups are shown to be precisely the idempotent-separating extensions (of a certain kind) of factorizable Clifford semigroups by combinatorially inverse semigroups. Moreover, all combinatorially factorizable submonoids of a cryptic inverse monoid are constructed.

Recommendations

• Combinatorially factorizable cryptic inverse semigroups.
• Combinatorially factorizable restriction monoids
• Factorizable Inverse Monoids of Cosets of Subgroups of a Group
• Factorizable inverse monoids.
• Presentations of factorizable inverse monoids.

Cited in

(8)

• A characterization of seminormal C-monoids
• Combinatorially factorizable restriction monoids
• Combinatorially factorizable cryptic inverse semigroups.
• EMBEDDINGS IN COSET MONOIDS
• Characterizing pure, cryptic and Clifford inverse semigroups.
• Presentations of factorizable inverse monoids.
• Factorizable Inverse Monoids of Cosets of Subgroups of a Group
• Factorizable inverse monoids.

This page was built for publication: Combinatorially factorizable inverse monoids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1300597)