Geodesic rewriting systems and pregroups

MaRDI QIDQ5748110zbMATH OpenFDO

Authors Volker Diekert, Andrew Duncan, Alexei Myasnikov

Publication date 14 September 2010

Full work available at URL https://arxiv.org/abs/0906.2223

zbMATH Keywords

confluent systemsgeodesic wordsgeodesically perfect systemsrewriting systemsword problem

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Grammars and rewriting systems (68Q42)

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.

Recommendations

• Rewriting systems, plain groups, and geodetic graphs
• Rewriting systems and geometric three-manifolds
• scientific article; zbMATH DE number 4210420
• Rewriting Systems and Embedding of Monoids in Groups
• Rewriting systems in sufficiently large Artin-Tits groups.
• scientific article; zbMATH DE number 1222454
• Groupoids and the algebra of rewriting in group presentations
• scientific article; zbMATH DE number 67429
• Pre-Lie groups in abstract differential geometry
• Algebra and geometry of rewriting

Cited in

(17)

• Rewriting systems and geometric three-manifolds
• Tame combings, almost convexity and rewriting systems for groups
• Rewriting systems, plain groups, and geodetic graphs
• Topological finiteness properties of monoids. I: Foundations
• On groups presented by inverse-closed finite confluent length-reducing rewriting systems
• Cyclic rewriting and conjugacy problems.
• Rewriting Systems and Embedding of Monoids in Groups
• scientific article; zbMATH DE number 4042147 (Why is no real title available?)
• scientific article; zbMATH DE number 67429 (Why is no real title available?)
• scientific article; zbMATH DE number 1222454 (Why is no real title available?)
• Soluble groups with a finite rewriting system
• scientific article; zbMATH DE number 2074997 (Why is no real title available?)
• Complete rewriting system for the Schützenberger product of n groups
• Confluence of algebraic rewriting systems
• Homological finiteness properties of monoids, their ideals and maximal subgroups.
• Finding k shortest paths in Cayley graphs of finite groups
• Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group

This page was built for publication: Geodesic rewriting systems and pregroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5748110)