Mostrar el registro sencillo del ítem
Artículo
Towards optimality in discrete Morse Theory through chain homotopies
dc.creator | Real Jurado, Pedro | es |
dc.creator | Molina Abril, Helena | es |
dc.date.accessioned | 2015-06-29T10:13:23Z | |
dc.date.available | 2015-06-29T10:13:23Z | |
dc.date.issued | 2010 | es |
dc.identifier.issn | 1885-4508 | es |
dc.identifier.uri | http://hdl.handle.net/11441/26196 | |
dc.description.abstract | Once a discrete Morse function has been defined on a finite cell complex, information about its homology can be deduced from its critical elements. The main objective of this paper is to define optimal discrete gradient vector fields on general finite cell complexes, where optimality entails having the least number of critical elements. Our approach is to consider this problem as a homology computation question for chain complexes endowed with extra algebraic nilpotent operator. | es |
dc.format | application/pdf | es |
dc.language.iso | eng | es |
dc.publisher | Universidad de Sevilla | es |
dc.relation.ispartof | Image-A : Applicable Mathematics in Image Engineering, 1 (1), 33-40 | es |
dc.rights | Atribución-NoComercial-SinDerivadas 4.0 España | es |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | es |
dc.subject | Discrete Morse Theory | es |
dc.subject | Cell complex | es |
dc.subject | Integral-chain complex | es |
dc.subject | Chain homotopy | es |
dc.subject | Graph | es |
dc.subject | Homology | es |
dc.subject | Gradient vector field | es |
dc.title | Towards optimality in discrete Morse Theory through chain homotopies | es |
dc.type | info:eu-repo/semantics/article | es |
dc.type.version | info:eu-repo/semantics/publishedVersion | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
dc.contributor.affiliation | Universidad de Sevilla. Departamento de Matemática Aplicada I | es |
dc.relation.publisherversion | http://institucional.us.es/revistas/imagen_a/1/art_6.pdf | es |
dc.identifier.idus | https://idus.us.es/xmlui/handle/11441/26196 |