Resumen de Making Sullivan Algebras Minimal Through Chain Contractions
Antonio José Garvín García, María del Rocío González Díaz, Miguel A. Marco Buzunáriz, Belén Medrano Garfia
In this note, we provide an algorithm that, starting with a Sullivan algebra gives us its minimal model. More concretely, taking as input a (non-minimal) Sullivan algebra A with an ordered finite set of generators preserving the filtration defined on A, we obtain as output a minimal Sullivan algebra with the same rational cohomology as A. This algorithm is a kind of modified AT-model algorithm used, in the past, to compute a chain contraction providing other kinds of topological information such as (co)homology, cup products on cohomology and persistent homology.
