Abstract
A transformation semigroup over a set X with N elements is said to be a near permutation semigroup if it is generated by a group G of permutations on N elements and by a set H of transformations of rank N - 1. In this paper we give necessary and sufficient conditions for a near permutation semigroup S = ‹G,H›, where H is a group, to be inverse. Moreover, we obtain conditions which guarantee that its semilattice of idempotents is generated by the idempotents of S of rank greater than N - 2 or N - 3.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
André, J. Inverse Near Permutation Semigroups. Semigroup Forum 69, 331–355 (2004). https://doi.org/10.1007/s00233-004-0122-4
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00233-004-0122-4