Computing Optimal Discrete Morse Functions

The essential structural information of discrete Morse functions is captured by so-called Morse matchings. We show that computing optimal Morse matchings is NP -hard and give an integer programming formulation for the problem. Then we present first polyhedral results for the corresponding polytope and report on some preliminary computational results.