combinatorial inverse semigroup
Recently Published Documents


TOTAL DOCUMENTS

3
(FIVE YEARS 0)

H-INDEX

2
(FIVE YEARS 0)

2002 ◽  
Vol 132 (6) ◽  
pp. 1373-1394 ◽  
Author(s):  
Jiří Kad'ourek

A finite combinatorial inverse semigroup Θ of moderate size is presented such that the variety of combinatorial inverse semigroups generated by Θ possesses the following properties. The lattice of all subvarieties of this variety has the cardinality of the continuum. Moreover, this semigroup Θ, and hence also the variety it generates and its subvarieties, all have E-unitary covers over any non-trivial variety of groups. This indicates that the mentioned uncountable sublattice appears quite near the bottom of the lattice of all varieties of combinatorial inverse semigroups.


Author(s):  
Simon M. Goberstein

AbstractIt is shown that a so-called shortly connected combinatorial inverse semigroup is strongly lattice-determined “modulo semilattices”. One of the consequences of this theorem is the known fact that a simple inverse semigroup with modular lattice of full inverse subsemigroups is strongly lattice-determined [7]. The partial automorphism semigroup of an inverse semigroup S consists of all isomorphisms between inverse subsemigroups of S. It is proved that if S is a shortly connected combinatorial inverse semigroup, T an inverse semigroup and the partial automorphism semigroups of S and T are isomorphic, then either S and T are isomorphic or they are dually isomorphic chains (with respect to the natural partial order); moreover, any isomorphism between the partial automorphism semigroups of S and T is induced either by an isomorphism or, if S and T are dually isomorphic chains, by a dual isomorphism between S and T. Counter-examples are constructed to demonstrate that the assumptions about S being shortly connected and combinatorial are essential.


Sign in / Sign up

Export Citation Format

Share Document