Combinatorics of partial wreath power of finite inverse symmetric semigroup ISd

dc.contributor.author	Kochubinska, Y.
dc.date.accessioned	2019-06-20T02:43:32Z
dc.date.available	2019-06-20T02:43:32Z
dc.date.issued	2007
dc.identifier.citation	Combinatorics of partial wreath power of finite inverse symmetric semigroup ISd / Y. Kochubinska // Algebra and Discrete Mathematics. — 2007. — Vol. 6, № 1. — С. 49–60. — Бібліогр.: 4 назв. — англ.	uk_UA
dc.identifier.issn	1726-3255
dc.identifier.other	2000 Mathematics Subject Classification: 20M18, 20M20, 05C05.
dc.identifier.uri	http://dspace.nbuv.gov.ua/handle/123456789/157348
dc.description.abstract	We study some combinatorial properties of ≀ k pISd. In particular, we calculate its order, the number of idempotents and the number of D-classes. For a given based graph Γ ⊂ T we compute the number of elements in its D-class DΓ and the number of R- and L-classes in DΓ.	uk_UA
dc.language.iso	en	uk_UA
dc.publisher	Інститут прикладної математики і механіки НАН України	uk_UA
dc.relation.ispartof	Algebra and Discrete Mathematics
dc.title	Combinatorics of partial wreath power of finite inverse symmetric semigroup ISd	uk_UA
dc.type	Article	uk_UA
dc.status	published earlier	uk_UA