The conjugacy problem is solvable in free-by-cyclic groups

被引：36

作者：

Bogopolski, O. ^{[1
]}

Martino, A.

Maslakova, O.

Ventura, E.

机构：

[1] Russian Acad Sci, Inst Math, Sib Branch, Novosibirsk 630090, Russia

[2] Ctr Recerca Matemat, Bellaterra, Spain

[3] UPC, Dept Mat Apl 3, Barcelona, Spain

[4] Univ Nebraska, Dept Math, Lincoln, NE USA

来源：

BULLETIN OF THE LONDON MATHEMATICAL SOCIETY | 2006年 / 38卷

关键词：

D O I：

10.1112/S0024609306018674

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by using a result of O. Maslakova that one can algorithmically find generating sets for the fixed subgroups of free group automorphisms, and one of P. Brinkmann that one can determine whether two cyclic words in a free group are mapped to each other by some power of a given automorphism. We also solve the power conjugacy problem, and give an algorithm to recognize whether two given elements of a finitely generated free group are twisted conjugated to each other with respect to a given automorphism.

引用

页码：787 / 794

页数：8

共 13 条

[1] Anshel M., 1976, Houston Journal of Mathematics, V2, P139
[2] TRAIN TRACKS AND AUTOMORPHISMS OF FREE GROUPS
BESTVINA, M
HANDEL, M
[J]. ANNALS OF MATHEMATICS, 1992, 135 (01) : 1 - 51
[3] Bestvina M, 1996, J DIFFER GEOM, V43, P783
[4] BESTVINA M, 1992, J DIFFER GEOM, V35, P85
[5] Hyperbolic automorphisms of free groups
Brinkmann, P
[J]. GEOMETRIC AND FUNCTIONAL ANALYSIS, 2000, 10 (05) : 1071 - 1089
[6] Culler M., 1984, Contemp. Math., V33, P197
[7] DICKS W, 1996, CONT MATH, V195, P1
[8] KHRAMTSOV DG, 1985, MAT ZAMETKI, V0038, P00386
[9] Most automorphisms of a hyperbolic group have very simple dynamics
Levitt, G
Lustig, M
[J]. ANNALES SCIENTIFIQUES DE L ECOLE NORMALE SUPERIEURE, 2000, 33 (04): : 507 - 517
[10] On the maximum order of torsion elements in GL(n,Z) and Aut(Fn)
Levitt, G
Nicolas, JL
[J]. JOURNAL OF ALGEBRA, 1998, 208 (02) : 630 - 642

← 1 2 →