Discrete Morse theoretic algorithms for computing homology of complexes and maps
We provide explicit and efficient reduction algorithms based on discrete Morse theory to simplify homology computation for a very general class of complexes. A set-valued map of top-dimensional cells between such complexes is a natural discrete approximation of an underlying (and possibly unknown) c...
Hoofdauteurs: | Harker, S, Mischaikow, K, Mrozek, M, Nanda, V |
---|---|
Formaat: | Journal article |
Gepubliceerd in: |
Springer Verlag
2013
|
Gelijkaardige items
-
Morse theory for filtrations and efficient computation of persistent homology
door: Mischaikow, K, et al.
Gepubliceerd in: (2013) -
Computational homology /
door: 381894 Kaczynski, Tomasz, et al.
Gepubliceerd in: (2004) -
Discrete Morse theory and localization
door: Nanda, V
Gepubliceerd in: (2018) -
Discrete Morse theory for computing cellular sheaf cohomology
door: Curry, J, et al.
Gepubliceerd in: (2015) -
Discrete Morse theory and classifying spaces
door: Nanda, V, et al.
Gepubliceerd in: (2018)