zbMATH — the first resource for mathematics

Extending persistence using Poincaré and Lefschetz duality. (English) Zbl 1189.55002
Let \(K\) be a simplicial complex and \(f\) an injective function on its vertices, so that the vertices \(\{u_1,\dots,u_n\}\) are ordered: \(f(u_1)<\cdots<f(u_n)\). Define \(K_i\) to be the subcomplex spanned by \(\{u_1,\dots,u_i\}\). For fixed \(p\), inclusion gives a sequence of homology groups \(H_p(K_i)\) with coefficients in the field of order two. A class in \(H_p(K_i)\) is said to be born at \(K_i\) if it is not in the image of \(H_p(K_{i-1})\rightarrow H_p(K_i)\), and the class dies at \(K_j\) if its image in \(H_p(K_j)\) is in the image of \(H_p(K_{i-1})\rightarrow H_p(K_j)\), but its image in \(H_p(K_{j-1})\) is not in the image of \(H_p(K_{i-1})\rightarrow H_p(K_{j-1})\). A persistence diagram consists of the multiset of points \((f(u_i),f(u_j))\) in the extended plane for which there is a class that is born at \(K_i\) and dies at \(K_j\); note that the second coordinate of such a point may be infinite, since a class does not necessarily die.
To define the notion of extended persistence, the authors let \(L_{n-i}\) be the subcomplex of \(K\) spanned by \(\{u_{i+1},\dots,u_n\}\) and define \(K_{n+i}\doteq(K,L_i)\), thereby extending the above filtration \(\{K_i\}_{1\leq i\leq n}\) to allow for indices \(1\leq i\leq 2n\). All classes in extended persistence necessarily die. The authors discuss using extended persistence to choose an optimal homology basis, an algorithm to compute extended persistence, and the stability of extended persistence diagrams under different choices of the function \(f\). Also discussed is the case when \(K\) is a simplicial manifold of dimension \(d\): Poincaré and Lefschetz duality imply a pairing between \(p\)-th persistence and \((d-p)\)-th persistence, and in particular, their diagrams are reflections of each other.
The authors target an audience that is familiar with the homology of a simplicial complex and with some knowledge of computational topology; knowledge of persistent homology and Morse function theory is helpful but not necessary. The article is well-written, but the overall exposition could have been more focused.

55N99 Homology and cohomology theories in algebraic topology
68W30 Symbolic computation and algebraic computation
57Q99 PL-topology
Full Text: DOI
[1] P.K. Agarwal, H. Edelsbrunner, J. Harer, Y. Wang, Extreme elevation on a 2-manifold, Discrete Comput. Geom. 36, 553–572 (2006). · Zbl 1105.52010 · doi:10.1007/s00454-006-1265-8
[2] D. Cohen-Steiner, H. Edelsbrunner, D. Morozov, Vines and vineyards by updating persistence in linear time, in Proc. 22nd Ann. Sympos. Comput. Geom., 2006, pp. 119–126. · Zbl 1153.68388
[3] D. Cohen-Steiner, H. Edelsbrunner, J. Harer, Stability of persistence diagrams, Discrete Comput. Geom. 37, 103–120 (2007). · Zbl 1117.54027 · doi:10.1007/s00454-006-1276-5
[4] M.L. Connolly, Shape complementarity at the hemo-globin albl subunit interface, Biopolymers 25, 1229–1247 (1986). · doi:10.1002/bip.360250705
[5] H. Edelsbrunner, D. Letscher, A. Zomorodian, Topological persistence and simplification, Discrete Comput. Geom. 28, 511–533 (2002). · Zbl 1011.68152
[6] R. Gonzáles-Díaz, P. Real, On the cohomology of 3D digital images, Discrete Appl. Math. 147, 245–263 (2005). · Zbl 1099.68120 · doi:10.1016/j.dam.2004.09.014
[7] N. Gelfand, N.J. Mitra, L.J. Guibas, H. Pottmann, Robust global registration, in Proc. Sympos. Geom. Process., 2005, pp. 197–206.
[8] M. Hilaga, Y. Shinagawa, T. Komura, T.L. Kunii, Topology matching for fully automatic similarity estimation of 3D shapes, in Computer Graphics Proc., Siggraph 2001, pp. 203–212.
[9] J.R. Munkres, Elements of Algebraic Topology (Addison-Wesley, Redwood City, 1984).
[10] G. Reeb, Sur les points singuliers d’une forme de Pfaff complèment intégrable ou d’une fonction numérique, C. R. Acad. Sci. 222, 847–849 (1946). · Zbl 0063.06453
[11] Y. Wang, P.K. Agarwal, P. Brown, H. Edelsbrunner, J. Rudolph, Coarse and reliable geometric alignment for protein docking, in Proc. Pacific Sympos. Biocomput., 2005, pp. 65–75.
[12] A. Zomorodian, G. Carlsson, Computing persistent homology, Discrete Comput. Geom. 33, 249–274 (2005). · Zbl 1069.55003 · doi:10.1007/s00454-004-1146-y
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.