Detecting quasiconvexity: algorithmic aspects
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.
Create a lesson
Related papers
Lifts of Brauer characters and vertex pairs for odd primes
Yong Yang
Galois's lost proof on PSL(2,p)
Péter P. Pálfy
Large orbits of p-groups on conjugacy classes
Thomas Michael Keller
Assouad--Nagata dimension of systolic complexes with almost flat intervals
Martín Blufstein, Victor Chepoi, Huaitao Gui et al.
Conjugator length of Bestvina-Brady groups
Jerónimo García-Mejía, Matteo Migliorini
Morse accessibility with applications to Coxeter groups
Matthew Cordes, Annette Karrer, Kim Ruane