arXiv:1806.06031 Abstract | arXiv Analytics

arXiv:1806.06031 [math.GR]Abstract References Reviews Resources

Two Algorithms in Group Theory

Published 2018-06-15Version 1

We present a new algorithm deciding if the intersection of a quasiconvex subgroup of a negatively curved group with a conjugate is finite. We also give a short proof of decidability of the membership problem for quasiconvex subgroups of finitely generated groups with decidable word problem.

Categories: math.GR

Subjects: 20F10, 20F65, 20F67

Keywords: group theory, quasiconvex subgroup, membership problem, short proof, decidable word problem

Related articles: Most relevant | Search more

arXiv:1111.0081 [math.GR] (Published 2011-10-31, updated 2014-04-16)

Quasiconvex Subgroups of F_m x Z^n are Convex

Jordan Sahattchieve

arXiv:1705.02809 [math.GR] (Published 2017-05-08)

Applications of L systems to group theory

Laura Ciobanu, Murray Elder, Michal Ferov

arXiv:1010.0382 [math.GR] (Published 2010-10-03)

Search and witness problems in group theory