An algorithmic approach to Dold-Puppe complexes (Q985317): Difference between revisions

The Dold-Kan correspondence gives a pair of functors \(\Gamma\) and \(N\) that provide an equivalence between the category of of bounded chain complexes and the category of simplicial complexes. The authors give algorithms which streamline the computation \(\Gamma(C_.)\) and allow the explicit calculation of the Dold-Puppe complex \(NF\Gamma(C_.)\) [\textit{A. Dold, D. Puppe}, Ann.\ Inst.\ Fourier Grenoble 11, 201--312 (1961; Zbl 0098.36005)] in terms of the cross-effect functors of a functor \(F\) for any bounded chain complex \(C_.\).