A discrete Morse function on a simplicial complex describes how to construct a homotopy-equivalent CW-complex with possibly fewer cells. We associate a Boolean function with a given simplicial complex and construct a discrete Morse function using its Fourier transform.
Methods from theoretical computer science by O’Donnell, Saks, Schramm, and Servedio, together with experimental data on complexes from Hachimori’s library and on chessboard complexes, provide some evidence that the constructed discrete Morse functions are efficient.
"Discrete Morse Functions from Fourier Transforms." Experiment. Math. 18 (1) 45 - 54, 2009.