Foldings, graphs of groups and the membership problem
classification
🧮 math.GR
keywords
groupscoherentgraphsmembershipproblemanalyzingapplicationsartin
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.