An algorithmic approach to Dold-Puppe complexes

From MaRDI portal



Abstract: A Dold-Puppe complex is the image NFGamma(C.) of a chain complex C. under the composition of the functors Gamma, F and N where Gamma and N are given by the Dold-Kan correspondence and F is a not-necessarily linear functor between two abelian categories. The first half of this paper gives an algorithm that streamlines the calculation of Gamma(C.). The second half gives an algorithm that allows the explicit calculation of the Dold-Puppe complex NFGamma(C.) in terms of the cross-effect functors of F.


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_.\).











This page was built for publication: An algorithmic approach to Dold-Puppe complexes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q985317)