A Simplicial Complex is Uniquely Determined by Its Set of Discrete Morse Functions

dc.creatorCapitelli, Nicolás Ariel
dc.creatorMinian, Elias Gabriel
dc.date.accessioned2018-08-15T11:15:45Z
dc.date.accessioned2018-11-06T13:04:37Z
dc.date.available2018-08-15T11:15:45Z
dc.date.available2018-11-06T13:04:37Z
dc.date.created2018-08-15T11:15:45Z
dc.date.issued2017-07
dc.identifierCapitelli, Nicolás Ariel; Minian, Elias Gabriel; A Simplicial Complex is Uniquely Determined by Its Set of Discrete Morse Functions; Springer; Discrete And Computational Geometry; 58; 1; 7-2017; 144-157
dc.identifier0179-5376
dc.identifierhttp://hdl.handle.net/11336/55561
dc.identifierCONICET Digital
dc.identifierCONICET
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1872619
dc.description.abstractWe prove that a connected simplicial complex is uniquely determined by its complex of discrete Morse functions. This settles a question raised by Chari and Joswig. In the 1-dimensional case, this implies that the complex of rooted forests of a connected graph G completely determines G.
dc.languageeng
dc.publisherSpringer
dc.relationinfo:eu-repo/semantics/altIdentifier/url/https://link.springer.com/article/10.1007/s00454-017-9865-z
dc.relationinfo:eu-repo/semantics/altIdentifier/url/https://arxiv.org/abs/1509.07457
dc.relationinfo:eu-repo/semantics/altIdentifier/doi/https://doi.org/10.1007/s00454-017-9865-z
dc.rightshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.rightsinfo:eu-repo/semantics/openAccess
dc.subjectCOLLAPSIBILITY
dc.subjectDISCRETE MORSE COMPLEX
dc.subjectDISCRETE MORSE THEORY
dc.titleA Simplicial Complex is Uniquely Determined by Its Set of Discrete Morse Functions
dc.typeArtículos de revistas
dc.typeArtículos de revistas
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución