General algebraic systems Clones and operations Concept
Polymorphism of a relation
Summary
An operation is a polymorphism of a relation when applying coordinatewise to tuples of always gives a tuple of . One also says that preserves , or that is invariant under . The polymorphisms of a set of relations form a clone, and this links operations to relations through a Galois connection. Polymorphisms are the main tool of the algebraic approach to constraint satisfaction problems.
Where this leads
4 pages build on this one.
Further reading
About this page
| Tag | A0K9EZRM7E |
|---|---|
| URI | m2://A0K9EZRM7E |
| Kind | concept |
| Writing | W0 stub |
| MSC | 08A40, 08A02 |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
Used by
- Algebraic approach to constraint satisfaction
- Pol–Inv Galois connection
- Rosenberg's classification of maximal clones
- CSP dichotomy theorem