Detecting quasiconvexity: algorithmic aspects
| dc.creator | Kapovich, Ilya | |
| dc.date | 1995-06-27 | |
| dc.date.accessioned | 2026-07-07T09:15:20Z | |
| dc.date.available | 2026-07-07T09:15:20Z | |
| dc.description | 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. | |
| dc.description | AMS-Tex, 7 pages, no figures. To appear in the Proceedings of the DIMACS meeting on Computational Group Theory (March 1994) | |
| dc.identifier | https://arxiv.org/abs/math/9506205 | |
| dc.identifier | http://arxiv.org/abs/math/9506205 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/152984 | |
| dc.subject | Group Theory | |
| dc.title | Detecting quasiconvexity: algorithmic aspects | |
| dc.type | text |