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

DOI10.1007/s00454-017-9865-zzbMath1371.05326arXiv1509.07457OpenAlexW2962949302MaRDI QIDQ2408189

Elias Gabriel Minian, Nicolas Ariel Capitelli

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

zbMATH Keywords

collapsibilitydiscrete Morse theorydiscrete Morse complex

Mathematics Subject Classification ID

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

Related Items (4)

On the automorphism group of the Morse complex ⋮ On the homotopy and strong homotopy type of complexes of discrete Morse functions ⋮ Higher connectivity of the Morse complex ⋮ Filtered matchings and simplicial complexes

Cites Work

• Unnamed Item
• A note on the pure Morse complex of a graph
• Complexes of directed trees and independence complexes
• Witten-Morse theory for cell complexes
• Morse theory for cell complexes
• Complexes of directed trees
• On discrete Morse functions and combinatorial decompositions
• Proof of the Lovász conjecture
• Complexes of discrete Morse functions
• Complexes of Directed Graphs
• Shellability of complexes of directed trees

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