Abstract
This paper shows that a finitely presented monoid with linear Dehn function need not have a regular cross-section, strengthening the previously-known result that such a monoid need not be presented by a finite complete string rewriting system, and contrasting with the fact that finitely presented groups with linear Dehn function always have regular cross-sections.
Similar content being viewed by others
References
Book, R.V., Otto, F.: String-Rewriting Systems. Texts and Monographs in Computer Science. Springer, New York (1993)
Cain, A.J.: Hyperbolicity of monoids presented by confluent monadic rewriting systems. Beitr. Algebra Geom. 54(2), 593–608 (2013). doi:10.1007/s13366-012-0116-4
Cain, A.J., Maltcev, V.: Markov semigroups, monoids, and groups. Submitted. arXiv:1202.3013
Cain, A.J., Maltcev, V.: Context-free rewriting systems and word-hyperbolic structures with uniqueness. Int. J. Algebra Comput. 22(7), 1250061 (2012), 14 pp. doi:10.1142/S0218196712500610
Cassaigne, J., Silva, P.V.: Infinite words and confluent rewriting systems: endomorphism extensions. Internat. J. Algebra Comput. 19(4), 443–490 (2009). doi:10.1142/S0218196709005111
Duncan, A., Gilman, R.H.: Word hyperbolic semigroups. Math. Proc. Cambridge Philos. Soc. 136(3), 513–524 (2004). doi:10.1017/S0305004103007497
Gilman, R.H.: On the definition of word hyperbolic groups. Math. Z. 242(3), 529–541 (2002). doi:10.1007/s002090100356
Gromov, M.: Hyperbolic groups. In: Gersten, S.M. (ed.) Essays in Group Theory. Math. Sci. Res. Inst. Publ., vol. 8, pp. 75–263. Springer, New York (1987)
Kobayashi, Y.: A finitely presented monoid which has solvable word problem but has no regular complete presentation. Theoret. Comput. Sci. 146(1–2), 321–329 (1995). doi:10.1016/0304-3975(94)00264-J
Maltcev, V.: Topics in combinatorial semigroup theory. Ph.D. Thesis, University of St. Andrews. hdl.handle.net/10023/3226 (2012)
Otto, F., Katsura, M., Kobayashi, Y.: Infinite convergent string-rewriting systems and cross-sections for finitely presented monoids. J. Symbolic Comput. 26(5), 621–648 (1998). doi:10.1006/jsco.1998.0230
Otto, F., Sattler-Klein, A., Madlener, K.: Automatic monoids versus monoids with finite convergent presentations. In: Rewriting Techniques and Applications, Tsukuba, 1998. Lecture Notes in Comput. Sci., vol. 1379, pp. 32–46. Springer, Berlin (1998). doi:10.1007/BFb0052359
Squier, C.C.: Word problems and a homological finiteness condition for monoids. J. Pure Appl. Algebra 49(1–2), 201–217 (1987). doi:10.1016/0022-4049(87)90129-0
Acknowledgements
The authors thank the anonymous referee for pointing out a flaw in an earlier proof of Lemma 9, and for making extensive comments and suggestions on improving the exposition.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Marcel Jackson.
During the research that led to the this paper, the first author was supported by the European Regional Development Fund through the programme COMPETE and by the Portuguese Government through the FCT (Fundação para a Ciência e a Tecnologia) under the project PEst-C/MAT/UI0144/2011 and through an FCT Ciência 2008 fellowship.
The research described in this paper has been included in the second author’s Ph.D. thesis [10, Sect. 7.2].
Rights and permissions
About this article
Cite this article
Cain, A.J., Maltcev, V. Finitely presented monoids with linear Dehn function need not have regular cross-sections. Semigroup Forum 88, 300–315 (2014). https://doi.org/10.1007/s00233-013-9531-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00233-013-9531-6