An algorithmic approach to Dold-Puppe complexes

DOI10.4310/HHA.2010.V12.N1.A15MaRDI QIDQ985317zbMATH OpenOpenAlexFDO

Authors Ramesh Satkurunath, Bernhard Köck

Publication date 21 July 2010

Published in Homology, Homotopy and Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0911.0643, http://intlpress.com/hha/v12/n1/a15/pdf

zbMATH Keywords

simplicial modulecross-effect functorDold-Puppe complex

Mathematics Subject Classification ID

Syzygies, resolutions, complexes and commutative rings (13D02) Grothendieck groups, (K)-theory and commutative rings (13D15) Resolutions; derived functors (category-theoretic aspects) (18G10) Relations of (K)-theory with cohomology theories (19E20)

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.

Recommendations

• Dold-Kan correspondence, revisited
• Cosimplicial versus DG-rings: A version of the Dold-Kan correspondence
• A categorified Dold-Kan correspondence
• Dold-Kan correspondence and differential forms
• Combinatorial categorical equivalences of Dold-Kan type

Cited in

(3)

• Homological- and analytical-preserving serendipity framework for polytopal complexes, with application to the DDR method
• scientific article; zbMATH DE number 4002346 (Why is no real title available?)
• Exterior power operations on higher \(K\)-groups via binary complexes

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)