Skip to content

Research at St Andrews

Subsemigroups of groups: presentations, Malcev presentations, and automatic structures

Research output: Contribution to journalArticle

DOI

Abstract

All finitely generated subsemigroups of virtually nilpotent groups admit finite Malcev presentations. (A Malcev presentation is a presentation of a special type for a semigroup that can be embedded in a group.) All automatic or asynchronous automatic semigroups embeddable into groups admit finite Malcev presentations. Finitely generated subsernigroups of virtually free groups are automatic. A finitely generated subsemigroup of the free product of a free group and an abelian group that fails to have a finite Malcev presentation is exhibited. Therefore the class of groups all of whose finitely generated subsernigroups admit finite Malcev presentations is properly contained in the class of coherent groups. Finitely generated subsernigroups of the free product of a free monoid and an abelian group are asynchronously automatic and therefore have finite Malcev presentations.

Close

Details

Original languageEnglish
Pages (from-to)397-426
Number of pages30
JournalJournal of Group Theory
Volume9
Issue number3
DOIs
Publication statusPublished - May 2006

    Research areas

  • SEMIGROUPS

Discover related content
Find related publications, people, projects and more using interactive charts.

View graph of relations

Related by author

  1. Finite generation and presentability of wreath products of monoids

    Robertson, E. F., Ruskuc, N. & Thomson, MR., 15 Aug 2003, In : Journal of Algebra. 266, 2, p. 382-392 11 p.

    Research output: Contribution to journalArticle

  2. Automatic completely-simple semigroups

    Campbell, C. M., Robertson, E. F., Ruskuc, N. & Thomas, R. M., May 2002, In : Acta Mathematica Hungarica. 95, 3, p. 201-215 15 p.

    Research output: Contribution to journalArticle

  3. Computing transformation semigroups

    Linton, S. A., Pfeiffer, G., Robertson, E. F. & Ruskuc, N., Feb 2002, In : Journal of Symbolic Computation. 33, 2, p. 145-162 18 p.

    Research output: Contribution to journalArticle

Related by journal

  1. Approximation of automorphisms of the rationals and the random graph

    Darji, U. & Mitchell, J. D., 2011, In : Journal of Group Theory. 14, 3, p. 361-388 28 p.

    Research output: Contribution to journalArticle

  2. The power graph of a finite group, II

    Cameron, P. J., 2010, In : Journal of Group Theory. 13, p. 779-783

    Research output: Contribution to journalArticle

  3. Certain classical groups are not well-defined

    Roney-Dougal, C. M., Bray, J. & Holt, D., 2009, In : Journal of Group Theory. 12, p. 171-180

    Research output: Contribution to journalArticle

  4. Constructive membership in black-box groups

    Holmes, P. E., Linton, S. A., O'Brien, E. A., Ryba, A. J. E. & Wilson, R. A., Nov 2008, In : Journal of Group Theory. 11, 6, p. 747-763 17 p.

    Research output: Contribution to journalArticle

  5. On the single-orbit conjecture for uncoverings-by-bases

    Bailey, R. F. & Cameron, P. J., 2008, In : Journal of Group Theory. 11, p. 845-850

    Research output: Contribution to journalArticle

ID: 251682

Top