A Simplicial Complex is Uniquely Determined by Its Set of Discrete Morse Functions
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. © 2017, Sprin...
Guardado en:
| Autor principal: | |
|---|---|
| Publicado: |
2017
|
| Materias: | |
| Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_01795376_v58_n1_p144_Capitelli http://hdl.handle.net/20.500.12110/paper_01795376_v58_n1_p144_Capitelli |
| Aporte de: |
| Sumario: | 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. © 2017, Springer Science+Business Media New York. |
|---|