The clone of operations preserving a cycle with loops (Q1013986)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5547247
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The clone of operations preserving a cycle with loops |
scientific article; zbMATH DE number 5547247 |
Statements
The clone of operations preserving a cycle with loops (English)
0 references
24 April 2009
0 references
The paper deals with clones that are polymorphism classes of all the binary relations on a \(k\)-element set consisting of a \(k\)-cycle and some loops (viewed as a directed graph). The main result states that if \(k\geq 3\) and the considered relation has at least two loops, then it is only preserved by essentially unary operations. In all other cases, the relations are preserved by operations that depend on a greater number of variables.
0 references
clone
0 references
permutation
0 references
essentially unary operation
0 references
collapsing monoid
0 references
0.8090354800224304
0 references
0.7820540070533752
0 references
0.7744119763374329
0 references
0.7733796238899231
0 references
