Advertisement

The fiber of the persistence map for functions on the interval

  • Justin CurryEmail author
Article
  • 1 Downloads

Abstract

In this paper we study functions on the interval that have the same persistent homology, which is what we mean by the fiber of the persistence map. By imposing an equivalence relation called graph-equivalence, the fiber of the persistence map becomes finite and a precise enumeration is given. Graph-equivalence classes are indexed by chiral merge trees, which are binary merge trees where a left-right ordering of the children of each vertex is given. Enumeration of merge trees and chiral merge trees with the same persistence makes essential use of the Elder Rule, which is given its first detailed proof in this paper.

Keywords

Persistent homology Inverse problems Combinatorics 

Notes

Acknowledgements

The first real step forward on this problem happened in conversations with Hans Riess, who was an undergraduate at Duke at the time. It was there that the author developed a method for constructing at least one function realizing any suitable barcode. A full characterization of the fiber of the persistence map was obtained after conversations with Yuliy Baryshnikov at ICERM and with John Harer at Duke. Yuliy Baryshnikov first introduced the concept of a chiral barcode associated to a time series in June 2015 in a talk at a conference on Geometry and Data Analysis at the Stevanovich Center for Financial Mathematics, the author then used the underlying concept of a chiral merge tree to create multiple realizations of a single barcode. Finally, John Harer helped cinch the counting result by pointing out the restriction that the Elder Rule imposed on chiral merge trees. The author believes that the conversations with Yuliy and John provided critical insights at the heart of this paper. Other discussions have benefited subsequent revisions of this paper. Rachel Levanger pointed out a deficiency in an earlier version of Definition 4.1. Elizabeth Munch and Anastasios Stefanou first made the connection between interleavings and certain labeled merge trees that eventually appeared in their work (Munch and Stefanou 2018). The author received several helpful comments from each of the anonymous referees, which helped improve the paper. One comment in particular caused the author to think more carefully about maps of ordered merge trees.

Compliance with ethical standards

Conflicts of interest

The author states that there is no conflicts of interest.

References

  1. Arnol’d, V.I.: The calculus of snakes and the combinatorics of bernoulli, euler and springer numbers of coxeter groups. Russ. Math. Surv. 47(1), 1–51 (1992)CrossRefzbMATHGoogle Scholar
  2. Bayoumi, B.I., El-Zahar, M.H., Khamis, S.M.: Counting two-dimensional posets. Discrete Math. 131(1–3), 29–37 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  3. Bubenik, P., De Silva, V., Scott, J.: Metrics for generalized persistence modules. Found. Comput. Math. 15(6), 1501–1531 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  4. Carlsson, G.: Topology and data. Bull. Am. Math. Soc. 46(2), 255–308 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  5. Chazal, F., de Silva, V., Glisse, M., Oudot, S.: The structure and stability of persistence modules (2012). arXiv preprint arXiv:1207.3674
  6. Cohen-Steiner, D., Edelsbrunner, H., Harer, J.: Stability of persistence diagrams. Discrete Comput. Geom. 37(1), 103–120 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  7. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. The MIT Press, Cambridge (2009)zbMATHGoogle Scholar
  8. Crawley-Boevey, W.: Decomposition of pointwise finite-dimensional persistence modules (2012). arXiv preprint arXiv:1210.0819
  9. Curry, J.M.: Topological data analysis and cosheaves. Jpn. J. Ind. Appl. Math. 32(2), 333–371 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  10. Curry, J., Patel, A..: Classification of constructible cosheaves (2016). arXiv e-prints http://arxiv.org/abs/1603.01587
  11. Curry, J., Ghrist, R., Robinson, M.: Euler calculus with applications to signals and sensing. Proc. Symp. Appl. Math. 70, 75–146 (2012). arXiv:1202.0275 [math.AT]
  12. De Silva, V., Munch, E., Stefanou, A.: Theory of interleavings on categories with a flow. Theory Appl. Categ. 33(21), 583–607 (2018)MathSciNetzbMATHGoogle Scholar
  13. Edelsbrunner, H., Harer, J.: Computational Topology: An Introduction. American Mathematical Soc, Boston (2010)zbMATHGoogle Scholar
  14. Edelsbrunner, H., Letscher, D., Zomorodian, A.: Topological persistence and simplification. In Proceedings 41st Annual Symposium on Foundations of Computer Science, pp. 454–463. IEEE (2000)Google Scholar
  15. Gabriel, P.: Unzerlegbare darstellungen i. Manuscr. Math. 6(1), 71–103 (1972)MathSciNetCrossRefzbMATHGoogle Scholar
  16. Ghrist, R.: Barcodes: the persistent topology of data. Bull. Am. Math. Soc. 45, 61–75 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  17. Lesnick, M.: The theory of the interleaving distance on multidimensional persistence modules. Found. Comput. Math. 15(3), 613–650 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  18. Morozov, D., Beketayev, K., Weber, G.: Interleaving distance between merge trees. Discrete Comput. Geom. 49(22–45), 52 (2013)Google Scholar
  19. Munch, E., Stefanou, A.: The \(\ell ^\infty \)-cophenetic metric for phylogenetic trees as an interleaving distance (2018). arXiv:1803.07609 [cs.CG]
  20. Patel, A.: Generalized persistence diagrams. J. Appl. Comput. Topol. 1(3–4), 397–419 (2018)CrossRefzbMATHGoogle Scholar
  21. Schapira, P.: Operations on constructible functions. J.Pure Appl. Algebra 72(1), 83–93 (1991)MathSciNetCrossRefzbMATHGoogle Scholar
  22. Zomorodian, A., Carlsson, G.: Computing persistent homology. Discrete Comput. Geom. 33(2), 249–274 (2005)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.University at Albany SUNYAlbanyUSA

Personalised recommendations