A method of finding automorphism groups of endomorphism monoids of relational systems. (Q879337): Difference between revisions
From MaRDI portal
Latest revision as of 18:56, 25 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A method of finding automorphism groups of endomorphism monoids of relational systems. |
scientific article |
Statements
A method of finding automorphism groups of endomorphism monoids of relational systems. (English)
0 references
11 May 2007
0 references
Let \(\mathcal A\) be a mathematical structure and \(\text{End}(\mathcal A)\) denotes the semigroup of all endomorphisms of \(\mathcal A\). Describing the automorphism group of the monoid \(\text{End}(\mathcal A)\) is a known algebraic problem. The purpose of the paper under review is to describe the group \(\Aut\,\text{End}(\mathcal A)\) for the case when \(\mathcal A\) is a relational system \((A,\rho)\), where \(\rho\) is an \(n\)-ary relation on the set \(A\). Reviewer's remark: The authors mention that recently this ``problem of describing \(\Aut\,\text{End}(\mathcal A)\) has attracted an even wider attention for its links to universal algebraic topology'', but this topic developed by B. I. Plotkin is called universal algebraic geometry.
0 references
automorphism groups
0 references
endomorphism monoids
0 references
transformation semigroups
0 references
reflexive relations
0 references
0 references
0 references