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.
| Original language | English |
|---|---|
| Pages (from-to) | 341-355 |
| Number of pages | 15 |
| Journal | Semigroup Forum |
| Volume | 69 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 1 Jan 2004 |
Fingerprint
Dive into the research topics of 'Inverse near permutation semigroups'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver