Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T18:37:55.859Z Has data issue: false hasContentIssue false

EMBEDDINGS IN COSET MONOIDS

Part of:Semigroups

Published online by Cambridge University Press:  01 August 2008

JAMES EAST*
Affiliation:
School of Mathematics and Statistics, Carslaw Building F07, University of Sydney, New South Wales 2006, Australia (email: jamese@maths.usyd.edu.au)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

A submonoid S of a monoid M is said to be cofull if it contains the group of units of M. We extract from the work of Easdown, East and FitzGerald (2002) a sufficient condition for a monoid to embed as a cofull submonoid of the coset monoid of its group of units, and show further that this condition is necessary. This yields a simple description of the class of finite monoids which embed in the coset monoids of their group of units. We apply our results to give a simple proof of the result of McAlister [D. B. McAlister, ‘Embedding inverse semigroups in coset semigroups’, Semigroup Forum20 (1980), 255–267] which states that the symmetric inverse semigroup on a finite set X does not embed in the coset monoid of the symmetric group on X. We also explore examples, which are necessarily infinite, of embeddings whose images are not cofull.

Information

Type
Research Article
Copyright
Copyright © 2008 Australian Mathematical Society