Advertisement

Semigroup Forum

, Volume 96, Issue 2, pp 301–315 | Cite as

A solvable conjugacy problem for finitely presented semigroups satisfying C(2) and T(4)

  • P. A. Cummings
  • D. A. Jackson
Research Article
  • 65 Downloads

Abstract

There are multiple, inequivalent, definitions for conjugacy in semigroups. In Cummings and Jackson (Semigroup Forum 88, 52–66, 2014), we conjectured that, for at least one of these definitions of conjugacy, the conjugacy problem for finitely presented semigroups satisfying C(2) and T(4) is solvable. Here we essentially verify that conjecture. In that 2014 Semigroup Forum publication, we developed geometric methods to solve a conjugacy problem for finitely presented semigroups satisfying C(3). We use those methods again here.

Keywords

Conjugacy problem Semigroup diagrams Small overlap semigroups 

Notes

Acknowledgements

The first author would like to thank Maritza Martinez, Director of the Educational Opportunities Program, for supporting his request for a spring 2015 educational leave, in part, to begin work on this article. He would also like to thank his students and the staffs of the EOP and the Office of Access and Academic Enrichment for all of their encouragement and support.

References

  1. 1.
    Cummings, P.A., Goldstein, R.Z.: Solvable word problems in semigroups. Semigroup Forum 50, 243–246 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Charalambides, C.A.: Enumerative Combinatorics. Chapman and Hall, London (2002)zbMATHGoogle Scholar
  3. 3.
    Cummings, P.A., Jackson, D.A.: Thickness of feathers. Comm. Algebra 42, 5329–5356 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Cummings, P.A., Jackson, D.A.: A solvable conjugacy problem for finitely presented C(3) semigroups. Semigroup Forum 88, 52–66 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Hall, M., Jr.: The Theory of Groups, 2nd ed. Chelsea (1976)Google Scholar
  6. 6.
    Higgins, P.M.: Techniques of Semigroup Theory. Oxford University Press, New York (1992)zbMATHGoogle Scholar
  7. 7.
    Hill, P., Pride, S.J., Vella, A.D.: On the \(T(q)\)-conditions of small cancellation theory. Israel J. Math. 52, 293–304 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Hoare, A.H.M.: Coinitial graphs and Whitehead automorphisms. Can. J. Math. 31, 112–123 (1979)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Kudryavtseva, G., Mazorchuk, V.: On three approaches to conjugacy in semigroups. Semigroup Forum 78, 14–20 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Martin, G.E.: Counting: The Art of Enumerative Combinatorics. Springer, New York (2001). (Undergraduate Texts in Mathematics)CrossRefzbMATHGoogle Scholar
  11. 11.
    Remmers, J.H.: On the geometry of semigroup presentations. Adv. Math. 36, 283–296 (1980)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Remmers, J.H.: A geometric approach for some algorithmic problems for semigroups. University of Mich, Thesis (1971)Google Scholar
  13. 13.
    Reutenauer, C.: Free Lie Algebras. Oxford University Press, Oxford (1993)zbMATHGoogle Scholar
  14. 14.
    Silva, P.V.: Conjugacy and transpositions for inverse monoid presentations. Internat. J. Alg. Comp. 6(5), 607–622 (1996)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2017

Authors and Affiliations

  1. 1.Educational Opportunities Program, University at AlbanyState University of New YorkNew YorkUSA
  2. 2.ChampaignUSA

Personalised recommendations