Abstract:
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.
Keywords:combinatorial inverse semigroup, group congruence, Möbius function, Möbius category.
Fulltext:
PDF file (210 kB)