Verifying nilpotence

DOI10.1016/S0747-7171(87)80002-0MaRDI QIDQ580975zbMATH OpenOpenAlexFDO

Authors 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) Free nonabelian groups (20E05) Limits, profinite groups (20E18) Generators, relations, and presentations of groups (20F05) Software, source code, etc. for problems pertaining to group theory (20-04)

Recommendations

• scientific article; zbMATH DE number 848088
• Recognizing powers in nilpotent groups and nilpotent images of free groups
• scientific article; zbMATH DE number 3901022
• Computing in Nilpotent Matrix Groups
• Finding intersections and normalizers in finitely generated nilpotent groups

Cites work

• 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?)
• Free differential calculus. IV: The quotient groups of the lower central series
• Groups of exponent five and class four
• Implementation and Analysis of the Todd-Coxeter Algorithm
• Presentations of groups and monoids
• Some recognizable properties of solvable groups

Cited in

(17)

• PATCH graphs: an efficient data structure for completion of finitely presented groups
• The order types of termination orderings on monadic terms, strings and multisets
• Some remarks on the computation of complements and normalizers in soluble groups
• Milnor invariants of braids and welded braids up to homotopy
• Extensions and comparison of simplification orderings
• Algebra and automated deduction
• Weights for total division orderings on strings
• Recognizing powers in nilpotent groups and nilpotent images of free groups
• On the right and left 4-Engel elements.
• Basic Commutators in Weights Six and Seven as Relators
• Collection from the left and other strategies
• Some experiments with a completion theorem prover
• Implementing the Baumslag-Cannonito-Miller polycyclic quotient algorithm
• A note on division orderings on strings
• 4-ENGEL GROUPS ARE LOCALLY NILPOTENT
• Conditional semi-Thue systems for presenting monoids
• Soluble groups with a finite rewriting system

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)