Zigzag persistent homology in matrix multiplication time

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2011, Pages 216-225

  Milosavljević, Nikola ^a   Morozov, Dmitriy ^b   Škraba, Primož ^c  

^a MAX PLANCK INSTITUTE   (Germany)

^b STANFORD UNIVERSITY   (United States)

^c INRIA SACLAY   (France)

Author keywords

Matrix multiplication; Zigzag persistent homology

Indexed keywords

ALGEBRAIC STRUCTURES; MATRIX MULTIPLICATION; MATRIX MULTIPLICATION TIME; PERSISTENT HOMOLOGY; RUNNING TIME; SIMPLICIAL COMPLEX; WINOGRAD; WORST CASE;

ALGORITHMS; COMPUTATIONAL GEOMETRY;

MATRIX ALGEBRA;

EID: 79960165023     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1998196.1998229     Document Type: Conference Paper

References (27)

1. H. Edelsbrunner, D. Letscher, and A. Zomorodian. Topological persistence and simplification. Discrete Comput. Geom., 28:511-533, 2002. (Pubitemid 36161396)
2. A. Zomorodian and G. Carlsson. Computing Persistent Homology. Discrete Comput. Geom., 33(2):249-274, 2005. (Pubitemid 40176437)
3. D. Cohen-Steiner, H. Edelsbrunner, and J. Harer. Stability of persistence diagrams. Discrete and Computational Geometry, 37(1):103-120, 2007.
4. H. Edelsbrunner and J. Harer. Persistent homology | a survey. Surveys on Discrete and Computational Geometry. Twenty Years, pages 257-282, 2008.
5. G. Carlsson and V. de Silva. Zigzag persistence. Foundations of Computational Mathematics, 10(4):367-405, August 2010.
6. G. Carlsson, V. de Silva, and D. Morozov. Zigzag persistent homology and real-valued functions. In Proceedings of the Annual Symposium on Computational Geometry, pages 247-256, 2009.
7. W. Eberly, M. Giesbrecht, and G. Villard. On computing the determinant and smith form of an integer matrix. In Proceedings of Symposium on the Foundations of Computer Science, pages 675-685, 2000. (Pubitemid 32075936)
8. J.R. Munkres. Elements of Algebraic Topology. Westview Press, 1984.
9. T. Kaczynski, K. Mischaikow, and M. Mrozek. Computational Homology. Springer, 2004.
10. N. Milosavljevic, D. Morozov, and P. Skraba. Zigzag Persistent Homology in Matrix Multiplication Time. Research Report RR-7393, INRIA, 2010.
11. J. R. Bunch and J.E. Hopcroft. Triangular Factorization and Inversion by Fast Matrix Multiplication. Mathematics of Computation, 28+(125):231-236, 1974.
12. M. Mucha and P. Sankowski. Maximum matchings via gaussian elimination. In Foundations of Computer Science, 2004. Proceedings. 45th Annual IEEE Symposium on, pages 248 - 255, Oct. 2004. (Pubitemid 40575286)
13. J. A. Harvey N. Algebraic structures and algorithms for matching and matroid problems. In Foundations of Computer Science, 2006. FOCS '06. 47th Annual IEEE Symposium on, pages 531-542, Oct 2006.
14. C. J. A. Delfinado and H. Edelsbrunner. An incremental algorithm for Betti numbers of simplicial complexes. In SCG '93: Proceedings of the ninth annual symposium on Computational geometry, pages 232-239, New York, NY, USA, 1993. ACM.
15. J. Friedman. Computing Betti numbers via combinatorial Laplacians. In STOC '96: Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, pages 386-391, New York, NY, USA, 1996. ACM.
16. D. Cohen-Steiner, H. Edelsbrunner, and J. Harer. Extending Persistence Using Poincarè and Lefschetz Duality. Found. Comput. Math., 9(1):79-103, 2009.
17. D. Cohen-Steiner, H. Edelsbrunner, J. Harer, and D. Morozov. Persistent homology for kernels, images, and cokernels. In SODA '09: Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1011-1020, Philadelphia, PA, USA, 2009. Society for Industrial and Applied Mathematics.
18. D. Morozov. Homological Illusions of Persistence and Stability. PhD thesis, Duke University, August 2008.
19. M. Mrozek, P. Pilarczyk, and N. Zelazna. Homology algorithm based on acyclic subspace. Comput. Math. Appl., 55(11):2395-2412, 2008. (Pubitemid 351508386)
20. T. Lewiner, H. Lopes, and G. Tavares. Optimal discrete Morse functions for 2-manifolds. Comput. Geom. Theory Appl., 26(3):221-233, 2003.
21. Ö. Eǧecioǧlu and T.F. Gonzalez. A computationally intractable problem on simplicial complexes. Comput. Geom. Theory Appl., 6(2):85-98, 1996. (Pubitemid 126375224)
22. M. Joswig and M.E. Pfetsch. Computing Optimal Morse Matchings. SIAM J. Discret. Math., 20(1):11-25, 2006. (Pubitemid 46352081)
23. A. Zomorodian. The Tidy Set: A Minimal Simplicial Set for Computing Homology of Clique Complexes. In Proc. ACM Symposium of Computational Geometry, pages 257-266, 2010.
24. V. Strassen. Gaussian Elimination is not Optimal. Numer. Math., 13:354-356, 1969.
25. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. J. Symb. Comput., 9(3):251-280, 1990.
26. H. Cohn, R. Kleinberg, B. Szegedy, and C. Umans. Group-theoretic Algorithms for Matrix Multiplication. In FOCS '05: Proceedings of the Symposium on Foundations of Computer Science, pages 379-388, Washington, DC, USA, 2005. IEEE Computer Society. (Pubitemid 44375748)
27. A. Hatcher. Algebraic Topology. Cambridge Univ. Press, 2001.