PATCH graphs: an efficient data structure for completion of finitely presented groups

DOI10.1007/3-540-61732-9_57MaRDI QIDQ6560376zbMATH OpenFDO

Authors Christopher Lynch, Polina Strogova

Publication date 21 June 2024

Full work available at URL https://doi.org/10.1007/3-540-61732-9_57

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Data structures (68P05) Generators, relations, and presentations of groups (20F05)

Recommendations

• A completion procedure for finitely presented groups that is based on word cycles
• scientific article; zbMATH DE number 1375600
• scientific article; zbMATH DE number 1241632
• Relational Methods in Computer Science
• KNUTH–BENDIX FOR GROUPS WITH INFINITELY MANY RULES

Cites work

• scientific article; zbMATH DE number 43246 (Why is no real title available?)
• scientific article; zbMATH DE number 176741 (Why is no real title available?)
• scientific article; zbMATH DE number 789389 (Why is no real title available?)
• scientific article; zbMATH DE number 3299786 (Why is no real title available?)
• Presentations of groups and monoids
• The use of Knuth-Bendix methods to solve the word problem in automatic groups
• Theorem proving with group presentations: examples and questions
• Verifying nilpotence

This page was built for publication: PATCH graphs: an efficient data structure for completion of finitely presented groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560376)