An algorithmic approach to the construction of homomorphisms induced by maps in homology

This paper is devoted to giving the theoretical background for an algorithm for computing homomorphisms induced by maps in homology. The principal idea is to insert the graph of a given continuous map into a graph of a multi-valued representable map . The multi-valued representable maps have well developed continuity properties and admit a finite coding that permits treating them by combinatorial methods. We provide the construction of the homomorphism induced by such that . The presented construction does not require subsequent barycentric subdivisions and simplicial approximations of . The main motivation for this paper comes from the project of computing the Conley Index for discrete dynamical systems.