Two Algorithms in Group Theory
Group Theory
2018-11-08 v1 Data Structures and Algorithms
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.
Cite
@article{arxiv.1806.06031,
title = {Two Algorithms in Group Theory},
author = {Rita Gitik},
journal= {arXiv preprint arXiv:1806.06031},
year = {2018}
}