Verifying nilpotence

DOI10.1016/S0747-7171(87)80002-0zbMath0626.68034OpenAlexW2913322469MaRDI QIDQ580975

Charles C. Sims

Publication date: 1987

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0747-7171(87)80002-0

zbMATH Keywords

finitely presented groupminimal presentations of free nilpotent groups of class 3polycyclicitystring rewriting rules

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Generators, relations, and presentations of groups (20F05) Free nonabelian groups (20E05) Software, source code, etc. for problems pertaining to group theory (20-04) Limits, profinite groups (20E18)

Related Items

Weights for total division orderings on strings ⋮ Extensions and comparison of simplification orderings ⋮ Some remarks on the computation of complements and normalizers in soluble groups ⋮ Soluble groups with a finite rewriting system ⋮ Conditional semi-Thue systems for presenting monoids ⋮ Basic Commutators in Weights Six and Seven as Relators ⋮ Implementing the Baumslag-Cannonito-Miller polycyclic quotient algorithm ⋮ A note on division orderings on strings ⋮ The order types of termination orderings on monadic terms, strings and multisets ⋮ 4-ENGEL GROUPS ARE LOCALLY NILPOTENT ⋮ Some experiments with a completion theorem prover ⋮ On the Right and Left 4-Engel Elements ⋮ Algebra and automated deduction ⋮ Collection from the left and other strategies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some recognizable properties of solvable groups
• Presentations of groups and monoids
• Groups of exponent five and class four
• Implementation and Analysis of the Todd-Coxeter Algorithm
• Free differential calculus. IV: The quotient groups of the lower central series