Skip to main content
SpringerLink
Log in

A note on the definition of small overlap monoids

  • RESEARCH ARTICLE
  • Published:
Semigroup Forum Aims and scope Submit manuscript

Abstract

Small overlap conditions are simple and natural combinatorial conditions on semigroup and monoid presentations, which serve to limit the complexity of derivation sequences between equivalent words in the generators. They were introduced by J.H. Remmers, and more recently have been extensively studied by the present author. However, the definition of small overlap conditions hitherto used by the author was slightly more restrictive than that introduced by Remmers; this note eliminates this discrepancy by extending the recent methods and results of the author to apply to Remmers’ small overlap monoids in full generality.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Antony, N.C.: Review of the paper “Small overlap monoids I: the word problem” by M. Kambites. Math. Rev. (2011) MR2501517

  2. Duncan, A., Gilman, R.H.: Word hyperbolic semigroups. Math. Proc. Camb. Philos. Soc. 136(3), 513–524 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  3. Higgins, P.M.: Techniques of Semigroup Theory. Oxford Science Publications. Clarendon/Oxford University Press, Oxford/New York (1992). With a foreword by G.B. Preston

    MATH  Google Scholar 

  4. Kambites, M.: Small overlap monoids I: the word problem. J. Algebra 321, 2187–2205 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  5. Kambites, M.: Small overlap monoids II: automatic structures and normal forms. J. Algebra 321, 2302–2316 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  6. Kambites, M.: Generic complexity of finitely presented monoids and semigroups. Comput. Complex. 20, 21–50 (2011)

    Article  MathSciNet  Google Scholar 

  7. Lyndon, R.C., Schupp, P.E.: Combinatorial Group Theory. Springer, Berlin (1977)

    MATH  Google Scholar 

  8. Remmers, J.H.: Some algorithmic problems for semigroups: a geometric approach. Ph.D. thesis, University of Michigan (1971)

  9. Remmers, J.H.: On the geometry of semigroup presentations. Adv. Math. 36(3), 283–296 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  10. Sakarovitch, J.: Easy multiplications I. The realm of Kleene’s theorem. Inf. Comput. 74, 173–197 (1987)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics, University of Manchester, Manchester, M13 9PL, England

    Mark Kambites

Authors
  1. Mark Kambites
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mark Kambites.

Additional information

Communicated by Steve Pride.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kambites, M. A note on the definition of small overlap monoids. Semigroup Forum 83, 499–512 (2011). https://doi.org/10.1007/s00233-011-9350-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00233-011-9350-6

Keywords

Search

Navigation