Simplicial perturbation techniques and effective homology
In this paper, we deal with the problem of the computation of the homology of a finite simplicial complex after an “elementary simplicial perturbation” process such as the inclusion or elimination of a maximal simplex or an edge contraction. To this aim we compute an algebraic topological model that...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | capítulo de libro |
| Fecha de publicación: | 2006 |
| 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/30783 |
| Acceso en línea: | http://hdl.handle.net/11441/30783 https://doi.org/10.1007/11870814_14 |
| Access Level: | acceso abierto |
| Palabra clave: | Symbolic and Algebraic Manipulation Programming Techniques Discrete Mathematics in Computer Science Algorithm Analysis and Problem Complexity Math Applications in Computer Science Algorithms |
| Sumario: | In this paper, we deal with the problem of the computation of the homology of a finite simplicial complex after an “elementary simplicial perturbation” process such as the inclusion or elimination of a maximal simplex or an edge contraction. To this aim we compute an algebraic topological model that is a special chain homotopy equivalence connecting the simplicial complex with its homology (working with a field as the ground ring). |
|---|