Inverse semigroups generated by group congruences. The Möbius functions
Vernadsky National Library of Ukraine
Переглянути архів ІнформаціяПоле | Співвідношення | |
Title |
Inverse semigroups generated by group congruences. The Möbius functions
|
|
Creator |
Schwab, E.D.
|
|
Description |
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.
|
|
Date |
2019-06-09T17:23:16Z
2019-06-09T17:23:16Z 2013 |
|
Type |
Article
|
|
Identifier |
Inverse semigroups generated by group congruences. The Möbius functions / E.D. Schwab // Algebra and Discrete Mathematics. — 2013. — Vol. 16, № 1. — С. 116–126. — Бібліогр.: 23 назв. — англ.
1726-3255 2010 MSC:20M18, 06A07. http://dspace.nbuv.gov.ua/handle/123456789/152314 |
|
Language |
en
|
|
Relation |
Algebra and Discrete Mathematics
|
|
Publisher |
Інститут прикладної математики і механіки НАН України
|
|