Crossed product of infinite groups and complete rewriting systems

Crossed Product Structure of Quantum Euclidean Groups

It is shown that quantum Euclidean groups Eq(2), Eκ(2) and Eκ(3) have the structure of generalised crossed products.

Complete involutive rewriting systems

Given a monoid string rewriting system M , one way of obtaining a complete rewriting system for M is to use the classical Knuth-Bendix critical pairs completion algorithm. It is well known that this algorithm is equivalent to computing a noncommutative Gröbner basis for M . This article develops an alternative approach, using noncommutative involutive basis methods to obtain a complete involuti...

The non-abelian tensor product of normal crossed submodules of groups

In this article, the notions of non-abelian tensor and exterior products of two normal crossed submodules of a given crossed module of groups are introduced and some of their basic properties are established. In particular, we investigate some common properties between normal crossed modules and their tensor products, and present some bounds on the nilpotency class and solvability length of the...

Languages, Rewriting Systems, and Verification of Infinite-State Systems

Rewriting Systems for Coxeter Groups

A finite complete rewriting system for a group is a finite presentation which gives a solution to the word problem and a regular language of normal forms for the group. In this paper it is shown that the fundamental group of an orientable closed surface of genus g has a finite complete rewriting system, using the usual generators a1, .., ag, b1, .., bg along with generators representing their i...