On large subsemigroups and finiteness conditions of semigroups

Proceedings of the London Mathematical Society

Volumn 76, Issue 2, 1998, Pages 383-405

  Ruskuc N ^a  

^a UNIVERSITY OF ST ANDREWS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001433415     PISSN: 00246115     EISSN: None     Source Type: Journal    
DOI: 10.1112/S0024611598000124     Document Type: Article

References (34)

1. G. BAUMSLAG, Topics in combinatorial group theory (Birkhäuser, Basel, 1993).
2. C. M. CAMPBELL, E. F. ROBERTSON, N. RUŠKUC, and R. M. THOMAS, 'Reidemeister-Schreier type rewriting for semigroups', Semigroup Forum 51 (1995) 47-62.
3. C. M. CAMPBELL, E. F. ROBERTSON, N. RUŠKUC, and R. M. THOMAS, 'Rewriting a semigroup presentation', Internat. J. Algebra Comput. 5 (1995) 81-103.
4. C. M. CAMPBELL, E. F. ROBERTSON, N. RUŠKUC, and R. M. THOMAS, 'On subsemigroups of finitely presented semigroups', J. Algebra 180 (1996) 1-21.
5. C. M. CAMPBELL, E. F. ROBERTSON, N. RUŠKUC, and R. M. THOMAS, 'On subsemigroups and ideals in free products of semigroups', Internat. J. Algebra Comput. 6 (1996) 571-591.
6. C. M. CAMPBELL, E. F. ROBERTSON, N. RUŠKUC, and R. M. THOMAS, 'Presentations for subsemigroups - applications to ideals of semigroups', J. Pure Appl. Algebra, to appear.
7. A. CLIFFORD, 'Semigroups containing minimal ideals', Amer. J. Math. 70 (1948) 521-526.
8. W. DICKS and J. DUNWOODY, Groups acting on graphs (Cambridge University Press. 1989).
9. A. DIETZE and M. SCHAPS, 'Determining subgroups of a given finite index in a finitely presented group', Canad. J. Math. 26 (1974) 769-782.
10. V. S. CUBA and S. J. PRIDE, 'On the left and right cohomological dimension of monoids', J. London Math. Soc. (2) to appear.
11. J. M. HOWIE. Fundamentals of semigroup theory (Clarendon Press, Oxford, 1995).
12. J. M. HOWIE and N. RUŠKUC, 'Constructions and presentations for monoids', Comm. Algebra 22 (1994) 6209-6224.
13. A. JURA, 'Coset enumeration in a finitely presented semigroup', Canad. Math. Bull. 21 (1978) 37-46.
14. A. JURA, 'Determining ideals of a given finite index in a finitely presented semigroup', Demonstratio Math. 11 (1978) 813-827.
15. A. JURA, 'Some remarks on non-existence of an algorithm for finding all ideals of a given finite index in a finitely presented semigroup', Demonstratio Math. 13 (1980) 573-578.
16. Y. KOBAYASHI, 'Complete rewriting systems and homology of monoid algebras', J. Pure Appl. Algebra 65 (1990) 263-275.
17. Y. LAFONT, 'A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier)', J. Pure Appl. Algebra 98 (1995) 229-244.
18. G. LALLEMENT, Semigroups and combinatorial applications (John Wiley, New York, 1979).
19. W. MAGNUS, A. KARRASS, and D. SOLITAR, Combinatorial group theory (Springer, Berlin, 1977).
20. A. MARKOV, 'The impossibility of certain algorithms in the theory of associative systems' (in Russian), Doklady Akad. Nauk SSSR 77 (1951) 19-20.
21. A. MARKOV, 'The impossibility of algorithms for the recognition of certain properties of associative systems' (in Russian), Doklady Akad. Nauk SSSR 77 (1951) 953-956.
22. J. NEUBÜSER, 'An elementary introduction to coset table methods in computational group theory', Croups - St Andrews 1981 (eds C. M. Campbell and E. F. Robertson, Cambridge University Press, 1982), pp. 1-45.
23. B. H. NEUMANN, 'Some remarks on semigroup presentations', Canad. J. Math. 19 (1967) 1018-1026.
24. S. J. PRIDE, 'Low-dimensional homotopy theory for monoids', Internat. J. Algebra Comput. 5 (1995) 631-649.
25. D. REES, 'On semi-groups', Proc. Cambridge Philos. Soc. 36 (1940) 387-400.
26. E. F. ROBERTSON and Y. ÜNLÜ, 'On semigroup presentations', Proc. Edinburgh Math. Soc. 36 (1993) 55-68.
27. J. S. ROSE, A course on group theory (Cambridge University Press, 1978).
28. N. RUŠKUC, 'Semigroup presentations', Ph.D. Thesis, University of St Andrews, 1995.
29. N. RÜKUC and R. M. THOMAS, 'Syntactic and Rees indices of a subsemigroup', preprint. University of St Andrews, 1996.
30. C. C. SIMS, Computation with finitely presented groups (Cambridge University Press, 1994).
31. C. C. SQUIER, 'Word problems and a homological finiteness condition for monoids', J. Pure Appl. Algebra 49 (1987) 201-217.
32. C. C. SQUIER, F. OTTO, and Y. KOBAYASHI, 'A finiteness condition for rewriting systems', Theoret. Comput. Sci. 131 (1994) 271-294.
33. J. A. TODD and H. S. M. COXETER, 'Apractical method for enumerating the cosets of a finite abstract group', Proc. Edinburgh Math. Soc. 5 (1936) 26-34.
34. T. G. WALKER, 'Semigroup enumeration - computer implementation and applications', Ph.D. Thesis, University of St Andrews, 1992.