Recursive coboundary formula for cycles in acyclic chain complexes (Q696177): Difference between revisions

The author is preoccupied with the following problem: Given an \((m-1)\)-dimensional cycle \(z\) in a finitely generated acyclic chain complex \((C,\partial)\), explicitly construct an \(m\)-dimensional chain \(c= \text{Cob}(z)\) such that \(\partial c=z\). There exist situations where it is known that \(C\) is acyclic without having explicit computed its homology. The main motivation invocated by the author for his study comes from topological and computational dynamics, namely, the need for designing general algorithms computing the homomorphism induced in homology by a continuous map \(f:X\to Y\), where \(X\) and \(Y\) are polyhedral subsets of \(\mathbb{R}^n\) and for finding some dynamical invariants of nonlinear systems such as Conley index or Lefschetz number. About such type problems the author has published yet a number of articles with \textit{M. Allili}, Trans. Am. Math. Soc. 352, No. 5, 2261-2281 (2000; Zbl 0947.37006); Discrete Comput. Geom. 25, No. 1, 125-140 (2001; Zbl 0973.18009); Banach Cent. Publ. 47, 57-65 (1999; Zbl 0946.37004); with \textit{M. Mrozek} and \textit{M. Ślusarek}, Comput. Math. Appl. 35, No. 4, 59-70 (1998; Zbl 0904.55004). In this paper, the author combines some ideas coming from these articles to obtain a new and more efficient prototype algorithm computing \(\text{Cob}(z)\).