Recursive coboundary formula for cycles in acyclic chain complexes
KeywordsHomology computation, cycle, coboundary, algorithm
AbstractGiven an $(m-1)$-dimensional cycle $z$ in a finitely generated acyclic chain complex, we want to explicitly construct an $m$-dimensional chain $\cob(z)$ whose algebraic boundary is $z$. The acyclicity of the chain complex implies that a solution exists (it is not unique) but the traditional linear algebra methods of finding it lead to a high complexity of computation. We are searching for more efficient algorithms based on geometric considerations. The main motivation for studying this problem comes from the topological and computational dynamics, namely, from designing general algorithms computing the homomorphism induced in homology by a continuous map. This, for turn, is an essential step in computing such invariants of dynamical properties of nonlinear systems as Conley index or Lefschetz number. Another potential motivation is in the relationship of our problem to the problem of finding minimal surfaces of closed curves.
How to Cite
KACZYŃSKI, Tomasz. Recursive coboundary formula for cycles in acyclic chain complexes. Topological Methods in Nonlinear Analysis [online]. 1 December 2001, T. 18, nr 2, s. 351–371. [accessed 3.12.2021].
Number of views and downloads: 0
Number of citations: 0