Automorphisms and semi-automorphisms of relational systems
For every set X and every \(R\subseteq 2^{X^ 2}\) define \(Aut(X,R):=\{f\in Sym X|\) for all x,y\(\in X\) and \(r\in R\) we have that (x,y)\(\in r\) is equivalent to (f(x),f(y))\(\in r\}\) and \(Saut(X,R):=\{f\in Sym X|\) there exists some \(g\in Sym R\) such that for all x,y\(\in X\) and \(r\in R\) we have that (x,y)\(\in r\) is equivalent to (f(x),f(y))\(\in g(r)\}\). It is proved that for a given group G and a given normal subgroup N of G there exists some set X, some set R of partial ordering relations on X and some isomorphism from G to (Saut(X,R),\(\circ)\) which maps N onto Aut(X,R). It is shown that this result remains valid if one replaces partial ordering relations by equivalence relations.
- A note on piecewise automorphism groups of relational systems
- Transitive extensions of imprimitive groups
- scientific article; zbMATH DE number 4163158 (Why is no real title available?)
- AUTOMORPHISM GROUPS OF SYSTEMS OF EQUIVALENCE AND PARTIAL ORDER RELATIONS
- scientific article; zbMATH DE number 1396671 (Why is no real title available?)
- Relating De Morgan triples with Atanassov's intuitionistic De Morgan triples via automorphisms
- Relational systems with trivial endomorphisms and polymorphisms
This page was built for publication: Automorphisms and semi-automorphisms of relational systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q807655)
