Rewriting Systems and Embedding of monoids in groups

preprint2008arXivOpen access

Abstract

In this paper, a connection between rewriting systems and embedding of monoids in groups is found. We show that if a group with a positive presentation has a complete rewriting system ℜ\Re that satisfies the condition that each rule in ℜ\Re with positive left-hand side has a positive right-hand side, then the monoid presented by the subset of positive rules from ℜ\Re embeds in the group. As an example, we give a simple proof that right angled Artin monoids embed in the corresponding right angled Artin groups. This is a special case of the well-known result of Paris \cite{paris} that Artin monoids embed in their groups.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.