Generators and ranks in finite partial transformation semigroups

dc.contributor.author	Garba, G.U.
dc.contributor.author	Imam, A.T.
dc.date.accessioned	2020-01-14T10:17:19Z
dc.date.available	2020-01-14T10:17:19Z
dc.date.issued	2017
dc.identifier.uri	http://hdl.handle.net/123456789/4648
dc.description	Garba G.U. Generators and ranks in finite partial transformation semigroups / G. U.Garba, A.T.Imam // Algebra and Discrete Mathematics. - 2017. - Vol. 23. - Number 2. - Рp. 237 - 248	uk_UA
dc.description.abstract	We extend the concept of path-cycles, defined in [2], to the semigroup Pn, of all partial maps on Xn = {1, 2, . . . , n}, and show that the classical decomposition of permutations into disjoint cycles can be extended to elements of Pn by means of path- cycles. The device is used to obtain information about generating sets for the semigroup Pn \ Sn, of all singular partial maps of Xn. Moreover, by analogy with [3], we give a definition for the (m, r)-rank of Pn \ Sn and show that it is n(n+1) 2.	uk_UA
dc.language.iso	other	uk_UA
dc.relation.ispartofseries	Математичні науки;
dc.subject	path-cycle	uk_UA
dc.subject	(m, r)-path-cycle	uk_UA
dc.subject	m-path	uk_UA
dc.subject	generating set	uk_UA
dc.subject	(m, r)-rank.	uk_UA
dc.title	Generators and ranks in finite partial transformation semigroups	uk_UA
dc.type	Article	uk_UA