Multiple conjugacy problem in graphs of free abelian groups.

DOI10.4171/GGD/303MaRDI QIDQ2347643zbMATH OpenOpenAlexFDO

Authors Benjamin Beeker

Publication date 5 June 2015

Published in Groups, Geometry, and Dynamics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1106.3978

zbMATH Keywords

Bass-Serre theorygeneralized Baumslag-Solitar groupsgraphs of groupsmultiple conjugacy problem

Mathematics Subject Classification ID

Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Groups acting on trees (20E08) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Geometric group theory (20F65)

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 prove that the multiple conjugacy problem is solvable between two n-tuples A and B of elements of G whenever the elements of A does not generate an elliptic subgroup. When the edge and vertex groups are infinite cyclic, i.e. G is a Generalized Baumslag-Solitar group, we prove that the multiple conjugacy problem is fully solvable.

Recommendations

• A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups
• On generalized conjugacy and some related problems
• Abelian JSJ decomposition of graphs of free Abelian groups.
• On the isomorphism problem for generalized Baumslag-Solitar groups.
• The generalized conjugacy problem for virtually free groups.

Cites work

• Acylindrical accessibility for groups
• Conjugacy in polycyclic groups
• scientific article; zbMATH DE number 46872 (Why is no real title available?)
• scientific article; zbMATH DE number 3575812 (Why is no real title available?)
• Orbit decidability and the conjugacy problem for some extensions of groups.
• The algorithmic theory of polycyclic-by-finite groups

Cited in

(6)

• Conjugacy separability of 1-acylindrical graphs of free groups.
• Graphical splittings of Artin kernels
• Abelian JSJ decomposition of graphs of free Abelian groups.
• COMPATIBILITY JSJ DECOMPOSITION OF GRAPHS OF FREE ABELIAN GROUPS
• On the conjugacy separability of ordinary and generalized Baumslag-Solitar groups
• Generalized Baumslag-Solitar groups: rank and finite index subgroups

This page was built for publication: Multiple conjugacy problem in graphs of free abelian groups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2347643)