Algorithms for Nielsen type periodic numbers of maps with remnant on surfaces with boundary and on bouquets of circles I

Evelyn L. Hart, Philip R. Heath, and Edward C. Keppelmann. "Algorithms for Nielsen type periodic numbers of maps with remnant on surfaces with boundary and on bouquets of circles I." Fundamenta Mathematicae 200.2 (2008): 101-132. <http://eudml.org/doc/282880>.

@article{EvelynL2008,
abstract = { In this paper and its sequel we present a method that, under loose restrictions, is algorithmic for calculating the Nielsen type numbers NΦₙ(f) and NPₙ(f) of self maps f of hyperbolic surfaces with boundary and also of bouquets of circles. Because self maps of these surfaces have the same homotopy type as maps on wedges of circles, and the Nielsen periodic numbers are homotopy type invariant, we need concentrate only on the latter spaces. Of course the results will then automatically apply to the former spaces as well. The algorithm requires only that f has minimal remnant, by which we mean that there is limited cancellation between the f⁎ images of generators of the fundamental group. These methods often work even when the minimal remnant condition is not satisfied. Our methodology involves three separate techniques. Firstly, beginning with an endomorphism h on the fundamental group, we adapt an algorithm of Wagner to our setting, allowing us to distinguish non-empty Reidemeister classes for iterates of a special representative map for h, which we introduce. Secondly, using techniques reminiscent of symbolic dynamics, we assign key algebraic information to the actual periodic points of this special representative. Finally, we use word length arguments to prove that the remaining information required for the calculation of NΦₙ(f) and NPₙ(f) can be found with a finite computer search. We include many illustrative examples. In this first paper we give the tools we need in order to present and give the algorithm for NPₙ(f). All the tools introduced here will be needed in the sequel where we develop the extra tools needed in order to compute NΦₙ(f). },
author = {Evelyn L. Hart, Philip R. Heath, Edward C. Keppelmann},
journal = {Fundamenta Mathematicae},
keywords = {Nielsen number; Nielsen periodic point number; surface maps; free groups},
language = {eng},
number = {2},
pages = {101-132},
title = {Algorithms for Nielsen type periodic numbers of maps with remnant on surfaces with boundary and on bouquets of circles I},
url = {http://eudml.org/doc/282880},
volume = {200},
year = {2008},
}

TY - JOUR
AU - Evelyn L. Hart
AU - Philip R. Heath
AU - Edward C. Keppelmann
TI - Algorithms for Nielsen type periodic numbers of maps with remnant on surfaces with boundary and on bouquets of circles I
JO - Fundamenta Mathematicae
PY - 2008
VL - 200
IS - 2
SP - 101
EP - 132
AB - In this paper and its sequel we present a method that, under loose restrictions, is algorithmic for calculating the Nielsen type numbers NΦₙ(f) and NPₙ(f) of self maps f of hyperbolic surfaces with boundary and also of bouquets of circles. Because self maps of these surfaces have the same homotopy type as maps on wedges of circles, and the Nielsen periodic numbers are homotopy type invariant, we need concentrate only on the latter spaces. Of course the results will then automatically apply to the former spaces as well. The algorithm requires only that f has minimal remnant, by which we mean that there is limited cancellation between the f⁎ images of generators of the fundamental group. These methods often work even when the minimal remnant condition is not satisfied. Our methodology involves three separate techniques. Firstly, beginning with an endomorphism h on the fundamental group, we adapt an algorithm of Wagner to our setting, allowing us to distinguish non-empty Reidemeister classes for iterates of a special representative map for h, which we introduce. Secondly, using techniques reminiscent of symbolic dynamics, we assign key algebraic information to the actual periodic points of this special representative. Finally, we use word length arguments to prove that the remaining information required for the calculation of NΦₙ(f) and NPₙ(f) can be found with a finite computer search. We include many illustrative examples. In this first paper we give the tools we need in order to present and give the algorithm for NPₙ(f). All the tools introduced here will be needed in the sequel where we develop the extra tools needed in order to compute NΦₙ(f).
LA - eng
KW - Nielsen number; Nielsen periodic point number; surface maps; free groups
UR - http://eudml.org/doc/282880
ER -