THE REIDEMEISTER TRACE AND THE CALCULATION OF THE NIELSEN NUMBER
Pełen tekst
Powiązane dokumenty
The rain- bow connection number of a connected graph G, denoted rc(G), is the smallest number of colours that are needed in order to make G rainbow- connected1. In this paper we
In this paper some algebraic results are given which allow distinguishing Reidemeister classes and hence computing the Reidemeister number of some maps.. Examples of computations
In a search for triangle-free graphs with arbitrarily large chromatic numbers, Mycielski [11] developed an interesting graph transformation as follows.. In recent times, there has
For t that are divisble by 2 and 3 we will use the theory of quadratic forms, modular forms and Gauss’ Eureka theorem to prove the positivity of c t (n).. When p ≥ 5 is prime, we
If K and L are absolutely abelian number fields, however, we obtain a fairly explicit description of the number I(L/K).. This concludes the proof
In this note we give a short proof of Lemma 2 by another method, which yields a significantly better estimate, and we considerably improve the estimates of our Theorems 1 and
Miklaszewski, A reduction of the Nielsen fixed point theorem for symmetric product maps to the Lefschetz theorem, Fund.. Schirmer, An index and a Nielsen number for
Therefore we introduce a Nielsen fixed point theory for transversally fixed maps on smooth manifolds without or with boundary, and use it to calculate the minimum number of fixed