Multiple conjugacy problem in graphs of free abelian groups
Groups, geometry, and dynamics, Tome 9 (2015) no. 1, pp. 1-27

Voir la notice de l'article provenant de la source EMS Press

DOI

A group G is a vGBS group if it admits a decomposition as a nite graph of groups with all edge and vertex groups nitely 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.
DOI : 10.4171/ggd/303
Classification : 20-XX
Mots-clés : Conjugacy problem, Bass–Serre theory

Benjamin Beeker  1

1 Université Paris-Sud, Orsay, France
Benjamin Beeker. Multiple conjugacy problem in graphs of free abelian groups. Groups, geometry, and dynamics, Tome 9 (2015) no. 1, pp. 1-27. doi: 10.4171/ggd/303
@article{10_4171_ggd_303,
     author = {Benjamin Beeker},
     title = {Multiple conjugacy problem in graphs of free abelian groups},
     journal = {Groups, geometry, and dynamics},
     pages = {1--27},
     year = {2015},
     volume = {9},
     number = {1},
     doi = {10.4171/ggd/303},
     url = {http://geodesic.mathdoc.fr/articles/10.4171/ggd/303/}
}
TY  - JOUR
AU  - Benjamin Beeker
TI  - Multiple conjugacy problem in graphs of free abelian groups
JO  - Groups, geometry, and dynamics
PY  - 2015
SP  - 1
EP  - 27
VL  - 9
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4171/ggd/303/
DO  - 10.4171/ggd/303
ID  - 10_4171_ggd_303
ER  - 
%0 Journal Article
%A Benjamin Beeker
%T Multiple conjugacy problem in graphs of free abelian groups
%J Groups, geometry, and dynamics
%D 2015
%P 1-27
%V 9
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4171/ggd/303/
%R 10.4171/ggd/303
%F 10_4171_ggd_303

Cité par Sources :