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:
Autores principales: | , |
---|---|
Formato: | JOUR |
Materias: | |
Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_01795376_v58_n1_p144_Capitelli |
Aporte de: |
id |
todo:paper_01795376_v58_n1_p144_Capitelli |
---|---|
record_format |
dspace |
spelling |
todo:paper_01795376_v58_n1_p144_Capitelli2023-10-03T15:08:34Z A Simplicial Complex is Uniquely Determined by Its Set of Discrete Morse Functions Capitelli, N.A. Minian, E.G. Collapsibility Discrete Morse complex Discrete Morse theory 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. Fil:Minian, E.G. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. JOUR info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_01795376_v58_n1_p144_Capitelli |
institution |
Universidad de Buenos Aires |
institution_str |
I-28 |
repository_str |
R-134 |
collection |
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) |
topic |
Collapsibility Discrete Morse complex Discrete Morse theory |
spellingShingle |
Collapsibility Discrete Morse complex Discrete Morse theory Capitelli, N.A. Minian, E.G. A Simplicial Complex is Uniquely Determined by Its Set of Discrete Morse Functions |
topic_facet |
Collapsibility Discrete Morse complex Discrete Morse theory |
description |
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. |
format |
JOUR |
author |
Capitelli, N.A. Minian, E.G. |
author_facet |
Capitelli, N.A. Minian, E.G. |
author_sort |
Capitelli, N.A. |
title |
A Simplicial Complex is Uniquely Determined by Its Set of Discrete Morse Functions |
title_short |
A Simplicial Complex is Uniquely Determined by Its Set of Discrete Morse Functions |
title_full |
A Simplicial Complex is Uniquely Determined by Its Set of Discrete Morse Functions |
title_fullStr |
A Simplicial Complex is Uniquely Determined by Its Set of Discrete Morse Functions |
title_full_unstemmed |
A Simplicial Complex is Uniquely Determined by Its Set of Discrete Morse Functions |
title_sort |
simplicial complex is uniquely determined by its set of discrete morse functions |
url |
http://hdl.handle.net/20.500.12110/paper_01795376_v58_n1_p144_Capitelli |
work_keys_str_mv |
AT capitellina asimplicialcomplexisuniquelydeterminedbyitssetofdiscretemorsefunctions AT minianeg asimplicialcomplexisuniquelydeterminedbyitssetofdiscretemorsefunctions AT capitellina simplicialcomplexisuniquelydeterminedbyitssetofdiscretemorsefunctions AT minianeg simplicialcomplexisuniquelydeterminedbyitssetofdiscretemorsefunctions |
_version_ |
1807324062584668160 |