{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:40:00Z","timestamp":1759333200885,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,8,18]],"date-time":"2023-08-18T00:00:00Z","timestamp":1692316800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,8,18]],"date-time":"2023-08-18T00:00:00Z","timestamp":1692316800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"crossref","award":["JP16K17638","JP 19H00834"],"award-info":[{"award-number":["JP16K17638","JP 19H00834"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency","doi-asserted-by":"publisher","award":["JPMJCR15D3"],"award-info":[{"award-number":["JPMJCR15D3"]}],"id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency","doi-asserted-by":"crossref","award":["JPMJPR1923","JPMJMI18G3"],"award-info":[{"award-number":["JPMJPR1923","JPMJMI18G3"]}],"id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Osaka City University Advanced Mathematical Institute","award":["JPMXP0619217849"],"award-info":[{"award-number":["JPMXP0619217849"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2023,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper tackles the problem of coefficient field choice in persistent homology. When we compute a persistence diagram, we need to select a coefficient field before computation. We should understand the dependence of the diagram on the coefficient field to facilitate computation and interpretation of the diagram. We clarify that the dependence is strongly related to the torsion part of <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mathbb {Z}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>Z<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> relative homology in the filtration. We show the sufficient and necessary conditions of the independence of coefficient field choice. An efficient algorithm is proposed to verify the independence. A slight modification of the standard persistence algorithm gives the verification algorithm. In a numerical experiment with the algorithm, a persistence diagram rarely changes even when the coefficient field changes if we consider a filtration in\u00a0<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mathbb {R}^3$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mrow>\n                      <mml:mi>R<\/mml:mi>\n                    <\/mml:mrow>\n                    <mml:mn>3<\/mml:mn>\n                  <\/mml:msup>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. The experiment suggests that, in practical terms, changes in the field coefficient will not change persistence diagrams when the data are in\u00a0<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mathbb {R}^3$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mrow>\n                      <mml:mi>R<\/mml:mi>\n                    <\/mml:mrow>\n                    <mml:mn>3<\/mml:mn>\n                  <\/mml:msup>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>.<\/jats:p>","DOI":"10.1007\/s00454-023-00544-7","type":"journal-article","created":{"date-parts":[[2023,8,18]],"date-time":"2023-08-18T17:19:53Z","timestamp":1692379193000},"page":"645-670","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Field Choice Problem in Persistent Homology"],"prefix":"10.1007","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7207-7280","authenticated-orcid":false,"given":"Ippei","family":"Obayashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9339-3357","authenticated-orcid":false,"given":"Michio","family":"Yoshiwaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,18]]},"reference":[{"key":"544_CR1","doi-asserted-by":"crossref","unstructured":"Bauer, U., Kerber, M., Reininghaus, J., Wagner, H.: Phat \u2013 persistent homology algorithms toolbox. J. Symbol. Comput. 78, 76\u201390 (2017)","DOI":"10.1016\/j.jsc.2016.03.008"},{"key":"544_CR2","doi-asserted-by":"crossref","unstructured":"Boissonnat, J.-D., Maria, C.: Computing persistent homology with various coefficient fields in a single pass. In: 22nd Annual European Symposium on Algorithms (Wroc\u0142aw 2014). Lecture Notes in Computer Science, vol. 8737, pp. 185\u2013196. Springer, Heidelberg (2014)","DOI":"10.1007\/978-3-662-44777-2_16"},{"issue":"5","key":"544_CR3","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.1007\/s10208-020-09482-9","volume":"21","author":"P Bubenik","year":"2021","unstructured":"Bubenik, P., Mili\u0107evi\u0107, N.: Homological algebra for persistence modules. Found. Comput. Math. 21(5), 1233\u20131278 (2021)","journal-title":"Found. Comput. Math."},{"issue":"2","key":"544_CR4","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1090\/S0273-0979-09-01249-X","volume":"46","author":"G Carlsson","year":"2009","unstructured":"Carlsson, G.: Topology and data. Bull. Am. Math. Soc. 46(2), 255\u2013308 (2009)","journal-title":"Bull. Am. Math. Soc."},{"issue":"1","key":"544_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11263-007-0056-x","volume":"76","author":"G Carlsson","year":"2008","unstructured":"Carlsson, G., Ishkhanov, T., de Silva, V., Zomorodian, A.: On the local behavior of spaces of natural images. Int. J. Comput. Vis. 76(1), 1\u201312 (2008)","journal-title":"Int. J. Comput. Vis."},{"issue":"46","key":"544_CR6","doi-asserted-by":"publisher","first-page":"18566","DOI":"10.1073\/pnas.1313480110","volume":"110","author":"JM Chan","year":"2013","unstructured":"Chan, J.M., Carlsson, G., Rabadan, R.: Topology of viral evolution. Proc. Natl. Acad. Sci. U.S.A. 110(46), 18566\u201318571 (2013)","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"key":"544_CR7","doi-asserted-by":"crossref","unstructured":"Chazal, F., Cohen-Steiner, D., Glisse, M., Guibas, L.J., Oudot, S.Y.: Proximity of persistence modules and their diagrams. In: 25th Annual Symposium on Computational Geometry (Aarhus 2009), pp. 237\u2013246. ACM, New York (2009)","DOI":"10.1145\/1542362.1542407"},{"key":"544_CR8","unstructured":"Chen, C., Kerber, M.: Persistent homology computation with a twist. In: 27th European Workshop on Computational Geometry (Morschach 2011), pp. 197\u2013200. https:\/\/eurocg11.inf.ethz.ch\/docs\/Booklet.pdf"},{"issue":"1","key":"544_CR9","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s00454-006-1276-5","volume":"37","author":"D Cohen-Steiner","year":"2007","unstructured":"Cohen-Steiner, D., Edelsbrunner, H., Harer, J.: Stability of persistence diagrams. Discrete Comput. Geom. 37(1), 103\u2013120 (2007)","journal-title":"Discrete Comput. Geom."},{"key":"544_CR10","doi-asserted-by":"crossref","unstructured":"Cohen-Steiner, D., Edelsbrunner, H., Morozov, D.: Vines and vineyards by updating persistence in linear time. In: 22nd Annual Symposium on Computational Geometry (Sedona 2006), pp. 119\u2013126. ACM, New York (2006)","DOI":"10.1145\/1137856.1137877"},{"issue":"4","key":"544_CR11","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1137\/100800245","volume":"40","author":"TK Dey","year":"2011","unstructured":"Dey, T.K., Hirani, A.N., Krishnamoorthy, B.: Optimal homologous cycles, total unimodularity, and linear programming. SIAM J. Comput. 40(4), 1026\u20131044 (2011)","journal-title":"SIAM J. Comput."},{"key":"544_CR12","doi-asserted-by":"crossref","unstructured":"Edelsbrunner, H.: Smooth surfaces for multi-scale shape representation. In: Foundations of Software Technology and Theoretical Computer Science (Bangalore 1995). Lecture Notes in Computer Science, vol. 1026, pp. 391\u2013412. Springer, Berlin (1995)","DOI":"10.1007\/3-540-60692-0_63"},{"key":"544_CR13","volume-title":"Computational Topology: An Introduction","author":"H Edelsbrunner","year":"2010","unstructured":"Edelsbrunner, H., Harer, J.L.: Computational Topology: An Introduction. American Mathematical Society, Providence (2010)"},{"issue":"4","key":"544_CR14","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/s00454-002-2885-2","volume":"28","author":"H Edelsbrunner","year":"2002","unstructured":"Edelsbrunner, H., Letscher, D., Zomorodian, A.: Topological persistence and simplification. Discrete Comput. Geom. 28(4), 511\u2013533 (2002)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"544_CR15","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/174462.156635","volume":"13","author":"H Edelsbrunner","year":"1994","unstructured":"Edelsbrunner, H., M\u00fccke, E.P.: Three-dimensional alpha shapes. ACM Trans. Graph. 13(1), 43\u201372 (1994)","journal-title":"ACM Trans. Graph."},{"key":"544_CR16","unstructured":"Gakhar, H., Perea, J.A.: K\u00fcnneth formulae in persistent homology (2019). arXiv:1910.05656"},{"key":"544_CR17","volume-title":"Algebraic Topology","author":"A Hatcher","year":"2002","unstructured":"Hatcher, A.: Algebraic Topology. Cambridge University Press, Cambridge (2002)"},{"issue":"26","key":"544_CR18","doi-asserted-by":"publisher","first-page":"7035","DOI":"10.1073\/pnas.1520877113","volume":"113","author":"Y Hiraoka","year":"2016","unstructured":"Hiraoka, Y., Nakamura, T., Hirata, A., Escolar, E.G., Matsue, K., Nishiura, Y.: Hierarchical structures of amorphous solids characterized by persistent homology. Proc. Natl. Acad. Sci. U.S.A. 113(26), 7035\u20137040 (2016)","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"issue":"2","key":"544_CR19","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1002\/rsa.20718","volume":"51","author":"Y Hiraoka","year":"2017","unstructured":"Hiraoka, Y., Shirai, T.: Minimum spanning a cycle and lifetime of persistent homology in the Linial\u2013Meshulam process. Random Struct. Algorithms 51(2), 315\u2013340 (2017)","journal-title":"Random Struct. Algorithms"},{"key":"544_CR20","unstructured":"Hu, X., Li, F., Samaras, D., Chen, C.: Topology-preserving deep image segmentation. In: Advances in Neural Information Processing Systems (NIPS), vol.\u00a032. Curran Associates, Red Hook (2019)"},{"key":"544_CR21","doi-asserted-by":"crossref","unstructured":"Ichinomiya, T., Obayashi, I., Hiraoka, Y.: Persistent homology analysis of craze formation. Phys. Rev.\u00a0E 95, #\u00a0012504 (2017)","DOI":"10.1103\/PhysRevE.95.012504"},{"issue":"3","key":"544_CR22","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1080\/10586458.2018.1473821","volume":"29","author":"M Kahle","year":"2020","unstructured":"Kahle, M., Lutz, F.H., Newman, A., Parsons, K.: Cohen\u2013Lenstra heuristics for torsion in homology of random complexes. Exp. Math. 29(3), 347\u2013359 (2020)","journal-title":"Exp. Math."},{"key":"544_CR23","doi-asserted-by":"crossref","unstructured":"Kimura, M., Obayashi, I., Takeichi, Y., Murao, R., Hiraoka, Y.: Non-empirical identification of trigger sites in heterogeneous processes using persistent homology. Sci. Rep. 8, #\u00a03553 (2018)","DOI":"10.1038\/s41598-018-21867-z"},{"key":"544_CR24","unstructured":"Knuth, D.E.: The Art of Computer Programming. Vol.\u00a03: Sorting and Searching. Addison-Wesley, Reading (1998)"},{"issue":"4","key":"544_CR25","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s00493-006-0027-9","volume":"26","author":"N Linial","year":"2006","unstructured":"Linial, N., Meshulam, R.: Homological connectivity of random $$2$$-complexes. Combinatorica 26(4), 475\u2013487 (2006)","journal-title":"Combinatorica"},{"key":"544_CR26","doi-asserted-by":"crossref","unstructured":"Milosavljevi\u0107, N., Morozov, D., \u0160kraba, P.: Zigzag persistent homology in matrix multiplication time. In: 27th Annual Symposium on Computational Geometry (Paris 2011), pp. 216\u2013225. ACM, New York (2011)","DOI":"10.1145\/1998196.1998229"},{"key":"544_CR27","doi-asserted-by":"crossref","unstructured":"Otter, N., Porter, M.A., Tillmann, U., Grindrod, P., Harrington, H.A.: A roadmap for the computation of persistent homology. EPJ Data Sci. 6, #\u00a017 (2017)","DOI":"10.1140\/epjds\/s13688-017-0109-5"},{"issue":"3","key":"544_CR28","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1007\/s10208-014-9206-z","volume":"15","author":"JA Perea","year":"2015","unstructured":"Perea, J.A., Harer, J.: Sliding windows and persistence: an application of topological methods to signal analysis. Found. Comput. Math. 15(3), 799\u2013838 (2015)","journal-title":"Found. Comput. Math."},{"issue":"4","key":"544_CR29","doi-asserted-by":"publisher","first-page":"757","DOI":"10.17323\/1609-4514-2017-17-4-757-786","volume":"17","author":"L Polterovich","year":"2017","unstructured":"Polterovich, L., Shelukhin, E., Stojisavljevi\u0107, V.: Persistence modules with operators in Morse and Floer theory. Mosc. Math. J. 17(4), 757\u2013786 (2017)","journal-title":"Mosc. Math. J."},{"key":"544_CR30","doi-asserted-by":"crossref","unstructured":"Saadatfar, M., Takeuchi, H., Robins, V., Francois, N., Hiraoka, Y.: Pore configuration landscape of granular crystallization. Nat. Commun. 8, #\u00a015082 (2017)","DOI":"10.1038\/ncomms15082"},{"key":"544_CR31","volume-title":"Algebraic Topology","author":"EH Spanier","year":"1966","unstructured":"Spanier, E.H.: Algebraic Topology. McGraw-Hill, New York (1966)"},{"key":"544_CR32","unstructured":"Storjohann, A.: Algorithms for Matrix Canonical Forms. PhD thesis, Swiss Federal Institute of Technology (2000). https:\/\/cs.uwaterloo.ca\/~astorjoh\/diss2up.pdf"},{"issue":"2","key":"544_CR33","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s00454-004-1146-y","volume":"33","author":"A Zomorodian","year":"2005","unstructured":"Zomorodian, A., Carlsson, G.: Computing persistent homology. Discrete Comput. Geom. 33(2), 249\u2013274 (2005)","journal-title":"Discrete Comput. Geom."}],"container-title":["Discrete &amp; Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-023-00544-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00454-023-00544-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-023-00544-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,4]],"date-time":"2023-10-04T17:05:36Z","timestamp":1696439136000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00454-023-00544-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,18]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["544"],"URL":"https:\/\/doi.org\/10.1007\/s00454-023-00544-7","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2023,8,18]]},"assertion":[{"value":"19 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 February 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 February 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 August 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}