Collapsing monoids containing permutations and constants
In 1941, E.\,Post presented a complete description of the countably many clones on a two-element set. For \(| A| \geq 3\) the structure of the lattice of all clones on \(A\) is known to be very complex, the lattice is of a cardinality \(2^{{\aleph }_0}\). One approach is to study the monoidal intervals: for a given transformation monoid \(M\) of unary operations on \(A\) (\(M\) contains the identity selfmap and is closed under composition), the set \(\text{Int}(M)\) of clones \(C\) on \(A\) with \(C^{(1)}=M\) forms an interval in the lattice of clones on \(A\), a so-called monoidal interval. It is a surprising fact that for certain monoids \(M\), called collapsing, this interval contains only one element. The authors present some collapsing monoids containing only constants and permutations.
- Binary operations suffice to test collapsing of monoidal intervals
- Monoidal intervals on three- and four-element sets
- scientific article; zbMATH DE number 540507 (Why is no real title available?)
- scientific article; zbMATH DE number 2162135 (Why is no real title available?)
- The monoidal interval for the monoid generated by two constants
- Collapsing monoids consisting of permutations and constants
This page was built for publication: Collapsing monoids containing permutations and constants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2496165)
