Discrete Morse theory
Discrete Morse theory is a combinatorial adaptation of Morse theory developed by Robin Forman. The theory has various practical applications in diverse fields of applied mathematics and computer science, such as configuration spaces,{{citation|first1=Francesca|last1= Mori|first2= Mario|last2= Salvetti|journal=Mathematical Research Letters | volume=18 |year=2011|issue= 1|pages= 39–57 |url=http://mrlonline.org/mrl/2011-018-001/2011-018-001-004.pdf|title= (Discrete) Morse theory for Configuration spaces|doi=10.4310/MRL.2011.v18.n1.a4|mr=2770581|doi-access=free}} homology computation,[http://www.sas.upenn.edu/~vnanda/perseus/index.html Perseus]: the Persistent Homology software.{{cite journal|last1=Mischaikow|first1=Konstantin|last2=Nanda|first2=Vidit|title=Morse Theory for Filtrations and Efficient computation of Persistent Homology|journal=Discrete & Computational Geometry|volume=50|issue=2|pages=330–353|doi=10.1007/s00454-013-9529-6|year=2013|doi-access=free}} denoising,{{cite journal
| last1=Bauer | first1=Ulrich
| last2=Lange | first2=Carsten
| last3=Wardetzky | first3=Max
| title=Optimal Topological Simplification of Discrete Functions on Surfaces
| doi=10.1007/s00454-011-9350-z | doi-access=free
| journal=Discrete & Computational Geometry
| volume=47
| pages=347–377
| date=2012| issue=2
| arxiv=1001.1269
}} mesh compression,{{cite journal |last1=Lewiner |first1=T. |last2=Lopes |first2=H. |last3=Tavares |first3=G. |title=Applications of Forman's discrete Morse theory to topology visualization and mesh compression |journal=IEEE Transactions on Visualization and Computer Graphics |volume=10 |issue=5 |pages=499–508 |date=2004 |doi=10.1109/TVCG.2004.18 |pmid=15794132 |s2cid=2185198 |url=http://www.matmidia.mat.puc-rio.br/tomlew/pdfs/morse_apps_tvcg.pdf|archive-url=https://web.archive.org/web/20120426071256/http://www.matmidia.mat.puc-rio.br/tomlew/pdfs/morse_apps_tvcg.pdf |archive-date=2012-04-26 }} and topological data analysis.{{Cite web|url=https://topology-tool-kit.github.io/|title=the Topology ToolKit|date=|website=GitHub.io}}
Notation regarding CW complexes
Let be a CW complex and denote by its set of cells. Define the incidence function in the following way: given two cells and in , let be the degree of the attaching map from the boundary of to . The boundary operator is the endomorphism of the free abelian group generated by defined by
:
It is a defining property of boundary operators that . In more axiomatic definitions{{cite journal|last1=Mischaikow|first1=Konstantin|last2=Nanda|first2=Vidit|title=Morse Theory for Filtrations and Efficient computation of Persistent Homology|journal=Discrete & Computational Geometry|volume=50|issue=2|pages=330–353|doi=10.1007/s00454-013-9529-6|year=2013|doi-access=free}} one can find the requirement that
:
which is a consequence of the above definition of the boundary operator and the requirement that .
Discrete Morse functions
A real-valued function is a discrete Morse function if it satisfies the following two properties:
- For any cell , the number of cells in the boundary of which satisfy is at most one.
- For any cell , the number of cells containing in their boundary which satisfy is at most one.
It can be shown{{harvnb|Forman|1998|loc=Lemma 2.5}} that the cardinalities in the two conditions cannot both be one simultaneously for a fixed cell , provided that is a regular CW complex. In this case, each cell can be paired with at most one exceptional cell : either a boundary cell with larger value, or a co-boundary cell with smaller value. The cells which have no pairs, i.e., whose function values are strictly higher than their boundary cells and strictly lower than their co-boundary cells are called critical cells. Thus, a discrete Morse function partitions the CW complex into three distinct cell collections: , where:
- denotes the critical cells which are unpaired,
- denotes cells which are paired with boundary cells, and
- denotes cells which are paired with co-boundary cells.
By construction, there is a bijection of sets between -dimensional cells in and the -dimensional cells in , which can be denoted by for each natural number . It is an additional technical requirement that for each , the degree of the attaching map from the boundary of to its paired cell is a unit in the underlying ring of . For instance, over the integers , the only allowed values are . This technical requirement is guaranteed, for instance, when one assumes that is a regular CW complex over .
The fundamental result of discrete Morse theory establishes that the CW complex is isomorphic on the level of homology to a new complex consisting of only the critical cells. The paired cells in and describe gradient paths between adjacent critical cells which can be used to obtain the boundary operator on . Some details of this construction are provided in the next section.
The Morse complex
A gradient path is a sequence of paired cells
:
satisfying and . The index of this gradient path is defined to be the integer
:
The division here makes sense because the incidence between paired cells must be . Note that by construction, the values of the discrete Morse function must decrease across . The path is said to connect two critical cells if . This relationship may be expressed as . The multiplicity of this connection is defined to be the integer . Finally, the Morse boundary operator on the critical cells is defined by
:
where the sum is taken over all gradient path connections from to .
Basic results
Many of the familiar results from continuous Morse theory apply in the discrete setting.
=The Morse inequalities=
Let be a Morse complex associated to the CW complex . The number of -cells in is called the -th Morse number. Let denote the -th Betti number of . Then, for any , the following inequalities{{harvnb|Forman|1998|loc=Corollaries 3.5 and 3.6}} hold
:, and
:
Moreover, the Euler characteristic of satisfies
:
=Discrete Morse homology and homotopy type=
Let be a regular CW complex with boundary operator and a discrete Morse function . Let be the associated Morse complex with Morse boundary operator . Then, there is an isomorphism{{harvnb|Forman|1998|loc=Theorem 7.3}} of homology groups
:
and similarly for the homotopy groups.
Applications
Discrete Morse theory finds its application in molecular shape analysis,{{Cite book |last1=Cazals |first1=F. |last2=Chazal |first2=F. |last3=Lewiner |first3=T. |title=Proceedings of the nineteenth annual symposium on Computational geometry |chapter=Molecular shape analysis based upon the morse-smale complex and the connolly function |date=2003 |chapter-url=http://portal.acm.org/citation.cfm?doid=777792.777845 |publisher=ACM Press |pages=351–360 |doi=10.1145/777792.777845 |isbn=978-1-58113-663-0|s2cid=1570976 }} skeletonization of digital images/volumes,{{Cite journal |last1=Delgado-Friedrichs |first1=Olaf |last2=Robins |first2=Vanessa |last3=Sheppard |first3=Adrian |date=March 2015 |title=Skeletonization and Partitioning of Digital Images Using Discrete Morse Theory |url=https://ieeexplore.ieee.org/document/6873268 |journal=IEEE Transactions on Pattern Analysis and Machine Intelligence |volume=37 |issue=3 |pages=654–666 |doi=10.1109/TPAMI.2014.2346172 |pmid=26353267 |hdl=1885/12873 |s2cid=7406197 |issn=1939-3539|hdl-access=free }} graph reconstruction from noisy data,{{Cite conference |last1=Dey |first1=Tamal K. |last2=Wang |first2=Jiayuan |last3=Wang |first3=Yusu |date=2018 |editor-last=Speckmann |editor-first=Bettina |editor2-last=Tóth |editor2-first=Csaba D. |title=Graph Reconstruction by Discrete Morse Theory |url=http://drops.dagstuhl.de/opus/volltexte/2018/8744 |conference=34th International Symposium on Computational Geometry (SoCG 2018) |series=Leibniz International Proceedings in Informatics (LIPIcs) |location=Dagstuhl, Germany |publisher=Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik |volume=99 |pages=31:1–31:15 |doi=10.4230/LIPIcs.SoCG.2018.31 |doi-access=free |isbn=978-3-95977-066-8|s2cid=3994099 }} denoising noisy point clouds{{Cite journal |last=Mukherjee |first=Soham |date=2021-09-01 |title=Denoising with discrete Morse theory |journal=The Visual Computer |volume=37 |issue=9 |pages=2883–94 |doi=10.1007/s00371-021-02255-7 |s2cid=237426675 }} and analysing lithic tools in archaeology.
See also
References
{{Reflist|refs=
|first1=Jan Philipp|last1=Bullenkamp
|first2=Florian|author3-link=Hubert Mara
|last2=Linsel
|first3=Hubert|last3=Mara
|periodical=Proceedings of Eurographics Workshop on Graphics and Cultural Heritage (GCH)
|title=Lithic Feature Identification in 3D based on Discrete Morse Theory
|publisher=Eurographics Association
|location=Delft, Netherlands
|pages=55–58
|issn=2312-6124
|date=2022
|doi=10.2312/VAST/VAST10/131-138
|isbn=9783038681786
|s2cid=17294591
|url=https://diglib.eg.org:443/handle/10.2312/gch20221224
|access-date=2022-10-05}}
}}
{{refbegin}}
- {{cite journal |first=Robin |last=Forman |title=Morse theory for cell complexes |journal=Advances in Mathematics |volume=134 |issue=1 |pages=90–145 |date=1998 |doi=10.1006/aima.1997.1650 | doi-access=free |url=https://core.ac.uk/download/pdf/82268273.pdf}}
- {{cite journal|first=Robin|last= Forman |year=2002| url=http://www.emis.de/journals/SLC/wpapers/s48forman.pdf|title= A user's guide to discrete Morse theory|journal= Séminaire Lotharingien de Combinatoire|volume= 48|pages=Art. B48c, 35 pp|mr=1939695 }}
- {{cite book | first=Dmitry|last= Kozlov | title=Combinatorial algebraic topology | series=Algorithms and Computation in Mathematics|volume= 21 |publisher=Springer |year=2007 | isbn=978-3540719618|mr=2361455}}
- {{cite book | first=Jakob|last= Jonsson | title=Simplicial complexes of graphs | publisher=Springer | year=2007 | isbn=978-3540758587}}
- {{cite book | first1=Peter|last1= Orlik|author1-link=Peter Orlik|first2= Volkmar|last2= Welker | title=Algebraic Combinatorics: Lectures at a Summer School In Nordfjordeid | publisher=Springer|series=Universitext | year=2007 | isbn=978-3540683759|mr=2322081|doi=10.1007/978-3-540-68376-6}}
- {{cite web|url=http://ncatlab.org/nlab/show/discrete+Morse+theory|title=Discrete Morse theory|publisher=nLab}}
{{refend}}