Compatibility JSJ decomposition of graphs of free abelian groups
classification
🧮 math.GR
keywords
decompositiongroupsabeliancompatibilityfreegroupadmitsalgorithmically
read the original abstract
A group G is a vGBS group if it admits a decomposition as a finite graph of groups with all edge and vertex groups finitely generated and free abelian. We describe the compatibility JSJ decomposition over abelian groups. We prove that in general this decomposition is not algorithmically computable.
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.