The semigroup of weak endomorphisms of a partial equivalence relation
Let \(X\) be an arbitrary non-empty set, let \(\mathcal{T}(X)\) denote the semigroup of all transformations on \(X\) and let \(\rho \subseteq X \times X\). A transformation \(f \in \mathcal{T}(X)\) is called an endomorphism (a weak endomorphism) of the relation \(\rho\) if \((x,y) \in \rho\) implies that \((xf,yf) \in \rho\) (\(xf = yf\) or \((xf,yf) \in \rho\)) for any \(x, y \in X\). The set of all endomorphisms (weak endomorphisms) of the binary relation \(\rho\) with respect to the operation of composition of transformations forms a semigroup denoted by \(\mathrm{End}(X,\rho)\) (\(\mathrm{WEnd}(X,\rho)\)). It is clear that \(\mathrm{End}(X,\rho) \subseteq \mathrm{WEnd}(X,\rho)\). An ordered pair \((\varphi,\psi)\) of transformations \(\varphi\) and \(\psi\) of the set \(X\) is called an endotopism (a weak endotopism) of the relation \(\rho\) if \((x,y) \in \rho\) implies that \((x\varphi,y\psi) \in \rho\) (\(x\varphi = y\psi\) or \((x\varphi,y\psi) \in \rho\)) for any \(x, y \in X\). The set of all endotopisms (weak endotopisms) of the binary relation \(\rho\) with respect to the componentwise multiplication forms a semigroup denoted by \(\mathrm{Et}(X,\rho)\) (\(\mathrm{WEt}(X,\rho)\)). It is clear that \(\mathrm{Et}(X,\rho) \subseteq \mathrm{WEt}(X,\rho)\).\N\NIn the paper under review, the authors study the weak endomorphism semigroup of a partial equivalence relation and describe necessary and sufficient conditions for the existence of these endomorphisms and weak endomorphisms. They describe weak endomorphisms of partial equivalences and show that the description of semigroups of these weak endomorphisms is reduced to an weak endomorphism equivalence semigroup. The authors also present a formula for finding the number of all weak endomorphisms of a strict partial equivalence relation. For a strict partial equivalence, they analyze the semigroups of weak idempotent endomorphisms and describe regular and coregular semigroups of weak endomorphisms. Finally, they show that a weak endomorphism semigroup of a strict partial equivalence relation is faithfully represented in the form of the wreath product of a transformation semigroup with low category.
- A formula for the number of weak endomorphisms on paths
- An algorithm for the numbers of endomorphisms on paths (DM13208)
- AUTOMORPHISMS OF ENDOMORPHISM MONOIDS OF RELATIVELY FREE BANDS
- Correspondences of the semigroup of endomorphisms of an equivalence relation.
- Endomorphism semigroups of 2-nilpotent binary relations.
- Endomorphism spectra of graphs
- Endomorphisms of finite symmetric inverse semigroups
- Endomorphisms of graphs. I: The monoid of strong endomorphisms
- Endomorphisms of semigroups of oriented transformations
- Endotypes of equivalence relations.
- Endotypes of partial equivalence relations
- scientific article; zbMATH DE number 3706718 (Why is no real title available?)
- scientific article; zbMATH DE number 3411328 (Why is no real title available?)
- Locally strong endomorphisms of paths
- Menger algebras of multiplace functions
- Monoids, acts and categories. With applications to wreath products and graphs. A handbook for students and researchers
- On orthodox semigroups and uniform and antiuniform bands
- Representations of the strong endomorphism monoid of finite \(n\)-uniform hypergraphs
- Semigroups of strong endomorphisms of infinite graphs and hypergraphs.
- The endotopism semigroups of a partial equivalence relation
- The endotopism semigroups of an equivalence relation.
- The endotopism spectrum of an equivalence
- The monoid of endomorphisms of disconnected hypergraphs.
- The semigroup of endomorphisms of a linear manifold
- The structure of isomorphisms of universal hypergraphical automata
This page was built for publication: The semigroup of weak endomorphisms of a partial equivalence relation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6931752)
