THE SUBGROUP IDENTIFICATION PROBLEM FOR FINITELY PRESENTED GROUPS

DOI10.1142/S021819671350015XzbMath1273.20027arXiv1109.1792MaRDI QIDQ4923207

Maurice Chiodo

Publication date: 5 June 2013

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

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

zbMATH Keywords

coherent groupsfinitely presented groupsHopfian groupssubgroup identification problem

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cites Work

• On the difficulty of presenting finitely presentable groups.
• Finding non-trivial elements and splittings in groups.
• Recursive unsolvability of group theoretic problems
• Enumerating limit groups.
• Combinatorial group theory.
• The Word Problem for Groups
• Subgroups of finitely presented groups
• Some two-generator one-relator non-Hopfian groups
• The word problem

This page was built for publication: THE SUBGROUP IDENTIFICATION PROBLEM FOR FINITELY PRESENTED GROUPS