The subgroup identification problem for finitely presented groups.

DOI10.1142/S021819671350015XMaRDI QIDQ4923207zbMATH OpenFDO

Authors 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)

Abstract: We introduce the subgroup identification problem, and show that there is a finitely presented group G for which it is unsolvable, and that it is uniformly solvable in the class of finitely presented locally Hopfian groups. This is done as an investigation into the difference between strong and weak effective coherence for finitely presented groups.

Recommendations

• On the difficulty of presenting finitely presentable groups.
• The triviality problem for profinite completions
• scientific article; zbMATH DE number 3929284
• SUBGROUPS OF FINITELY PRESENTED GROUPS WITH SOLVABLE CONJUGACY PROBLEM
• The membership problem for 3-manifold groups is solvable

Cites work

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

This page was built for publication: The subgroup identification problem for finitely presented groups.

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