Compatibility JSJ decomposition of graphs of free abelian groups
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.