Data structures for complexes #25
Description
There should be two more data structures for complexes.
A recursive datastructure:
One should put in some differentials delta_1,...,delta_n anda function creating delta_i from delta_i-j,...delta_i-1. This could be useful, e.g., for resolutions. The recursion then can be done iteratively to not get into any depth trap. Also, caching should be crisp, for not having holes in the list of computed objects. There should also be the possibility to specify how to cleanup the cache. Maybe if one object is deleted, all objects after this object according to the function should be deleted, too.
An extended finite complex:
Some complexes of the type
( C -> ... -> C )^* -> C -> ... -> C -> ( C -> ... -> C )^*
with some periodic part at the beginning and the end, and some finite part in the middle. This would lead to a data structure where we have complete knowledge about the complex.