Discrete Morse Theoretic Algorithms for Computing Homology of Complexes and Maps

Foundations of Computational Mathematics

Volumn 14, Issue 1, 2014, Pages 151-184

  Harker, Shaun ^a   Mischaikow, Konstantin ^a   Mrozek, Marian ^b   Nanda, Vidit ^c  

^a RUTGERS UNIVERSITY   (United States)

^b JAGIELLONIAN UNIVERSITY   (Poland)

^c UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Computational homology; Discrete Morse theory

Indexed keywords

EID: 84895063231     PISSN: 16153375     EISSN: 16153383     Source Type: Journal    
DOI: 10.1007/s10208-013-9145-0     Document Type: Article

References (33)

1. M. Allili, T. Kaczynski, An algorithmic approach to the construction of homomorphisms induced by maps in homology, Trans. Am. Math. Soc. 352(5), 2261-2281 (2000).
2. M. Allili, T. Kaczynski, Geometric construction of a coboundary of a cycle, Discrete Comput. Geom. 25(1), 125-140 (2001).
3. Z. Arai, W. Kalies, H. Kokubu, K. Mischaikow, H. Oka, P. Pilarczyk, A database schema for the analysis of global dynamics of multiparameter systems, SIAM J. Appl. Dyn. Syst. 8, 757-789 (2009).
4. CAPD:: RedHom, http://redhom. ii. uj. edu. pl.
5. G. Carlsson, Topology and data, Bull., New Ser., Am. Math. Soc. 46(2), 255-308 (2009).
6. M. K. Chari, On discrete Morse functions and combinatorial decompositions, Discrete Math. 217(1-3), 101-113 (2000). Formal power series and algebraic combinatorics (Vienna, 1997).
7. CHomP, http://chomp. rutgers. edu.
8. C. J. A. Delfinado, H. Edelsbrunner, An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere, Comput. Aided Geom. Des. 12(7), 771-784 (1995). Grid generation, finite elements, and geometric design.
9. P. Dłotko, R. Ghrist, M. Juda, M. Mrozek, Distributed computation of coverage in sensor networks by homological methods, Appl. Algebra Eng. Commun. Comput. 23, 29-58 (2012).
10. P. Dłotko, T. Kaczynski, M. Mrozek, T. Wanner, Coreduction homology algorithm for regular CW-complexes, Discrete Comput. Geom. 46, 361-388 (2011).
11. J.-G. Dumas, F. Heckenbach, D. Saunders, V. Welker, Computing simplicial homology based on efficient smith normal form algorithms, in Algebra, Geometry, and Software Systems, ed. by M. Joswig, N. Takayama (2003), pp. 177-206.
12. H. Edelsbrunner, J. Harer, Persistent homology-a survey, in Surveys on Discrete and Computational Geometry. Contemp. Math., vol. 453 (Am. Math. Soc., Providence, 2008), pp. 257-282.
13. H. Edelsbrunner, J. L. Harer, Computational Topology (Am. Math. Soc., Providence, 2010). An introduction.
14. R. Forman, Morse theory for cell complexes, Adv. Math. 134, 90-145 (1998).
15. R. Ghrist, Barcodes: the persistent topology of data, Bull., New Ser., Am. Math. Soc. 45(1), 61-75 (2008).
16. R. Ghrist, Three examples of applied and computational homology, Nieuw Arch. Wiskd. 9(2), 122-125 (2008).
17. S. Harker, K. Mischaikow, M. Mrozek, V. Nanda, H. Wagner, M. Juda, P. Dłotko, The efficiency of a homology algorithm based on discrete Morse theory and coreductions, in Proceedings of the 3rd International Workshop on Computational Topology in Image Context, vol. 1 (2010), pp. 41-47.
18. A. Hatcher, Algebraic Topology (Cambridge University Press, Cambridge, 2002).
19. T. Kaczynski, K. Mischaikow, M. Mrozek, Computing homology, Homol. Homotopy Appl. 5(2), 233-256 (2003). Algebraic topological methods in computer science (Stanford, CA, 2001).
20. T. Kaczynski, K. Mischaikow, M. Mrozek, Computational Homology. Applied Mathematical Sciences, vol. 157 (Springer, Berlin, 2004).
21. T. Kaczynski, M. Mrozek, M. Ślusarek, Homology computation by reduction of chain complexes, Comput. Math. Appl. 35(4), 59-70 (1998).
22. W. D. Kalies, K. Mischaikow, G. Watson, Cubical approximation and computation of homology, in Conley Index Theory. Banach Center Publ., vol. 47, Warsaw, 1997 (Polish Acad. Sci, Warsaw, 1999), pp. 115-131.
23. D. Kozlov, Combinatorial Algebraic Topology. Algorithms and Computation in Mathematics, vol. 21 (Springer, Berlin, 2008).
24. S. Lefschetz, Algebraic Topology. American Mathematical Society Colloquium Publications, vol. 27 (Am. Math. Soc., New York, 1942).
25. K. Mischaikow, M. Mrozek, P. Pilarczyk, Graph approach to the computation of the homology of continuous maps, Found. Comput. Math. 5(2), 199-229 (2005).
26. M. Mrozek, B. Batko, The coreduction homology algorithm, Discrete Comput. Geom. 41, 96-118 (2009).
27. M. Mrozek, P. Pilarczyk, N. Żelazna, Homology algorithm based on acyclic subspace, Comput. Math. Appl. 55, 2395-2412 (2008).
28. M. Mrozek, T. Wanner, Coreduction homology algorithm for inclusions and persistent homology, Comput. Math. Appl. 60(10), 2812-2833 (2010).
29. M. Mrozek, M. Żelawski, A. Gryglewski, S. Han, A. Krajniak, Homological methods for extraction and analysis of linear features in multidimensional images, Pattern Recognit. 45, 285-298 (2012).
30. Perseus, http://www. math. rutgers. edu/~vidit/perseus. html.
31. B. D. Saunders, Z. Wan, Smith normal form of dense integer matrices, fast algorithms into practice, in Internat. Symp. Symbolic Algebraic Comput. (2004), pp. 274-281.
32. E. H. Spanier, Algebraic Topology (McGraw-Hill, New York, 1966).
33. A. W. Tucker, Cell spaces, Ann. of Math. (2)37(1), 92-100 (1936).