A simplicial complex is uniquely determined by its set of discrete Morse functions

DOI10.1007/S00454-017-9865-ZMaRDI QIDQ2408189zbMATH OpenOpenAlexFDO

Authors Nicolas Ariel Capitelli, Elias Gabriel Minian

Publication date 10 October 2017

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1509.07457, http://hdl.handle.net/11336/55561

zbMATH Keywords

collapsibilitydiscrete Morse complexdiscrete Morse theory

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial aspects of simplicial complexes (05E45) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Relations of low-dimensional topology with graph theory (57M15) General topology of complexes (57Q05)

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.

Recommendations

• Complexes of discrete Morse functions
• Characterizing equivalent discrete Morse functions
• On the homotopy and strong homotopy type of complexes of discrete Morse functions
• On the automorphism group of the Morse complex
• The realization problem for discrete Morse functions on trees

Cites work

• A note on the pure Morse complex of a graph
• Complexes of Directed Graphs
• Complexes of directed trees
• Complexes of directed trees and independence complexes
• Complexes of discrete Morse functions
• scientific article; zbMATH DE number 3329602 (Why is no real title available?)
• Morse theory for cell complexes
• On discrete Morse functions and combinatorial decompositions
• Proof of the Lovász conjecture
• Shellability of complexes of directed trees
• Witten-Morse theory for cell complexes

Cited in

(6)

• Higher connectivity of the Morse complex
• Filtered matchings and simplicial complexes
• On the homotopy and strong homotopy type of complexes of discrete Morse functions
• The connectedness homomorphism between discrete Morse complexes
• Connecting discrete Morse functions via birth-death transitions
• On the automorphism group of the Morse complex

This page was built for publication: A simplicial complex is uniquely determined by its set of discrete Morse functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2408189)