Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-15T11:36:53.721Z Has data issue: false hasContentIssue false

Finite full transformation semigroups as collections of random functions

Published online by Cambridge University Press:  18 May 2009

B. Brown
Affiliation:
Department of Mathematics, University of Tasmania, Sandy Bay, Tasmania 7001, Australia.
P. M. Higgins
Affiliation:
Athematics Section, Deakin University, Victoria, 3217, Australia.
Rights & Permissions [Opens in a new window]

Extract

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.

The collection of all self-maps on a non-empty set X under composition is known in algebraic semigroup theory as the full transformation semigroup on X and is written x. Its importance lies in the fact that any semigroup S can be embedded in the full transformation semigroup (where S1 is the semigroup S with identity 1 adjoined, if S does not already possess one). The proof is similar to Cayley's Theorem that a group G can be embedded in SG, the group of all bijections of G to itself. In this paper X will be a finite set of order n, which we take to be and so we shall write Tn for X.

Information

Type
Research Article
Copyright
Copyright © Glasgow Mathematical Journal Trust 1988