Endomorphisms of functional graphs
Diskretnaya Matematika, Tome 18 (2006) no. 3, pp. 115-119
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
A functional graph is a digraph describing the action of a function on a set. The endomorphisms of such graphs are of interest in group theory: the centraliser of an element of the semigroup of all mappings of a set into itself coincides with the set of all endomorphisms of a digraph corresponding to this element. In this study, the functional graphs with a countable set of vertices are considered. We introduce the notion of lineals and calculate the cardinality of the set of endomorphisms of functional graphs which are not lineals.
[1] Varlet J. C., “Endomorphisms and fully invariant congruences in unary algebras $\langle A;\Gamma \rangle$”, Bull. Soc. Roy. Sci. Liege, 39:11–12 (1970), 575–589 | MR | Zbl
[2] Skornyakov L. A., “Gruppovye unary”, Vestnik MGU. Matem. Mekh., 1977, no. 5, 65–69
[3] Bochkin A. M., “Unary s separativnym monoidom endomorfizmov”, Izv. vuzov, ser. matem., 1983, no. 5, 71–74 | MR
[4] Kolmykov V. A., “O sootnoshenii kommutativnosti v simmetricheskoi polugruppe”, Sib. matem. zhurn., 45:5 (2004), 1130–1135 | MR | Zbl