Detecting quasiconvexity: algorithmic aspects
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.