Abstract
We introduce a combinatorial version of Stallings-Bestvina-Feighn-Dunwoody folding sequences. We then show how they are useful in analyzing the solvability of the uniform subgroup membership problem for fundamental groups of graphs of groups. Applications include coherent right-angled Artin groups and coherent solvable groups. © World Scientific Publishing Company.
Author supplied keywords
Cite
CITATION STYLE
APA
Kapovich, I., Weidmann, R., & Myasnikov, A. (2005). Foldings, graphs of groups and the membership problem. International Journal of Algebra and Computation, 15(1), 95–128. https://doi.org/10.1142/S021819670500213X
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free