Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-17T01:33:00.599Z Has data issue: false hasContentIssue false

Digraphs and the semigroup of all functions on a finite set

Published online by Cambridge University Press:  18 May 2009

Peter M. Higgins
Affiliation:
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.

Let Tn denote the full transformation semigroup on the finite set = {1, 2, … n}, that is the set of all mappings from to , with function composition as the semigroup operation. In this paper algorithms are introduced to solve equations such as axmb = c and ax = xb (a, b, c ∊ Tn), which employ a representation of members of Tn as special directed graphs.

Information

Type
Research Article
Copyright
Copyright © Glasgow Mathematical Journal Trust 1988