Hostname: page-component-586b7cd67f-t7czq Total loading time: 0 Render date: 2024-12-03T18:11:37.447Z Has data issue: false hasContentIssue false

On diagonal acts of monoids

Published online by Cambridge University Press:  17 April 2009

E. F. Robertson
Affiliation:
Mathematical Institute, University of St Andrews, St Andrews KY16 9SS, Scotland, United Kingdom, e-mail: edmund@mcs.st-and.ac.uk, nik@mcs.st-and.ac.uk, robertt@mcs.st-and.ac.uk
N. Ruškuc
Affiliation:
Mathematical Institute, University of St Andrews, St Andrews KY16 9SS, Scotland, United Kingdom, e-mail: edmund@mcs.st-and.ac.uk, nik@mcs.st-and.ac.uk, robertt@mcs.st-and.ac.uk
M. R. Thomson
Affiliation:
Mathematical Institute, University of St Andrews, St Andrews KY16 9SS, Scotland, United Kingdom, e-mail: edmund@mcs.st-and.ac.uk, nik@mcs.st-and.ac.uk, robertt@mcs.st-and.ac.uk
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.

It is proved that the monoid RN of all partial recursive functions of one variable is finitely generated, and that RN × RNis a cyclic (left and right) RN-act (under the natural diagonal actions s (a, b) = (sa, sb), (a, b) s = (as, bs)). We also construct a finitely presented monoid S such that S × S is a cyclic left and right S-act, and study further interesting properties of diagonal acts and their relationship with power monoids.

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 2001

References

[1]Bulman-Fleming, S. and McDowell, K., Problem E3311, Amer. Math. Monthly 96 (1989), p. 155; Solution, Amer. Math. Monthly 97 (1990), p. 617.Google Scholar
[2]Cohen, D.E., Computability and logic (Ellis Horwood Ltd, Chichester, 1987).Google Scholar
[3]Grillet, P.A., Semigroups (Marcel Dekker, New York, 1995).Google Scholar