Abstract
Various methods have been given for establishing the existence of the free inverse semigroup FIA on a set A, and for constructing it explicitly (see, for example, [2], [5], [7], [9], [10], [11]). In this paper we outline a graph-theoretic technique for representing the elements of FIA. This depends on the notion, introduced here, of a word-tree on A. With the aid of this technique various properties of FIA are easily deduced: some of these are stated below.
This is a preview of subscription content, log in via an institution to check access.
References
Clifford, A.H. and G.B. Preston,The algebraic theory of semigroups, Vol. I, Amer. Math. Soc. Surveys No. 7 (Providence, R.I., 1961).
Eberhart, C. and J. Selden,One parameter inverse semigroups (to appear).
Evans, T.,Finitely presented loops, lattices, etc.are hopfian, J. London Math. Soc. 44 (1969), 551–552.
Gluskin, L.M.,Elementary generalised groups, Mat. Sbornik 41 (83) (1957), 23–36. [Russian]
McAlister, D.B.,A homomorphism theorem for semigroups, J. London Math. Soc. 43 (1968), 355–366.
O'Carroll, L., Private communication (April, 1972).
Preston, G.B.,Free inverse semigroups (to appear).
Reilly, N.R.,Free generators in free inverse semigroups (to appear).
Scheiblich, H.E.,Free inverse semigroups (to appear).
Schein, B.M., Research problem #21, Semigroup Forum 3 (1971), 281.
Vagner, V.V.,Generalised heaps and generalised groups with a transitive compatibility relation, Učenye Zapiski Saratov. Gos. Univ., meh.-matem., 70 (1961), 25–39. [Russian]
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Munn, W.D. Free inverse semigroups. Semigroup Forum 5, 262–269 (1972). https://doi.org/10.1007/BF02572897
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02572897