Combinatorics of partial wreath power of finite inverse symmetric semigroup ISd
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...
Збережено в:
| Опубліковано в: : | Algebra and Discrete Mathematics |
|---|---|
| Дата: | 2007 |
| Автор: | |
| Формат: | Стаття |
| Мова: | Англійська |
| Опубліковано: |
Інститут прикладної математики і механіки НАН України
2007
|
| Онлайн доступ: | https://nasplib.isofts.kiev.ua/handle/123456789/157348 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Цитувати: | Combinatorics of partial wreath power of finite inverse symmetric semigroup ISd / Y. Kochubinska // Algebra and Discrete Mathematics. — 2007. — Vol. 6, № 1. — С. 49–60. — Бібліогр.: 4 назв. — англ. |
Репозитарії
Digital Library of Periodicals of National Academy of Sciences of Ukraine| _version_ | 1862657279972605952 |
|---|---|
| author | Kochubinska, Y. |
| author_facet | Kochubinska, Y. |
| citation_txt | Combinatorics of partial wreath power of finite inverse symmetric semigroup ISd / Y. Kochubinska // Algebra and Discrete Mathematics. — 2007. — Vol. 6, № 1. — С. 49–60. — Бібліогр.: 4 назв. — англ. |
| collection | DSpace DC |
| container_title | Algebra and Discrete Mathematics |
| description | 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Γ.
|
| first_indexed | 2025-12-02T06:20:01Z |
| format | Article |
| fulltext | |
| id | nasplib_isofts_kiev_ua-123456789-157348 |
| institution | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| issn | 1726-3255 |
| language | English |
| last_indexed | 2025-12-02T06:20:01Z |
| publishDate | 2007 |
| publisher | Інститут прикладної математики і механіки НАН України |
| record_format | dspace |
| spelling | Kochubinska, Y. 2019-06-20T02:43:32Z 2019-06-20T02:43:32Z 2007 Combinatorics of partial wreath power of finite inverse symmetric semigroup ISd / Y. Kochubinska // Algebra and Discrete Mathematics. — 2007. — Vol. 6, № 1. — С. 49–60. — Бібліогр.: 4 назв. — англ. 1726-3255 2000 Mathematics Subject Classification: 20M18, 20M20, 05C05. https://nasplib.isofts.kiev.ua/handle/123456789/157348 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Γ. en Інститут прикладної математики і механіки НАН України Algebra and Discrete Mathematics Combinatorics of partial wreath power of finite inverse symmetric semigroup ISd Article published earlier |
| spellingShingle | Combinatorics of partial wreath power of finite inverse symmetric semigroup ISd Kochubinska, Y. |
| title | Combinatorics of partial wreath power of finite inverse symmetric semigroup ISd |
| title_full | Combinatorics of partial wreath power of finite inverse symmetric semigroup ISd |
| title_fullStr | Combinatorics of partial wreath power of finite inverse symmetric semigroup ISd |
| title_full_unstemmed | Combinatorics of partial wreath power of finite inverse symmetric semigroup ISd |
| title_short | Combinatorics of partial wreath power of finite inverse symmetric semigroup ISd |
| title_sort | combinatorics of partial wreath power of finite inverse symmetric semigroup isd |
| url | https://nasplib.isofts.kiev.ua/handle/123456789/157348 |
| work_keys_str_mv | AT kochubinskay combinatoricsofpartialwreathpoweroffiniteinversesymmetricsemigroupisd |