Artículo

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

Capitelli, Nicolás ArielIcon ; Minian, Elias GabrielIcon
Fecha de publicación: 07/2017
Editorial: Springer
Revista: Discrete And Computational Geometry
ISSN: 0179-5376
Idioma: Inglés
Tipo de recurso: Artículo publicado
Clasificación temática:

Resumen

We 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.
Palabras clave: Collapsibility , Discrete Morse Complex , Discrete Morse Theory
 
Archivos asociados
Thumbnail
 
Tamaño: 532.5Kb
Formato: PDF
.
Licencia
info:eu-repo/semantics/openAccess Excepto donde se diga explícitamente, este item se publica bajo la siguiente descripción: Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Unported (CC BY-NC-SA 2.5)
Identificadores
URI: http://hdl.handle.net/11336/55561
URL: https://link.springer.com/article/10.1007/s00454-017-9865-z
URL: https://arxiv.org/abs/1509.07457
DOI: https://doi.org/10.1007/s00454-017-9865-z
Colecciones
Articulos(IMAS)
Articulos de INSTITUTO DE INVESTIGACIONES MATEMATICAS "LUIS A. SANTALO"
Citación
Capitelli, 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
Compartir
Altmétricas