A characterization of a free elementary inverse semigroup

In a previous paper ([14]) the author showed that a free inverse semigroup is determined by its lattice of inverse subsemigroups, in the sense that for any inverse semigroup T, implies . (In fact, the lattice isomorphism is induced by an isomorphism of upon T.) In this paper the results leading up to that theorem are generalized (from completely semisimple to arbitrary inverse semigroups) and applied to various classes, including simple, fundamental and E-unitary inverse semigroups. In particular it is shown that the free product of two groups in the category of inverse semigroups is determined by its lattice of inverse subsemigroups.

On a Class of Lattice Ordered Inverse Semigroups

E-unitary inverse monoids and the Cayley graph of a group presentation

On topological McAlister semigroups

A class of varieties of inverse semigroups

A universal algebra A is said to have the basis property (BP) if any two minimal generating sets (bases) for a subalgebra of A have the same cardinality. This property was studied by the author for inverse semigroups in [5, 6]. For instance free inverse semigroups have BP. When treated as universal algebras, a classical theorem of linear algebra states that vector spaces have BP. In this paper we study BP for semigroups.

Degree of Growth of Some Inverse Semigroups

The inverse semigroup TE of isomorphisms of principal ideals of E onto principal ideals of E, where E is a semilattice, has been introduced and studied by Munn (1966, 1970). He showed that, for any inverse semigroup S with semilattice E, there is a representation of S by an inverse subsemigroup of TE. The Munn representation, however, is not always faithful. In this paper, the possibility is considered of enlarging the carrier set E of the Munn representation in order to obtain a faithful representation of S as an inverse subsemigroup of a structure resembling TE in many ways. A structure X is obtained by replacing each element of E by a set. Then X = ∪{Xe: e ∈ E}, where Xe, denotes some set, has a natural pre-order relation ≤ (where x ≤ y if and only if x ∈ Xe, y ∈ Xf and e ≦ f ) inherited from E such that if T = {(x, y)∈X × X;x ≤ y and y ≤ x} then X/T is isomorphic to E. Such a set X is referred to as a pre-semilattice with semilattice E. If Tx denotes the set of all isomorphisms of principal ideals of X onto principal ideals of X then Tx is an inverse semigroup. Basic properties of Tx are considered. It is shown that when X is locally uniform, that is, when |Xe| = |Xf|, for all e, f ∈ E, Tx may be described as a wreath product of a permutation group with TE.The set s itself is a presemilattice with semilattice E with respect to the pre-order ≤ defined by a ≤ b if and only if a−1a ≦ b−1b. It is then shown that the Vagner-Preston representation embeds S as a full inverse subsemigroup of Ts. As an application of these concepts the following result is established. Let R and S be inverse semigroups and let θ1(θ2) be an isomorphism of a semilattice E onto the semilattice of R(S). Then there exists a locally uniform presemilattice W and embeddings ϕ1, ϕ2 of R and S, respectively, as full inverse subsemigroups of Tw such that (1) θ1ϕ1 = θ2ϕ2 and (2) (eθ1ϕ1, eθ2ϕ2) ∈ if and only if Ee is isomorphic to Ef.

SynopsisThe aim of this paper is to describe the free product of a pair G, H of groups in the category of inverse semigroups. Since any inverse semigroup generated by G and H is a homomorphic image of this semigroup, this paper can be regarded as asking how large a subcategory, of the category of inverse semigroups, is the category of groups? In this light, we show that every countable inverse semigroup is a homomorphic image of an inverse subsemigroup of the free product of two copies of the infinite cyclic group. A similar result can be obtained for arbitrary cardinalities. Hence, the category of inverse semigroups is generated, using algebraic constructions by the subcategory of groups.The main part of the paper is concerned with obtaining the structure of the free product G inv H, of two groups G, H in the category of inverse semigroups. It is shown in section 1 that G inv H is E-unitary; thus G inv H can be described in terms of its maximum group homomorphic image G gp H, the free product of G and H in the category of groups, and its semilattice of idempotents. The second section considers some properties of the semilattice of idempotents while the third applies these to obtain a representation of G inv H which is faithful except when one group is a non-trivial finite group and the other is trivial. This representation is used in section 4 to give a structure theorem for G inv H. In this section, too, the result described in the first paragraph is proved. The last section, section 5, consists of examples.

We introduce a preorder on an inverse semigroup S associated to any normal inverse subsemigroup N, that lies between the natural partial order and Green’s $${\mathcal {J}}$$ –relation. The corresponding equivalence relation $$\simeq _N$$ is not necessarily a congruence on S, but the quotient set does inherit a natural ordered groupoid structure. We show that this construction permits the factorisation of any inverse semigroup homomorphism into a composition of a quotient map and a star-injective functor, and that this decomposition implies a classification of congruences on S. We give an application to the congruence and certain normal inverse subsemigroups associate to an inverse monoid presentation.

We study some aspects of Schein’s theory of cosets for closed inverse subsemigroups of inverse semigroups. We establish an index formula for chains of subsemigroups, and an analogue of M. Hall’s Theorem on the number of cosets of a fixed finite index. We then investigate the relationships between the following properties of a closed inverse submonoid of an inverse monoid: having finite index; being a recognizable subset; being a rational subset; being finitely generated (as a closed inverse submonoid). A remarkable result of Margolis and Meakin shows that these properties are equivalent for a closed inverse submonoid of a free inverse monoid.

A new construction for free inverse semigroups

This note announces a characterization of the free inverse semigroup I on a non-empty set X.

A RANDOM RAMBLE THROUGH INVERSE SEMIGROUPS

We study automaton structures, i.e., groups, monoids and semigroups generated by an automaton, which, in this context, means a deterministic finite-state letter-to-letter transducer. Instead of considering only complete automata, we specifically investigate semigroups generated by partial automata. First, we show that the class of semigroups generated by partial automata coincides with the class of semigroups generated by complete automata if and only if the latter class is closed under removing a previously adjoined zero, which is an open problem in (complete) automaton semigroup theory stated by Cain. Then, we show that no semidirect product (and, thus, also no direct product) of an arbitrary semigroup with a (non-trivial) subsemigroup of the free monogenic semigroup is an automaton semigroup. Finally, we concentrate on inverse semigroups generated by invertible but partial automata, which we call automaton-inverse semigroups, and show that any inverse automaton semigroup can be generated by such an automaton (showing that automaton-inverse semigroups and inverse automaton semigroups coincide).