Detecting quasiconvexity: algorithmic aspects

Ilya Kapovich

Detecting quasiconvexity: algorithmic aspects

Group Theory 2008-02-03 v1

Authors: Ilya Kapovich

Abstract

The main result of this paper states that for any group $G$ with an automatic structure $L$ with unique representatives one can construct a uniform partial algorithm which detects $L$ -rational subgroups and gives their preimages in $L$ . This provides a practical, not just theoretical, procedure for solving the occurrence problem for such subgroups.

Keywords

semigroup theory wreath product of groups finite group theory

Cite

@article{arxiv.math/9506205,
  title  = {Detecting quasiconvexity: algorithmic aspects},
  author = {Ilya Kapovich},
  journal= {arXiv preprint arXiv:math/9506205},
  year   = {2008}
}

Comments

AMS-Tex, 7 pages, no figures. To appear in the Proceedings of the DIMACS meeting on Computational Group Theory (March 1994)

Related papers

View all related →