pith. sign in

arxiv: math/9506205 · v1 · submitted 1995-06-27 · 🧮 math.GR

Detecting quasiconvexity: algorithmic aspects

classification 🧮 math.GR
keywords subgroupsalgorithmalgorithmicaspectsautomaticconstructdetectingdetects
0
0 comments X
read the original 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.

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.