Available in electronic format
Available in print format
Transactions of the American Mathematical Society
Transactions of the American Mathematical Society
ISSN 1088-6850(e) ISSN 0002-9947(p)
     

Generators and relations of direct products of semigroups

Author(s): E. F. Robertson; N. Ruskuc; J. Wiegold
Journal: Trans. Amer. Math. Soc. 350 (1998), 2665-2685.
MSC (1991): Primary 20M05
Retrieve article in: PDF
This article is available free of charge

Abstract | References | Similar articles | Additional information

Abstract: The purpose of this paper is to give necessary and sufficient conditions for the direct product of two semigroups to be finitely generated, and also for the direct product to be finitely presented. As a consequence we construct a semigroup $S$ of order 11 such that $S\times T$ is finitely generated but not finitely presented for every finitely generated infinite semigroup $T$. By way of contrast we show that, if $S$ and $T$ belong to a wide class of semigroups, then $S\times T$ is finitely presented if and only if both $S$ and $T$ are finitely presented, exactly as in the case of groups and monoids.


References:

1.
C.M. Campbell, E.F. Robertson, N. Ruskuc and R.M. Thomas, Reidemeister-Schreier type rewriting for semigroups, Semigroup Forum 51 (1995), 47-62. MR 96f:20094

2.
C.M. Campbell, E.F. Robertson, N. Ruskuc and R.M. Thomas, On subsemigroups of finitely presented semigroups, J. Algebra 180 (1996), 1-21. CMP 96:08

3.
C.M. Campbell, E.F. Robertson, N. Ruskuc and R.M. Thomas, Presentations for subsemigroups-applications to ideals of semigroups, J. Pure Appl. Algebra, to appear.

4.
C.M. Campbell, E.F. Robertson, N. Ruskuc and R.M. Thomas, On subsemigroups and ideals in free products of semigroups, Internat. J. Algebra Comput. 6 (1996), 571-591. MR 97g:20072

5.
K. Corradi and S. Szabo, A new proof of Redei's theorem, Pacific J. Math. 140 (1989), 53-61. MR 90i:20056

6.
P.A. Grillet, A short proof of Redei's theorem, Semigroup Forum 46 (1993), 126-127. CMP 93:04

7.
P. Hall, The eulerian functions of a group, Quart. J. Math. 7 (1936), 134-151.

8.
P.M. Higgins, Techniques of Semigroup Theory, Oxford University Press, Oxford, 1992. MR 93d:20101

9.
J.M. Howie, Fundamentals of Semigroup Theory, Clarendon Press, Oxford, 1995.

10.
J.M. Howie and N. Ruskuc, Constructions and presentations for monoids, Comm. Algebra 22 (1994), 6209-6224. MR 95k:20092

11.
A. Jura, Coset enumeration in a finitely presented semigroup, Canad. Math. Bull. 21 (1978), 37-46. MR 58:5994

12.
A. Jura, Determining ideals of a given finite index in a finitely presented semigroup, Demonstratio Math. 11 (1978), 813-827. MR 80d:20057

13.
A. Jura, Some remarks on non-existence of an algorithm for finding all ideals of a given index in a finitely presented semigroup, Demonstratio Math. 13 (1980), 573-578. MR 82f:20083

14.
W. Magnus, A. Karrass and D. Solitar, Combinatorial Group Theory, Interscience Publishers, New York, 1966. MR 34:7617

15.
B.H. Neumann, Some remarks on semigroup presentations, Canad. J. Math. 19 (1967), 1018-1026; 20 (1968), 511. MR 36:2677,5703

16.
S.J. Pride, Geometric methods in combinatorial semigroup theory, Semigroups, Formal Languages and Groups, J. Fountain (ed.), Kluwer, Dordrecht, 1995, pp. 215-232.

17.
L. Rédei, The Theory of Finitely Generated Commutative Semigroups, Pergamon Press, Oxford, 1965. MR 32:5761

18.
E.F. Robertson and Y. Ünlü, On semigroup presentations, Proc. Edinburgh Math. Soc. 36 (1993), 55-68. MR 94a:20100

19.
N. Ruskuc, Matrix semigroups-generators and relations, Semigroup Forum 51 (1995), 319-333. MR 96k:20119

20.
N. Ruskuc, Semigroup Presentations, Ph.D. Thesis, University of St Andrews, St Andrews, Scotland, 1995.

21.
N. Ruskuc, On large subsemigroups and finiteness conditions of semigroups, Proc. London Math. Soc., to appear.

22.
N. Ruskuc and R.M. Thomas, Syntactic and Rees indices of subsemigroups, submitted.

23.
C.C. Sims, Computation With Finitely Presented Groups, Cambridge University Press, Cambridge, 1994. MR 95f:20053

24.
J.A. Todd and H.S.M. Coxeter, A practical method for enumerating the cosets of a finite abstract group, Proc. Edinburgh Math. Soc. 5 (1936), 26-34.

25.
T.G. Walker, Semigroup Enumeration - Computer Implementation and Applications,
Ph.D. Thesis, University of St Andrews, St Andrews, Scotland, 1992.

26.
J. Wiegold, Growth sequences of finite groups III, J. Austral. Math. Soc. 25 A (1978), 142-144. MR 80c:20028


Similar Articles:

Retrieve articles in Transactions of the American Mathematical Society with MSC (1991): 20M05

Retrieve articles in all Journals with MSC (1991): 20M05


Additional Information:

E. F. Robertson
Affiliation: Mathematical Institute, University of St Andrews, St Andrews KY16 9SS, Scotland
Email: efr@st-and.ac.uk

N. Ruskuc
Affiliation: Mathematical Institute, University of St Andrews, St Andrews KY16 9SS, Scotland
Email: nr1@st-and.ac.uk

J. Wiegold
Affiliation: School of Mathematics, University of Wales, College of Cardiff, Senghenydd Road, Cardiff, CF2 4AG, Wales
Email: SMAJW@cardiff.ac.uk

DOI: 10.1090/S0002-9947-98-02074-1
PII: S 0002-9947(98)02074-1
Received by editor(s): September 24, 1996
Copyright of article: Copyright 1998, American Mathematical Society


  AMS Website Logo Small Comments: webmaster@ams.org
© Copyright 2009, American Mathematical Society
Privacy Statement
Search the AMSPowered by Google