The clone of operations preserving a cycle with loops
- 24 Downloads
We consider all the binary relations on a k-element set which, when viewed as directed graphs, consist of a k-cycle and some loops. If k ≥ 3 and the relation has at least two loops, we show that it is only preserved by essentially unary operations. In all other cases, the relation is preserved by operations that depend on a greater number of variables.
Keywords and phrases:clone permutation essentially unary collapsing monoid
2000 Mathematics Subject Classification:08A40
Unable to display preview. Download preview PDF.