An algorithm to compute minimal Sullivan algebras

In this note, we give an algorithm that starting with a Sullivan algebra gives us its minimal model. This algorithm is a kind of modified AT-model algorithm used to compute in the past other kinds of topology information such as (co)homology, cup products on cohomology and persistent homology. Takin...

ver descrição completa

Detalhes bibliográficos
Autores: Garvín, Antonio, González Díaz, Rocío, Medrano Garfia, Belén
Tipo de documento: artigo
Estado:Versión enviada para evaluación y publicación
Data de publicação:2019
País:España
Recursos:Universidad de Sevilla (US)
Repositório:idUS. Depósito de Investigación de la Universidad de Sevilla
OAI Identifier:oai:idus.us.es:11441/102480
Acesso em linha:https://hdl.handle.net/11441/102480
Access Level:Acceso aberto
Palavra-chave:Sullivan algebras
Minimal models
Chain homotopy
AT-model
Descrição
Resumo:In this note, we give an algorithm that starting with a Sullivan algebra gives us its minimal model. This algorithm is a kind of modified AT-model algorithm used to compute in the past other kinds of topology information such as (co)homology, cup products on cohomology and persistent homology. 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.