Collapsing inverse monoids

DOI10.1007/S00012-007-1998-0MaRDI QIDQ997115zbMATH OpenOpenAlexFDO

Authors Miklós Dormán

Publication date 20 July 2007

Published in Algebra Universalis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00012-007-1998-0

zbMATH Keywords

clone of operationscollapsing monoidinverse monoidtransformation monoid

Mathematics Subject Classification ID

Operations and polynomials in algebraic structures, primal algebras (08A40) Inverse semigroups (20M18) Semigroups of transformations, relations, partitions, etc. (20M20)

Review text

The author defines an inverse submonoid \(\text{IS}(L)\) of the semigroup of all transformations of the underlying set \(L\) of a finite lattice \textbf{L}, and gives a necessary and sufficient condition for such a transformation monoid to be collapsing in the sense that there is exactly one clone on \(L\) whose unary part is exactly \(\text{IS}(L)\). The definition of \(\text{IS}(L)\) is too technical to be reproduced here.

Recommendations

• Collapsing permutation groups.
• scientific article; zbMATH DE number 2162135
• Collapsing monoids consisting of permutations and constants
• scientific article; zbMATH DE number 19611
• Transformation monoids with finite monoidal intervals

Cited in

(4)

• Binary operations suffice to test collapsing of monoidal intervals
• Monoidal intervals on three- and four-element sets
• scientific article; zbMATH DE number 2162135 (Why is no real title available?)
• Transformation monoids with finite monoidal intervals

This page was built for publication: Collapsing inverse monoids

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