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.
|Original language||English (US)|
|Number of pages||34|
|Journal||International Journal of Algebra and Computation|
|State||Published - Feb 2005|
- Decision problems
- Graphs of groups
ASJC Scopus subject areas