Inverse semigroups generated by group congruences. The Möbius functions
The computation of the Möbius function of a Möbius category that arises from a combinatorial inverse semigroup has a distinctive feature. This computation is done on the field of finite posets. In the case of two combinatorial inverse semigroups, order isomorphisms between corresponding finite poset...
Збережено в:
| Видавець: | Інститут прикладної математики і механіки НАН України |
|---|---|
| Дата: | 2013 |
| Автор: | |
| Формат: | Стаття |
| Мова: | English |
| Опубліковано: |
Інститут прикладної математики і механіки НАН України
2013
|
| Назва видання: | Algebra and Discrete Mathematics |
| Онлайн доступ: | http://dspace.nbuv.gov.ua/handle/123456789/152314 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Цитувати: | Inverse semigroups generated by group congruences. The Möbius functions / E.D. Schwab // Algebra and Discrete Mathematics. — 2013. — Vol. 16, № 1. — С. 116–126. — Бібліогр.: 23 назв. — англ. |
Репозиторії
Digital Library of Periodicals of National Academy of Sciences of Ukraine| Резюме: | The computation of the Möbius function of a Möbius category that arises from a combinatorial inverse semigroup has a distinctive feature. This computation is done on the field of finite posets. In the case of two combinatorial inverse semigroups, order isomorphisms between corresponding finite posets reduce the computation to one of the semigroups. Starting with a combinatorial inverse monoid and using a group congruence we construct a combinatorial inverse semigroup such that the Möbius function becomes an invariant to this construction. For illustration, we consider the multiplicative analogue of the bicyclic semigroup and the free monogenic inverse monoid. |
|---|