Reidemeister conjugacy for finitely generated free fundamental groups

Evelyn L. Hart. "Reidemeister conjugacy for finitely generated free fundamental groups." Fundamenta Mathematicae 199.2 (2008): 93-118. <http://eudml.org/doc/283112>.

@article{EvelynL2008,
abstract = {Let X be a space with the homotopy type of a bouquet of k circles, and let f: X → X be a map. In certain cases, algebraic techniques can be used to calculate N(f), the Nielsen number of f, which is a homotopy invariant lower bound on the number of fixed points for maps homotopic to f. Given two fixed points of f, x and y, and their corresponding group elements, $W_x$ and $W_y$, the fixed points are Nielsen equivalent if and only if there is a solution z ∈ π₁(X) to the equation $z = W_\{y\}^\{-1\}f_\{♯\}(z)W_\{x\}$. The Nielsen number is the number of equivalence classes that have nonzero fixed point index. A variety of methods for determining the Nielsen classes, each with their own restrictions on the map f, have been developed by Wagner, Kim, and (when the fundamental group is free on two generators) by Kim and Yi. In order to describe many of these methods with a common terminology, we introduce new definitions that describe the types of bounds on |z| that can occur. The best directions for future research become clear when this new nomenclature is used. To illustrate the new concepts, we extend Wagner’s ideas, regarding W-characteristic maps and maps with remnant, to two new classes of maps that have only partial remnant. We prove that for these classes of maps Wagner’s algorithm will find almost all Nielsen equivalences, and the algorithm is extended to find all Nielsen equivalences. The proof that our algorithm does find the Nielsen number is complex even though these two classes of maps are restrictive. For our classes of maps (MRN maps and 2C3 maps), the number of possible solutions z is at most 11 for MRN maps and 14 for 2C3 maps. In addition, the length of any solution is at most three for MRN maps and four for 2C3 maps. This makes a computer search reasonable. Many examples are included.},
author = {Evelyn L. Hart},
journal = {Fundamenta Mathematicae},
keywords = {fixed point; Nielsen number; free group; remnant},
language = {eng},
number = {2},
pages = {93-118},
title = {Reidemeister conjugacy for finitely generated free fundamental groups},
url = {http://eudml.org/doc/283112},
volume = {199},
year = {2008},
}

TY - JOUR
AU - Evelyn L. Hart
TI - Reidemeister conjugacy for finitely generated free fundamental groups
JO - Fundamenta Mathematicae
PY - 2008
VL - 199
IS - 2
SP - 93
EP - 118
AB - Let X be a space with the homotopy type of a bouquet of k circles, and let f: X → X be a map. In certain cases, algebraic techniques can be used to calculate N(f), the Nielsen number of f, which is a homotopy invariant lower bound on the number of fixed points for maps homotopic to f. Given two fixed points of f, x and y, and their corresponding group elements, $W_x$ and $W_y$, the fixed points are Nielsen equivalent if and only if there is a solution z ∈ π₁(X) to the equation $z = W_{y}^{-1}f_{♯}(z)W_{x}$. The Nielsen number is the number of equivalence classes that have nonzero fixed point index. A variety of methods for determining the Nielsen classes, each with their own restrictions on the map f, have been developed by Wagner, Kim, and (when the fundamental group is free on two generators) by Kim and Yi. In order to describe many of these methods with a common terminology, we introduce new definitions that describe the types of bounds on |z| that can occur. The best directions for future research become clear when this new nomenclature is used. To illustrate the new concepts, we extend Wagner’s ideas, regarding W-characteristic maps and maps with remnant, to two new classes of maps that have only partial remnant. We prove that for these classes of maps Wagner’s algorithm will find almost all Nielsen equivalences, and the algorithm is extended to find all Nielsen equivalences. The proof that our algorithm does find the Nielsen number is complex even though these two classes of maps are restrictive. For our classes of maps (MRN maps and 2C3 maps), the number of possible solutions z is at most 11 for MRN maps and 14 for 2C3 maps. In addition, the length of any solution is at most three for MRN maps and four for 2C3 maps. This makes a computer search reasonable. Many examples are included.
LA - eng
KW - fixed point; Nielsen number; free group; remnant
UR - http://eudml.org/doc/283112
ER -