Collapsing monoids consisting of permutations and constants
From MaRDI portal
Let \(A\) be a finite set with \(| A| >1\), \(M\) a transformation monoid over \(A\) consisting of \(c\) constant functions and some permutations, and let \(i(M)\) denote the number of all clones over \(A\) having \(M\) as its set of unary members. For \(c\geq1\), all \(M\) with \(i(M)=1\) are determined. Moreover, it is shown that \(i(M)\) is infinite in case \(c=1\) and that there exist infinitely many \(M\) with \(c\geq3\) and \(i(M)=2\).
Recommendations
Cited in
(8)- Collapsing monoids containing permutations and constants
- Monoidal intervals on three- and four-element sets
- CLONES CLOSED UNDER CONJUGATION I: CLONES WITH CONSTANTS
- scientific article; zbMATH DE number 540507 (Why is no real title available?)
- scientific article; zbMATH DE number 2162135 (Why is no real title available?)
- Clones determined by alternating monoids
- Collapsing permutation groups.
- Collapsing inverse monoids
This page was built for publication: Collapsing monoids consisting of permutations and constants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998768)