Discrete Morse Functions from Fourier Transforms
Engström, Alexander
Experiment. Math., Tome 18 (2009) no. 1, p. 45-54 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
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.
Publié le : 2009-05-15
Classification:  Discrete Morse theory,  Fourier transforms,  simplicial complexes,  Boolean functions,  57Q99,  57R70,  42B10 
@article{1243430528,
     author = {Engstr\"om, Alexander},
     title = {Discrete Morse Functions from Fourier Transforms},
     journal = {Experiment. Math.},
     volume = {18},
     number = {1},
     year = {2009},
     pages = { 45-54},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1243430528}
}

Engström, Alexander. Discrete Morse Functions from Fourier Transforms. Experiment. Math., Tome 18 (2009) no. 1, pp.  45-54. http://gdmltest.u-ga.fr/item/1243430528/