On groups presented by inverse-closed finite confluent length-reducing rewriting systems

DOI10.1016/j.jalgebra.2023.03.022OpenAlexW4361264989MaRDI QIDQ2700950

Murray J. Elder, Adam Piggott

Publication date: 27 April 2023

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.03445

zbMATH Keywords

hyperbolic groupgraph of groupsfree product\textsf{PSPACE}plain group\textsf{NP}centraliser of an elementfinite confluent length-reducing rewriting systemvirtually-free group

Mathematics Subject Classification ID

Geometric group theory (20F65) Grammars and rewriting systems (68Q42) Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Smith normal form
• Elements of finite order for finite weight-reducing and confluent Thue systems
• Actions of finite groups of graphs and related automorphisms of free groups
• Sur les groupes hyperboliques d'après Mikhael Gromov. (On the hyperbolic groups à la M. Gromov)
• Gilman's conjecture
• Rewriting systems, plain groups, and geodetic graphs
• A characterisation of virtually free groups.
• Relationships between nondeterministic and deterministic tape complexities
• Foliations for solving equations in groups: free, virtually free, and hyperbolic groups
• Groups Presented by Finite Two-Monadic Church-Rosser Thue Systems
• Commutativity in groups presented by finite Church-Rosser Thue systems
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• Finite and infinite cyclic extensions of free groups
• A REMARK ABOUT COMBINGS OF GROUPS
• FINITE SUBGROUPS OF HYPERBOLIC GROUPS
• The isomorphism problem for finite extensions of free groups is in PSPACE
• CONJUGACY OF FINITE SUBSETS IN HYPERBOLIC GROUPS

This page was built for publication: On groups presented by inverse-closed finite confluent length-reducing rewriting systems