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 \textit{G. Baumslag}, \textit{F. B. Cannonito}, and \textit{C. F. Miller III} [Math. Z. 178, 289-295 (1981; Zbl 0455.20027)] to prove that the polycyclicity of a finitely presented group can be verified.
- Free differential calculus. IV: The quotient groups of the lower central series
- Groups of exponent five and class four
- scientific article; zbMATH DE number 3137403 (Why is no real title available?)
- scientific article; zbMATH DE number 3136688 (Why is no real title available?)
- scientific article; zbMATH DE number 3871338 (Why is no real title available?)
- scientific article; zbMATH DE number 4110916 (Why is no real title available?)
- scientific article; zbMATH DE number 3672557 (Why is no real title available?)
- scientific article; zbMATH DE number 3712180 (Why is no real title available?)
- scientific article; zbMATH DE number 3769860 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- Implementation and Analysis of the Todd-Coxeter Algorithm
- Presentations of groups and monoids
- Some recognizable properties of solvable groups
- Some experiments with a completion theorem prover
- Weights for total division orderings on strings
- Some remarks on the computation of complements and normalizers in soluble groups
- Basic Commutators in Weights Six and Seven as Relators
- On the right and left 4-Engel elements.
- Soluble groups with a finite rewriting system
- The order types of termination orderings on monadic terms, strings and multisets
- Algebra and automated deduction
- Extensions and comparison of simplification orderings
- Conditional semi-Thue systems for presenting monoids
- Recognizing powers in nilpotent groups and nilpotent images of free groups
- 4-ENGEL GROUPS ARE LOCALLY NILPOTENT
- PATCH graphs: an efficient data structure for completion of finitely presented groups
- Milnor invariants of braids and welded braids up to homotopy
- Collection from the left and other strategies
- Implementing the Baumslag-Cannonito-Miller polycyclic quotient algorithm
- A note on division orderings on strings
This page was built for publication: Verifying nilpotence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q580975)
