Two Algorithms in Group Theory
classification
🧮 math.GR
cs.DS
keywords
groupproblemquasiconvexalgorithmalgorithmsconjugatecurveddecidability
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.