Geodesic Rewriting Systems and Pregroups

  • Volker Diekert
  • Andrew J. Duncan
  • Alexei G. Myasnikov
Conference paper

DOI: 10.1007/978-3-7643-9911-5_3

Part of the Trends in Mathematics book series (TM)
Cite this paper as:
Diekert V., Duncan A.J., Myasnikov A.G. (2010) Geodesic Rewriting Systems and Pregroups. In: Bogopolski O., Bumagin I., Kharlampovich O., Ventura E. (eds) Combinatorial and Geometric Group Theory. Trends in Mathematics. Birkhäuser Basel

Abstract

In this paper we study rewriting systems for groups and monoids, focusing on situations where finite convergent systems may be difficult to find or do not exist. We consider systems which have no length increasing rules and are confluent and then systems in which the length reducing rules lead to geodesics. Combining these properties we arrive at our main object of study which we call geodesically perfect rewriting systems. We show that these are well behaved and convenient to use, and give several examples of classes of groups for which they can be constructed from natural presentations. We describe a Knuth-Bendix completion process to construct such systems, show how they may be found with the help of Stallings’ pregroups and conversely may be used to construct such pregroups.

Mathematics Subject Classification (2000)

68Q42 20F05 20M32 20E06 

Keywords

String rewriting systems Geodesically Perfect Knuth-Bendix Stallings pregroups 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Basel AG 2010

Authors and Affiliations

  • Volker Diekert
    • 1
  • Andrew J. Duncan
    • 2
  • Alexei G. Myasnikov
    • 3
  1. 1.Universität StuttgartStuttgartGermany
  2. 2.Newcastle UniversityNewcastle upon TyneUK
  3. 3.McGill UniversityMontrealCanada

Personalised recommendations