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...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión enviada para evaluación y publicación |
| Fecha de publicación: | 2019 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/102480 |
| Acceso en línea: | https://hdl.handle.net/11441/102480 |
| Access Level: | acceso abierto |
| Palabra clave: | Sullivan algebras Minimal models Chain homotopy AT-model |
| Sumario: | 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. |
|---|