Affordable Access

Publisher Website

Verifying nilpotence

Authors
Journal
Journal of Symbolic Computation
0747-7171
Publisher
Elsevier
Publication Date
Volume
3
Issue
3
Identifiers
DOI: 10.1016/s0747-7171(87)80002-0
Disciplines
  • Mathematics

Abstract

This paper describes a new procedure, based on string rewriting rules, for verifying that a finitely presented group G is nilpotent. If G is not nilpotent, the procedure may not terminate. A preliminary computer implementation of the procedure has been used to prove a theorem about minimal presentations of free nilpotent groups of class 3. Finally, it is shown that the ideas presented here may be combined with work of Baumslag et al. (1981) to prove that the polycyclicity of a finitely presented group can be verified.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Nilpotence and local nilpotence of linear groups

on Linear Algebra and its Applica... Jan 01, 1976

Group algebras and Lie nilpotence

on Journal of Algebra Jan 01, 2013

Onp-nilpotence of finite groups

on Journal of Algebra Jan 01, 2004
More articles like this..