Abstract
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.
Author supplied keywords
Cite
CITATION STYLE
APA
Capitelli, N. A., & Minian, E. G. (2017). A Simplicial Complex is Uniquely Determined by Its Set of Discrete Morse Functions. Discrete and Computational Geometry, 58(1), 144–157. https://doi.org/10.1007/s00454-017-9865-z
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free