[{"department":[{"_id":"HeEd"},{"_id":"TaHa"}],"year":"2026","OA_type":"green","date_created":"2026-05-31T22:02:13Z","citation":{"ista":"Edelsbrunner H, Fillmore CD, Oliveira G. 2026. Counting equilibria of the electrostatic potential. Proceedings of the London Mathematical Society. 132(5), e70163.","chicago":"Edelsbrunner, Herbert, Christopher D Fillmore, and Goncalo Oliveira. “Counting Equilibria of the Electrostatic Potential.” <i>Proceedings of the London Mathematical Society</i>. Wiley, 2026. <a href=\"https://doi.org/10.1112/plms.70163\">https://doi.org/10.1112/plms.70163</a>.","ieee":"H. Edelsbrunner, C. D. Fillmore, and G. Oliveira, “Counting equilibria of the electrostatic potential,” <i>Proceedings of the London Mathematical Society</i>, vol. 132, no. 5. Wiley, 2026.","ama":"Edelsbrunner H, Fillmore CD, Oliveira G. Counting equilibria of the electrostatic potential. <i>Proceedings of the London Mathematical Society</i>. 2026;132(5). doi:<a href=\"https://doi.org/10.1112/plms.70163\">10.1112/plms.70163</a>","apa":"Edelsbrunner, H., Fillmore, C. D., &#38; Oliveira, G. (2026). Counting equilibria of the electrostatic potential. <i>Proceedings of the London Mathematical Society</i>. Wiley. <a href=\"https://doi.org/10.1112/plms.70163\">https://doi.org/10.1112/plms.70163</a>","short":"H. Edelsbrunner, C.D. Fillmore, G. Oliveira, Proceedings of the London Mathematical Society 132 (2026).","mla":"Edelsbrunner, Herbert, et al. “Counting Equilibria of the Electrostatic Potential.” <i>Proceedings of the London Mathematical Society</i>, vol. 132, no. 5, e70163, Wiley, 2026, doi:<a href=\"https://doi.org/10.1112/plms.70163\">10.1112/plms.70163</a>."},"status":"public","author":[{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner"},{"full_name":"Fillmore, Christopher D","first_name":"Christopher D","last_name":"Fillmore","id":"35638A5C-AAC7-11E9-B0BF-5503E6697425"},{"full_name":"Oliveira, Goncalo","last_name":"Oliveira","id":"58abbde8-f455-11eb-a497-98c8fd71b905","first_name":"Goncalo"}],"oa":1,"month":"05","external_id":{"arxiv":["2501.05315"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2026-05-01T00:00:00Z","date_updated":"2026-07-22T06:33:54Z","publication_identifier":{"issn":["0024-6115"],"eissn":["1460-244X"]},"intvolume":"       132","OA_place":"repository","issue":"5","day":"01","_id":"21931","language":[{"iso":"eng"}],"arxiv":1,"title":"Counting equilibria of the electrostatic potential","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"21050"}]},"doi":"10.1112/plms.70163","abstract":[{"lang":"eng","text":"In 1873, James C. Maxwell conjectured that the electric field generated by n point charges in generic position has at most (n-1)^2 isolated zeroes. The first (nonoptimal) upper bound was only obtained in 2007 by Gabrielov, Novikov, and Shapiro, who also posed two additional interesting conjectures. In this article, we give the best upper bound known to date on the number of zeroes of the electric field, and construct a counterexample to Conjecture 1.8 by Gabrielov, Novikov, and Shapiro that the number of equilibria cannot exceed those of the distance function defined by the unit point charges. Finally, we note that it is quite possible that Maxwell's quadratic upper bound is not tight, so it is prudent to find lower bounds. Hence, we also explore examples and construct configurations of charges achieving the highest ratios of the number of electric field zeroes by point charges found to this day."}],"article_type":"original","publication":"Proceedings of the London Mathematical Society","article_processing_charge":"No","quality_controlled":"1","type":"journal_article","fulldoi":"https://doi.org/10.1112/plms.70163","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2501.05315"}],"scopus_import":"1","publisher":"Wiley","oa_version":"Preprint","publication_status":"published","corr_author":"1","volume":132,"article_number":"e70163"},{"intvolume":"       132","publication_identifier":{"issn":["0195-6698"]},"das_tickbox":"0","OA_place":"repository","date_published":"2026-02-01T00:00:00Z","date_updated":"2026-07-23T11:58:37Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"title":"Flips in two-dimensional hypertriangulations","isi":1,"day":"01","language":[{"iso":"eng"}],"_id":"20490","status":"public","department":[{"_id":"HeEd"}],"year":"2026","OA_type":"green","date_created":"2025-10-19T22:01:31Z","citation":{"chicago":"Edelsbrunner, Herbert, Alexey Garber, Mohadese Ghafari, Teresa Heiss, and Morteza Saghafian. “Flips in Two-Dimensional Hypertriangulations.” <i>European Journal of Combinatorics</i>. Elsevier, 2026. <a href=\"https://doi.org/10.1016/j.ejc.2025.104248\">https://doi.org/10.1016/j.ejc.2025.104248</a>.","ista":"Edelsbrunner H, Garber A, Ghafari M, Heiss T, Saghafian M. 2026. Flips in two-dimensional hypertriangulations. European Journal of Combinatorics. 132, 104248.","ieee":"H. Edelsbrunner, A. Garber, M. Ghafari, T. Heiss, and M. Saghafian, “Flips in two-dimensional hypertriangulations,” <i>European Journal of Combinatorics</i>, vol. 132. Elsevier, 2026.","ama":"Edelsbrunner H, Garber A, Ghafari M, Heiss T, Saghafian M. Flips in two-dimensional hypertriangulations. <i>European Journal of Combinatorics</i>. 2026;132. doi:<a href=\"https://doi.org/10.1016/j.ejc.2025.104248\">10.1016/j.ejc.2025.104248</a>","apa":"Edelsbrunner, H., Garber, A., Ghafari, M., Heiss, T., &#38; Saghafian, M. (2026). Flips in two-dimensional hypertriangulations. <i>European Journal of Combinatorics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ejc.2025.104248\">https://doi.org/10.1016/j.ejc.2025.104248</a>","short":"H. Edelsbrunner, A. Garber, M. Ghafari, T. Heiss, M. Saghafian, European Journal of Combinatorics 132 (2026).","mla":"Edelsbrunner, Herbert, et al. “Flips in Two-Dimensional Hypertriangulations.” <i>European Journal of Combinatorics</i>, vol. 132, 104248, Elsevier, 2026, doi:<a href=\"https://doi.org/10.1016/j.ejc.2025.104248\">10.1016/j.ejc.2025.104248</a>."},"month":"02","external_id":{"isi":["001599061500002"],"arxiv":["2212.11380"]},"author":[{"last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"full_name":"Garber, Alexey","first_name":"Alexey","last_name":"Garber"},{"last_name":"Ghafari","first_name":"Mohadese","full_name":"Ghafari, Mohadese"},{"first_name":"Teresa","id":"4879BB4E-F248-11E8-B48F-1D18A9856A87","last_name":"Heiss","orcid":"0000-0002-1780-2689","full_name":"Heiss, Teresa"},{"full_name":"Saghafian, Morteza","id":"f86f7148-b140-11ec-9577-95435b8df824","last_name":"Saghafian","first_name":"Morteza"}],"oa":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2212.11380","open_access":"1"}],"scopus_import":"1","publisher":"Elsevier","type":"journal_article","fulldoi":"https://doi.org/10.1016/j.ejc.2025.104248","ec_funded":1,"volume":132,"article_number":"104248","oa_version":"Preprint","publication_status":"published","corr_author":"1","acknowledgement":"Work by all authors but the second is supported by the European Research Council (ERC), grant no. 788183, by the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31, and by the DFG Collaborative Research Center TRR 109, Austrian Science Fund (FWF), grant no. I 02979-N35. Work by the second author is partially supported by the Alexander von Humboldt Foundation and by the Simons Foundation . The second author thanks Jesús A. De Loera for useful discussions on flips and non-flips and Pavel Galashin and Alexey Balitskiy for useful discussions on plabic graphs.","doi":"10.1016/j.ejc.2025.104248","article_processing_charge":"No","quality_controlled":"1","abstract":[{"lang":"eng","text":"We study flips in hypertriangulations of planar points sets. Here a level-k hypertriangulation of n\r\n points in the plane is a subdivision induced by the projection of a k-hypersimplex, which is the convex hull of the barycenters of the (k-1)-dimensional faces of the standard (n-1)-simplex. In particular, we introduce four types of flips and prove that the level-2 hypertriangulations are connected by these flips.\r\n"}],"article_type":"original","publication":"European Journal of Combinatorics","project":[{"call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183","name":"Alpha Shape Theory Extended"},{"call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342","name":"Mathematics, Computer Science"},{"grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}]},{"publication":"Foundations of Computational Mathematics","researchdata_availability":"no","project":[{"call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413"}],"article_type":"original","abstract":[{"text":"Bifurcation characterizes the qualitative changes in parameterized dynamical systems and is one of the major topics in the field. In this work, we study combinatorial bifurcations within the framework of combinatorial dynamical systems—a young but already well-established theory. We introduce the Conley–Morse persistence barcode, a compact algebraic descriptor of combinatorial bifurcations. This barcode captures structural changes in a dynamical system at the level of Morse decompositions and provides a characterization of the nature of observed transitions in terms of the Conley index. The construction of the Conley–Morse persistence barcode builds upon ideas from topological persistence. Specifically, we consider a persistence module obtained from the Conley index of invariant sets indexed over a poset. Using gentle algebras, we prove that this module decomposes into simple intervals (bars) and compute them by adapting the zigzag persistence algorithm to our purpose.","lang":"eng"}],"quality_controlled":"1","article_processing_charge":"Yes (via OA deal)","doi":"10.1007/s10208-026-09766-6","acknowledgement":"M.L. acknowledges support from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413. T.D. acknowledges the support of NSF funds CCF-2437030 and DMS-2301360. The authors would like to thank the anonymous reviewers for their careful reading of the paper. Their feedback significantly improved the quality of the article. T.D. and M.L. would like to acknowledge many thought-provoking discussions with Marian Mrozek on combinatorial dynamical systems and their continuations. M.S.T. would like to thank Álvaro Sánchez for insightful discussions about representation theory. Open access funding provided by Institute of Science and Technology (IST Austria).","corr_author":"1","oa_version":"Published Version","publication_status":"epub_ahead","type":"journal_article","ec_funded":1,"fulldoi":"https://doi.org/10.1007/s10208-026-09766-6","publisher":"Springer","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/s10208-026-09766-6"}],"scopus_import":"1","has_accepted_license":"1","oa":1,"author":[{"full_name":"Dey, Tamal K.","last_name":"Dey","first_name":"Tamal K."},{"orcid":"0000-0001-9789-9750","full_name":"Lipiński, Michał","first_name":"Michał","id":"dfffb474-4317-11ee-8f5c-fe3fc95a425e","last_name":"Lipiński"},{"full_name":"Soriano Trigueros, Manuel","orcid":"0000-0003-2449-1433","last_name":"Soriano Trigueros","id":"15ebd7cf-15bf-11ee-aebd-bb4bb5121ea8","first_name":"Manuel"}],"external_id":{"arxiv":["2504.17105"]},"month":"08","OA_type":"hybrid","year":"2026","date_created":"2026-08-05T06:11:30Z","citation":{"ama":"Dey TK, Lipiński M, Soriano Trigueros M. Conley-Morse persistence barcode: A homological signature of combinatorial bifurcations. <i>Foundations of Computational Mathematics</i>. 2026. doi:<a href=\"https://doi.org/10.1007/s10208-026-09766-6\">10.1007/s10208-026-09766-6</a>","short":"T.K. Dey, M. Lipiński, M. Soriano Trigueros, Foundations of Computational Mathematics (2026).","apa":"Dey, T. K., Lipiński, M., &#38; Soriano Trigueros, M. (2026). Conley-Morse persistence barcode: A homological signature of combinatorial bifurcations. <i>Foundations of Computational Mathematics</i>. Springer. <a href=\"https://doi.org/10.1007/s10208-026-09766-6\">https://doi.org/10.1007/s10208-026-09766-6</a>","mla":"Dey, Tamal K., et al. “Conley-Morse Persistence Barcode: A Homological Signature of Combinatorial Bifurcations.” <i>Foundations of Computational Mathematics</i>, Springer, 2026, doi:<a href=\"https://doi.org/10.1007/s10208-026-09766-6\">10.1007/s10208-026-09766-6</a>.","chicago":"Dey, Tamal K., Michał Lipiński, and Manuel Soriano Trigueros. “Conley-Morse Persistence Barcode: A Homological Signature of Combinatorial Bifurcations.” <i>Foundations of Computational Mathematics</i>. Springer, 2026. <a href=\"https://doi.org/10.1007/s10208-026-09766-6\">https://doi.org/10.1007/s10208-026-09766-6</a>.","ista":"Dey TK, Lipiński M, Soriano Trigueros M. 2026. Conley-Morse persistence barcode: A homological signature of combinatorial bifurcations. Foundations of Computational Mathematics.","ieee":"T. K. Dey, M. Lipiński, and M. Soriano Trigueros, “Conley-Morse persistence barcode: A homological signature of combinatorial bifurcations,” <i>Foundations of Computational Mathematics</i>. Springer, 2026."},"department":[{"_id":"HeEd"}],"status":"public","_id":"22648","language":[{"iso":"eng"}],"day":"04","PlanS_conform":"1","title":"Conley-Morse persistence barcode: A homological signature of combinatorial bifurcations","keyword":["Multivector field","Conley index","Morse decomposition","Bifurcation","Continuation","Zigzag persistence","Persistence barcode","Gentle algebra"],"arxiv":1,"date_published":"2026-08-04T00:00:00Z","date_updated":"2026-08-11T06:13:33Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["500"],"OA_place":"publisher","das_tickbox":"0","supplementarymaterial":"yes","publication_identifier":{"issn":["1615-3375"],"eissn":["1615-3383"]}},{"status":"public","citation":{"ama":"Dey TK, Haas A, Lipiński M. Computing a connection matrix and persistence efficiently from a morse decomposition. <i>SIAM Journal on Applied Dynamical Systems</i>. 2026;25(1):108-130. doi:<a href=\"https://doi.org/10.1137/25m1739406\">10.1137/25m1739406</a>","short":"T.K. Dey, A. Haas, M. Lipiński, SIAM Journal on Applied Dynamical Systems 25 (2026) 108–130.","apa":"Dey, T. K., Haas, A., &#38; Lipiński, M. (2026). Computing a connection matrix and persistence efficiently from a morse decomposition. <i>SIAM Journal on Applied Dynamical Systems</i>. SIAM. <a href=\"https://doi.org/10.1137/25m1739406\">https://doi.org/10.1137/25m1739406</a>","mla":"Dey, Tamal K., et al. “Computing a Connection Matrix and Persistence Efficiently from a Morse Decomposition.” <i>SIAM Journal on Applied Dynamical Systems</i>, vol. 25, no. 1, SIAM, 2026, pp. 108–30, doi:<a href=\"https://doi.org/10.1137/25m1739406\">10.1137/25m1739406</a>.","ista":"Dey TK, Haas A, Lipiński M. 2026. Computing a connection matrix and persistence efficiently from a morse decomposition. SIAM Journal on Applied Dynamical Systems. 25(1), 108–130.","chicago":"Dey, Tamal K., Andrew Haas, and Michał Lipiński. “Computing a Connection Matrix and Persistence Efficiently from a Morse Decomposition.” <i>SIAM Journal on Applied Dynamical Systems</i>. SIAM, 2026. <a href=\"https://doi.org/10.1137/25m1739406\">https://doi.org/10.1137/25m1739406</a>.","ieee":"T. K. Dey, A. Haas, and M. Lipiński, “Computing a connection matrix and persistence efficiently from a morse decomposition,” <i>SIAM Journal on Applied Dynamical Systems</i>, vol. 25, no. 1. SIAM, pp. 108–130, 2026."},"date_created":"2026-01-12T11:17:06Z","year":"2026","OA_type":"green","department":[{"_id":"HeEd"}],"external_id":{"arxiv":["2502.19369"]},"month":"01","oa":1,"author":[{"full_name":"Dey, Tamal K.","last_name":"Dey","first_name":"Tamal K."},{"full_name":"Haas, Andrew","first_name":"Andrew","last_name":"Haas"},{"full_name":"Lipiński, Michał","orcid":"0000-0001-9789-9750","first_name":"Michał","id":"dfffb474-4317-11ee-8f5c-fe3fc95a425e","last_name":"Lipiński"}],"OA_place":"repository","intvolume":"        25","publication_identifier":{"issn":["1536-0040"]},"date_published":"2026-01-01T00:00:00Z","ddc":["510"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-08-12T06:23:46Z","title":"Computing a connection matrix and persistence efficiently from a morse decomposition","arxiv":1,"_id":"20980","language":[{"iso":"eng"}],"day":"01","issue":"1","doi":"10.1137/25m1739406","acknowledgement":"This research was supported by NSF grants DMS-2301360 and CCF-2437030 as well as from the European Union's Horizon 2020 research and innovation programme under Marie Sk\\lodowska-Curie grant 101034413.\r\n","quality_controlled":"1","article_processing_charge":"No","publication":"SIAM Journal on Applied Dynamical Systems","project":[{"grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020"}],"abstract":[{"text":"Morse decompositions partition the flows in a vector field into equivalent structures. Given such a decomposition, one can define a further summary of its flow structure by what is called a connection matrix. These matrices, a generalization of Morse boundary operators from classical Morse theory, capture the connections made by the flows among the critical structures—such as attractors, repellers, and orbits—in a vector field. Recently, in the context of combinatorial dynamics, an efficient persistence-like algorithm to compute connection matrices has been proposed in Dey, Lipiński, Mrozek, and Slechta [SIAM J. Appl. Dyn. Syst., 23 (2024), pp. 81–97]. We show that, actually, the classical persistence algorithm with exhaustive reduction retrieves connection matrices, both simplifying the algorithm of Dey et al. and bringing the theory of persistence closer to combinatorial dynamical systems. We supplement this main result with an observation: the concept of persistence as defined for scalar fields naturally adapts to Morse decompositions whose Morse sets are filtered with a Lyapunov function. We conclude by presenting preliminary experimental results.","lang":"eng"}],"article_type":"original","publisher":"SIAM","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2502.19369"}],"ec_funded":1,"fulldoi":"https://doi.org/10.1137/25m1739406","type":"journal_article","page":"108-130","volume":25,"publication_status":"published","oa_version":"Preprint"},{"date_updated":"2026-08-12T09:02:56Z","ddc":["500"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2026-05-27T00:00:00Z","das_tickbox":"0","OA_place":"publisher","supplementarymaterial":"no","publication_identifier":{"eissn":["1868-8969"],"isbn":["9783959774185"]},"intvolume":"       367","file_date_updated":"2026-07-14T06:08:05Z","language":[{"iso":"eng"}],"_id":"22299","day":"27","title":"The depth poset under transpositions in the filter","keyword":["Algebraic topology","Lefschetz complexes","persistent homology","vines and vineyards","birth-death pairs","shallow pairs","relations","partial orders","transpositions","Theory of computation → Computational geometry"],"arxiv":1,"OA_type":"gold","year":"2026","citation":{"chicago":"Edelsbrunner, Herbert, Michał Lipiński, Marian Mrozek, Manuel Soriano Trigueros, and Fedor Zimin. “The Depth Poset under Transpositions in the Filter.” In <i>42nd International Symposium on Computational Geometry</i>, Vol. 367. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. <a href=\"https://doi.org/10.4230/LIPICS.SOCG.2026.41\">https://doi.org/10.4230/LIPICS.SOCG.2026.41</a>.","ista":"Edelsbrunner H, Lipiński M, Mrozek M, Soriano Trigueros M, Zimin F. 2026. The depth poset under transpositions in the filter. 42nd International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 367, 41:1-41:18.","ieee":"H. Edelsbrunner, M. Lipiński, M. Mrozek, M. Soriano Trigueros, and F. Zimin, “The depth poset under transpositions in the filter,” in <i>42nd International Symposium on Computational Geometry</i>, New Brunswick, NJ, United States, 2026, vol. 367.","ama":"Edelsbrunner H, Lipiński M, Mrozek M, Soriano Trigueros M, Zimin F. The depth poset under transpositions in the filter. In: <i>42nd International Symposium on Computational Geometry</i>. Vol 367. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:<a href=\"https://doi.org/10.4230/LIPICS.SOCG.2026.41\">10.4230/LIPICS.SOCG.2026.41</a>","apa":"Edelsbrunner, H., Lipiński, M., Mrozek, M., Soriano Trigueros, M., &#38; Zimin, F. (2026). The depth poset under transpositions in the filter. In <i>42nd International Symposium on Computational Geometry</i> (Vol. 367). New Brunswick, NJ, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.SOCG.2026.41\">https://doi.org/10.4230/LIPICS.SOCG.2026.41</a>","short":"H. Edelsbrunner, M. Lipiński, M. Mrozek, M. Soriano Trigueros, F. Zimin, in:, 42nd International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.","mla":"Edelsbrunner, Herbert, et al. “The Depth Poset under Transpositions in the Filter.” <i>42nd International Symposium on Computational Geometry</i>, vol. 367, 41:1-41:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:<a href=\"https://doi.org/10.4230/LIPICS.SOCG.2026.41\">10.4230/LIPICS.SOCG.2026.41</a>."},"date_created":"2026-07-13T09:56:38Z","department":[{"_id":"HeEd"},{"_id":"GradSch"}],"status":"public","oa":1,"has_accepted_license":"1","author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"orcid":"0000-0001-9789-9750","full_name":"Lipiński, Michał","last_name":"Lipiński","id":"dfffb474-4317-11ee-8f5c-fe3fc95a425e","first_name":"Michał"},{"full_name":"Mrozek, Marian","orcid":"0000-0002-0619-6417","last_name":"Mrozek","first_name":"Marian"},{"full_name":"Soriano Trigueros, Manuel","orcid":"0000-0003-2449-1433","first_name":"Manuel","last_name":"Soriano Trigueros","id":"15ebd7cf-15bf-11ee-aebd-bb4bb5121ea8"},{"last_name":"Zimin","id":"afd27eda-91c1-11f0-aad8-c6edbec24c04","first_name":"Fedor","full_name":"Zimin, Fedor"}],"conference":{"location":"New Brunswick, NJ, United States","name":"SoCG: Symposium on Computational Geometry","end_date":"2026-06-05","start_date":"2026-06-02"},"external_id":{"arxiv":["2511.21961"]},"month":"05","type":"conference","fulldoi":"https://doi.org/10.4230/LIPICS.SOCG.2026.41","ec_funded":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"scopus_import":"1","corr_author":"1","oa_version":"Published Version","publication_status":"published","volume":367,"alternative_title":["LIPIcs"],"article_number":"41:1-41:18","doi":"10.4230/LIPICS.SOCG.2026.41","acknowledgement":"The authors thank Jakub Leśkiewicz and Bartosz Furmanek for discussions\r\nthat helped improve the paper. Herbert Edelsbrunner: DFG Collaborative Research Center TRR 109, Austrian Science\r\nFund (FWF), grant no. I 02979-N35\r\nMichał Lipiński: European Union’s Horizon 2020 research and innovation programme under the\r\nMarie Skłodowska-Curie Grant Agreement No. 101034413\r\nMarian Mrozek: Polish National Science Center under Opus Grant 2019/35/B/ST1/00874 and Opus\r\nGrant 2025/57/B/ST1/00550","file":[{"relation":"main_file","success":1,"file_id":"22329","file_size":2902144,"creator":"dernst","checksum":"9dfb96ee66985c724b499b0e5888dc8e","file_name":"2026_LIPIcSSoCG_Edelsbrunner.pdf","access_level":"open_access","content_type":"application/pdf","date_created":"2026-07-14T06:08:05Z","date_updated":"2026-07-14T06:08:05Z"}],"project":[{"grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020"}],"researchdata_availability":"no","publication":"42nd International Symposium on Computational Geometry","abstract":[{"text":"The depth poset of a filtered Lefschetz complex reflects the dependencies between the cancellations of different shallow birth-death pairs. Using the fast algorithms for computing the depth poset in [Edelsbrunner et al., 2026] and for updating the persistence diagram under transpositions in [Cohen-Steiner et al., 2006], we give a complete case analysis of how transpositions of cells in the filter affect the depth poset. In addition, we present statistics on the depth poset for random point data and its sensitivity to the transpositions that occur in random straight-line homotopies.","lang":"eng"}],"quality_controlled":"1","article_processing_charge":"Yes"},{"fulldoi":"https://doi.org/10.1007/s00454-025-00796-5","ec_funded":1,"type":"journal_article","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publisher":"Springer Nature","scopus_import":"1","corr_author":"1","publication_status":"published","oa_version":"Published Version","page":"597-624","volume":75,"doi":"10.1007/s00454-025-00796-5","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"17146"}]},"acknowledgement":"The first author is supported by the European Research Council (ERC), grant no. 788183, and by the DFG Collaborative Research Center TRR 109, Austrian Science Fund (FWF), grant no. I 02979-N35. The second author is supported by the European Research Council (ERC), grant “GeoScape” and by the Hungarian Science Foundation (NKFIH), grant K-131529. Both authors are supported by the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31. Open access funding provided by Institute of Science and Technology (IST Austria).","file":[{"date_created":"2026-07-27T08:11:05Z","date_updated":"2026-07-27T08:11:05Z","access_level":"open_access","content_type":"application/pdf","success":1,"file_id":"22410","file_name":"2026_DiscreteCompGeom_Edelsbrunner.pdf","file_size":546483,"checksum":"c17c014dbbf5be702195c737890251c8","creator":"dernst","relation":"main_file"}],"publication":"Discrete & Computational Geometry","researchdata_availability":"no","project":[{"call_identifier":"H2020","grant_number":"788183","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"},{"_id":"268116B8-B435-11E9-9278-68D0E5697425","name":"Mathematics, Computer Science","grant_number":"Z00342","call_identifier":"FWF"}],"article_type":"original","abstract":[{"text":"The Upper Bound Theorem for convex polytopes implies that the p-th Betti number of the Čech complex of any set of N points in ℝ^d and any radius satisfies β_p = O(N^m), with m = min{p+1, ⌈d/2⌉}. We construct sets in even and odd dimensions, which prove that this upper bound is asymptotically tight. For example, we describe a set of N = 2(n+1) points in ℝ³ and two radii such that the first Betti number of the Čech complex at one radius is (n+1)² - 1, and the second Betti number of the Čech complex at the other radius is n². ","lang":"eng"}],"quality_controlled":"1","article_processing_charge":"Yes (via OA deal)","date_published":"2026-03-01T00:00:00Z","date_updated":"2026-10-02T11:48:00Z","ddc":["510"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","das_tickbox":"0","OA_place":"publisher","file_date_updated":"2026-07-27T08:11:05Z","publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"supplementarymaterial":"no","intvolume":"        75","language":[{"iso":"eng"}],"_id":"20657","day":"01","PlanS_conform":"1","isi":1,"title":"Maximum Betti numbers of Čech complexes","arxiv":1,"date_created":"2025-11-19T09:44:58Z","citation":{"mla":"Edelsbrunner, Herbert, and János Pach. “Maximum Betti Numbers of Čech Complexes.” <i>Discrete &#38; Computational Geometry</i>, vol. 75, Springer Nature, 2026, pp. 597–624, doi:<a href=\"https://doi.org/10.1007/s00454-025-00796-5\">10.1007/s00454-025-00796-5</a>.","ama":"Edelsbrunner H, Pach J. Maximum Betti numbers of Čech complexes. <i>Discrete &#38; Computational Geometry</i>. 2026;75:597-624. doi:<a href=\"https://doi.org/10.1007/s00454-025-00796-5\">10.1007/s00454-025-00796-5</a>","short":"H. Edelsbrunner, J. Pach, Discrete &#38; Computational Geometry 75 (2026) 597–624.","apa":"Edelsbrunner, H., &#38; Pach, J. (2026). Maximum Betti numbers of Čech complexes. <i>Discrete &#38; Computational Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00454-025-00796-5\">https://doi.org/10.1007/s00454-025-00796-5</a>","ista":"Edelsbrunner H, Pach J. 2026. Maximum Betti numbers of Čech complexes. Discrete &#38; Computational Geometry. 75, 597–624.","chicago":"Edelsbrunner, Herbert, and János Pach. “Maximum Betti Numbers of Čech Complexes.” <i>Discrete &#38; Computational Geometry</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1007/s00454-025-00796-5\">https://doi.org/10.1007/s00454-025-00796-5</a>.","ieee":"H. Edelsbrunner and J. Pach, “Maximum Betti numbers of Čech complexes,” <i>Discrete &#38; Computational Geometry</i>, vol. 75. Springer Nature, pp. 597–624, 2026."},"year":"2026","OA_type":"hybrid","department":[{"_id":"HeEd"}],"status":"public","oa":1,"has_accepted_license":"1","author":[{"last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"first_name":"János","last_name":"Pach","id":"E62E3130-B088-11EA-B919-BF823C25FEA4","full_name":"Pach, János"}],"external_id":{"isi":["001610592600001"],"arxiv":["2310.14801"]},"month":"03"},{"status":"public","citation":{"ista":"Cultrera di Montesano S, Draganov O, Edelsbrunner H, Saghafian M. 2026. Chromatic alpha complexes. Foundations of Data Science. 8, 30–62.","chicago":"Cultrera di Montesano, Sebastiano, Ondrej Draganov, Herbert Edelsbrunner, and Morteza Saghafian. “Chromatic Alpha Complexes.” <i>Foundations of Data Science</i>. AIMS, 2026. <a href=\"https://doi.org/10.3934/fods.2025003\">https://doi.org/10.3934/fods.2025003</a>.","ieee":"S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner, and M. Saghafian, “Chromatic alpha complexes,” <i>Foundations of Data Science</i>, vol. 8. AIMS, pp. 30–62, 2026.","ama":"Cultrera di Montesano S, Draganov O, Edelsbrunner H, Saghafian M. Chromatic alpha complexes. <i>Foundations of Data Science</i>. 2026;8:30-62. doi:<a href=\"https://doi.org/10.3934/fods.2025003\">10.3934/fods.2025003</a>","apa":"Cultrera di Montesano, S., Draganov, O., Edelsbrunner, H., &#38; Saghafian, M. (2026). Chromatic alpha complexes. <i>Foundations of Data Science</i>. AIMS. <a href=\"https://doi.org/10.3934/fods.2025003\">https://doi.org/10.3934/fods.2025003</a>","short":"S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner, M. Saghafian, Foundations of Data Science 8 (2026) 30–62.","mla":"Cultrera di Montesano, Sebastiano, et al. “Chromatic Alpha Complexes.” <i>Foundations of Data Science</i>, vol. 8, AIMS, 2026, pp. 30–62, doi:<a href=\"https://doi.org/10.3934/fods.2025003\">10.3934/fods.2025003</a>."},"date_created":"2025-11-02T23:01:33Z","year":"2026","mathsc":["62R40","55N31","68T09","57Q70"],"OA_type":"green","department":[{"_id":"HeEd"}],"external_id":{"arxiv":["2212.03128"]},"month":"03","oa":1,"has_accepted_license":"1","author":[{"full_name":"Cultrera di Montesano, Sebastiano","orcid":"0000-0001-6249-0832","first_name":"Sebastiano","id":"34D2A09C-F248-11E8-B48F-1D18A9856A87","last_name":"Cultrera di Montesano"},{"id":"2B23F01E-F248-11E8-B48F-1D18A9856A87","last_name":"Draganov","first_name":"Ondrej","orcid":"0000-0003-0464-3823","full_name":"Draganov, Ondrej"},{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner"},{"full_name":"Saghafian, Morteza","first_name":"Morteza","last_name":"Saghafian","id":"f86f7148-b140-11ec-9577-95435b8df824"}],"OA_place":"repository","intvolume":"         8","publication_identifier":{"eissn":["2639-8001"]},"ddc":["510"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2026-03-01T00:00:00Z","date_updated":"2026-10-02T11:56:12Z","title":"Chromatic alpha complexes","arxiv":1,"keyword":["Topological data analysis","Delaunay mosaic","alpha complex","chromatic sets","persistent homology","kernel/image/cokernel persistent homology","radius function","discrete Morse theory","exact sequences"],"language":[{"iso":"eng"}],"_id":"20585","day":"01","doi":"10.3934/fods.2025003","acknowledgement":"This project has received funding from the European Research\r\nCouncil (ERC) under the European Union’s Horizon 2020 research and innovation\r\nprogramme, grant no. 788183, from the Wittgenstein Prize, Austrian Science Fund\r\n(FWF), grant no. Z 342-N31, and from the DFG Collaborative Research Center TRR\r\n109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF),\r\ngrant no. I 02979-N35.","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"15091"}]},"quality_controlled":"1","article_processing_charge":"No","publication":"Foundations of Data Science","project":[{"call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended","grant_number":"788183"},{"grant_number":"Z00342","name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","call_identifier":"FWF"}],"article_type":"original","abstract":[{"text":"Motivated by applications in medical sciences, we study finite chromatic sets in Euclidean space from a topological perspective. Based on the persistent homology for images, kernels and cokernels, we design provably stable homological quantifiers that describe the geometric micro- and macro-structure of how the color classes mingle. These can be efficiently computed using chromatic variants of Delaunay and alpha complexes, and code that does these computations is provided.","lang":"eng"}],"publisher":"AIMS","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2212.03128","open_access":"1"}],"scopus_import":"1","ec_funded":1,"fulldoi":"https://doi.org/10.3934/fods.2025003","type":"journal_article","page":"30-62","volume":8,"corr_author":"1","publication_status":"published","oa_version":"Preprint"},{"doi":"10.1038/s41467-026-77363-w","acknowledgement":"We thank the Danish e-Infrastructure Cooperation (DeiC) for access to computational resources at Sophia and LUMI-C (DeiC-AAU-N5-202200005). This work was supported by the Independent Research Fund Denmark (1026-00037), European Union (ERC, NewGLASS, 101044664), and Danish Data Science Academy, which in turn is funded by the Novo Nordisk Foundation (NNF21SA0069429) and VILLUM FONDEN (40516). Y.B.B. acknowledges support from the Austrian Science Fund (FWF) 10.55776/ESP9584724.","file":[{"date_created":"2026-10-12T09:00:06Z","date_updated":"2026-10-12T09:00:06Z","access_level":"open_access","content_type":"application/pdf","success":1,"file_id":"23104","checksum":"eba760f5982a89f59664957e00c5d2d6","file_name":"2026_NatureComm_Pegoraro.pdf","creator":"dernst","file_size":1889857,"relation":"main_file"}],"project":[{"grant_number":"ESP 9584724","name":"Quantitative Unbiased Shape Analysis with Geometry &amp; Topology","_id":"9106a876-16d5-11f0-9cad-bbf11c9952f9"}],"publication":"Nature Communications","researchdata_availability":"yes","article_type":"original","abstract":[{"lang":"eng","text":"Disordered materials such as glasses are promising candidates as solid-state electrolytes for batteries, but they tend to exhibit low ionic conductivity and current methods for investigating and predicting the ionic conductivity of electrolyte materials are inefficient. Here, we propose a framework that summarizes the topological properties of the electrolyte material’s atomic structure with a weighted graph based on periodic boundary conditions. We then compute a variation of the max-flow algorithm, a commonly used model in continuum models of transportation and liquid flow, on this summary and show that it is compatible with the simulated periodic atomic structures. Using molecular dynamics simulations of various glassy solid-state electrolyte families including both mobile lithium and sodium ions, we validate the approach by showing a positive correlation between the area-normalized maximum flow predicted from the static glass structures and the ionic conductivity as obtained from the simulations, especially in the case of high-conductivity sulfide glass electrolytes. We envision that the developed methodology, which only relies on static atomic structure, will accelerate the discovery of highly conductive sulfide glassy electrolytes for high-performance all-solid-state batteries."}],"quality_controlled":"1","article_processing_charge":"Yes","dataavailabilitystatement":"All data supporting the findings of this study are available within the article and Supplementary Information files. Source data are provided with this paper. The developed code to perform the max-flow calculations is available as part of the Topological Materials Analysis (ToMA) library, which is available at Zenodo (https://doi.org/10.5281/zenodo.10781424) and Github (https://github.com/yossibokorbleile/TopologicalMaterialAnalysis), with documentation available at https://yossi.eu/toma/. To enhance usability, we have included a brief documentation on how to compile ToMA as well as a minimal working example of the code together with an example trajectory directly in the ToMA repository. LAMMPS is an open-source code available at https://lammps.sandia.gov.","DOAJ_listed":"1","type":"journal_article","fulldoi":"https://doi.org/10.1038/s41467-026-77363-w","publisher":"Springer Nature","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"scopus_import":"1","oa_version":"Published Version","publication_status":"published","volume":17,"article_number":"10343","year":"2026","OA_type":"gold","citation":{"mla":"Pegoraro, Matteo, et al. “Predicting Ionic Conductivity of Sulfide Glass Solid-State Electrolytes Using Max-Flow Methodology.” <i>Nature Communications</i>, vol. 17, 10343, Springer Nature, 2026, doi:<a href=\"https://doi.org/10.1038/s41467-026-77363-w\">10.1038/s41467-026-77363-w</a>.","apa":"Pegoraro, M., Christensen, R., Sørensen, S. S., Lindbjerg, A. R., Du, T., Bokor Bleile, Y., … Smedskjaer, M. M. (2026). Predicting ionic conductivity of sulfide glass solid-state electrolytes using max-flow methodology. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-026-77363-w\">https://doi.org/10.1038/s41467-026-77363-w</a>","short":"M. Pegoraro, R. Christensen, S.S. Sørensen, A.R. Lindbjerg, T. Du, Y. Bokor Bleile, A.M. Svane, C.A.N. Biscio, L. Fajstrup, M.M. Smedskjaer, Nature Communications 17 (2026).","ama":"Pegoraro M, Christensen R, Sørensen SS, et al. Predicting ionic conductivity of sulfide glass solid-state electrolytes using max-flow methodology. <i>Nature Communications</i>. 2026;17. doi:<a href=\"https://doi.org/10.1038/s41467-026-77363-w\">10.1038/s41467-026-77363-w</a>","ieee":"M. Pegoraro <i>et al.</i>, “Predicting ionic conductivity of sulfide glass solid-state electrolytes using max-flow methodology,” <i>Nature Communications</i>, vol. 17. Springer Nature, 2026.","ista":"Pegoraro M, Christensen R, Sørensen SS, Lindbjerg AR, Du T, Bokor Bleile Y, Svane AM, Biscio CAN, Fajstrup L, Smedskjaer MM. 2026. Predicting ionic conductivity of sulfide glass solid-state electrolytes using max-flow methodology. Nature Communications. 17, 10343.","chicago":"Pegoraro, Matteo, Rasmus Christensen, Søren S. Sørensen, Anders R. Lindbjerg, Tao Du, Yossi Bokor Bleile, Anne Marie Svane, Christophe A.N. Biscio, Lisbeth Fajstrup, and Morten M. Smedskjaer. “Predicting Ionic Conductivity of Sulfide Glass Solid-State Electrolytes Using Max-Flow Methodology.” <i>Nature Communications</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1038/s41467-026-77363-w\">https://doi.org/10.1038/s41467-026-77363-w</a>."},"date_created":"2026-10-11T22:02:03Z","department":[{"_id":"HeEd"}],"status":"public","oa":1,"has_accepted_license":"1","author":[{"full_name":"Pegoraro, Matteo","first_name":"Matteo","last_name":"Pegoraro"},{"last_name":"Christensen","first_name":"Rasmus","full_name":"Christensen, Rasmus"},{"first_name":"Søren S.","last_name":"Sørensen","full_name":"Sørensen, Søren S."},{"first_name":"Anders R.","last_name":"Lindbjerg","full_name":"Lindbjerg, Anders R."},{"last_name":"Du","first_name":"Tao","full_name":"Du, Tao"},{"last_name":"Bleile","id":"920a7385-7995-11ef-9bfd-8c434cd8f3c2","first_name":"Yossi","full_name":"Bleile, Yossi","orcid":"0000-0002-4861-9174"},{"full_name":"Svane, Anne Marie","last_name":"Svane","first_name":"Anne Marie"},{"full_name":"Biscio, Christophe A.N.","first_name":"Christophe A.N.","last_name":"Biscio"},{"last_name":"Fajstrup","first_name":"Lisbeth","full_name":"Fajstrup, Lisbeth"},{"full_name":"Smedskjaer, Morten M.","last_name":"Smedskjaer","first_name":"Morten M."}],"external_id":{"pmid":["42811056"]},"month":"09","ddc":["500"],"date_updated":"2026-10-12T09:03:58Z","date_published":"2026-09-30T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","das_tickbox":"1","OA_place":"publisher","supplementarymaterial":"yes","publication_identifier":{"eissn":["2041-1723"]},"intvolume":"        17","file_date_updated":"2026-10-12T09:00:06Z","language":[{"iso":"eng"}],"_id":"23087","pmid":1,"PlanS_conform":"1","day":"30","title":"Predicting ionic conductivity of sulfide glass solid-state electrolytes using max-flow methodology"},{"_id":"20867","language":[{"iso":"eng"}],"day":"20","PlanS_conform":"1","issue":"8","title":"Coarse and bi-Lipschitz embeddability of subspaces of the Gromov–Hausdorff space into Hilbert spaces","arxiv":1,"date_published":"2025-11-20T00:00:00Z","ddc":["500"],"date_updated":"2026-01-05T12:19:09Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"publisher","file_date_updated":"2026-01-05T12:16:38Z","publication_identifier":{"issn":["1472-2747"],"eissn":["1472-2739"]},"intvolume":"        25","has_accepted_license":"1","oa":1,"author":[{"id":"c8b3499c-7a77-11eb-b046-aa368cbbf2ad","last_name":"Zava","first_name":"Nicolò","full_name":"Zava, Nicolò","orcid":"0000-0001-8686-1888"}],"external_id":{"arxiv":["2303.04730"]},"month":"11","date_created":"2025-12-29T12:09:09Z","citation":{"ieee":"N. Zava, “Coarse and bi-Lipschitz embeddability of subspaces of the Gromov–Hausdorff space into Hilbert spaces,” <i>Algebraic &#38; Geometric Topology</i>, vol. 25, no. 8. Mathematical Sciences Publishers, pp. 5153–5174, 2025.","chicago":"Zava, Nicolò. “Coarse and Bi-Lipschitz Embeddability of Subspaces of the Gromov–Hausdorff Space into Hilbert Spaces.” <i>Algebraic &#38; Geometric Topology</i>. Mathematical Sciences Publishers, 2025. <a href=\"https://doi.org/10.2140/agt.2025.25.5153\">https://doi.org/10.2140/agt.2025.25.5153</a>.","ista":"Zava N. 2025. Coarse and bi-Lipschitz embeddability of subspaces of the Gromov–Hausdorff space into Hilbert spaces. Algebraic &#38; Geometric Topology. 25(8), 5153–5174.","apa":"Zava, N. (2025). Coarse and bi-Lipschitz embeddability of subspaces of the Gromov–Hausdorff space into Hilbert spaces. <i>Algebraic &#38; Geometric Topology</i>. Mathematical Sciences Publishers. <a href=\"https://doi.org/10.2140/agt.2025.25.5153\">https://doi.org/10.2140/agt.2025.25.5153</a>","short":"N. Zava, Algebraic &#38; Geometric Topology 25 (2025) 5153–5174.","ama":"Zava N. Coarse and bi-Lipschitz embeddability of subspaces of the Gromov–Hausdorff space into Hilbert spaces. <i>Algebraic &#38; Geometric Topology</i>. 2025;25(8):5153-5174. doi:<a href=\"https://doi.org/10.2140/agt.2025.25.5153\">10.2140/agt.2025.25.5153</a>","mla":"Zava, Nicolò. “Coarse and Bi-Lipschitz Embeddability of Subspaces of the Gromov–Hausdorff Space into Hilbert Spaces.” <i>Algebraic &#38; Geometric Topology</i>, vol. 25, no. 8, Mathematical Sciences Publishers, 2025, pp. 5153–74, doi:<a href=\"https://doi.org/10.2140/agt.2025.25.5153\">10.2140/agt.2025.25.5153</a>."},"OA_type":"diamond","year":"2025","department":[{"_id":"HeEd"}],"status":"public","corr_author":"1","publication_status":"published","oa_version":"Published Version","page":"5153-5174","volume":25,"fulldoi":"https://doi.org/10.2140/agt.2025.25.5153","type":"journal_article","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publisher":"Mathematical Sciences Publishers","scopus_import":"1","publication":"Algebraic & Geometric Topology","project":[{"call_identifier":"FWF","grant_number":"I04245","name":"Algebraic Footprints of Geometric Features in Homology","_id":"26AD5D90-B435-11E9-9278-68D0E5697425"}],"article_type":"original","abstract":[{"text":"We discuss the embeddability of subspaces of the Gromov–Hausdorff space, which consists of isometry classes of compact metric spaces endowed with the Gromov–Hausdorff distance, into Hilbert spaces. These embeddings are particularly valuable for applications to topological data analysis. We prove that its subspace consisting of metric spaces with at most n points has asymptotic dimension n(n−1)∕2. Thus, there exists a coarse embedding of that space into a Hilbert space. On the contrary, if the number of points is not bounded, then the subspace cannot be coarsely embedded into any uniformly convex Banach space and so, in particular, into any Hilbert space. Furthermore, we prove that, even if we restrict to finite metric spaces whose diameter is bounded by some constant, the subspace still cannot be bi-Lipschitz embedded into any finite-dimensional Hilbert space. We obtain both nonembeddability results by finding obstructions to coarse and bi-Lipschitz embeddings in families of isometry classes of finite subsets of the real line endowed with the Euclidean–Hausdorff distance.","lang":"eng"}],"quality_controlled":"1","article_processing_charge":"No","doi":"10.2140/agt.2025.25.5153","acknowledgement":"The author was supported by the FWF Grant, Project number I4245-N35. The author would like to thank Thomas Weighill for the helpful discussions around Theorem 3.10, and Takamitsu Yamauchi for bringing to my attention the fundamental reference [35]. Furthermore, the author\r\nis thankful for the detailed and helpful comments of the reviewer of this manuscript.","file":[{"date_updated":"2026-01-05T12:16:38Z","date_created":"2026-01-05T12:16:38Z","access_level":"open_access","content_type":"application/pdf","success":1,"file_id":"20943","checksum":"1e05b4f17a44500ae1ae1e21bc636f6a","file_name":"2025_AlgebraicGeomTopology_Zava.pdf","creator":"dernst","file_size":574389,"relation":"main_file"}]},{"ec_funded":1,"fulldoi":"https://doi.org/10.1016/j.aim.2024.110055","type":"journal_article","publisher":"Elsevier","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2310.18238"}],"corr_author":"1","publication_status":"published","oa_version":"Preprint","article_number":"110055","volume":461,"doi":"10.1016/j.aim.2024.110055","acknowledgement":"Work by the first and third authors is partially supported by the European Research Council (ERC), grant no. 788183, by the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31, and by the DFG Collaborative Research Center TRR 109, Austrian Science Fund (FWF), grant no. I 02979-N35. Work by the second author is partially supported by the Alexander von Humboldt Foundation.","project":[{"call_identifier":"H2020","grant_number":"788183","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342","name":"Mathematics, Computer Science","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes"}],"publication":"Advances in Mathematics","article_type":"original","abstract":[{"lang":"eng","text":"The local angle property of the (order-1) Delaunay triangulations of a generic set in R2\r\n asserts that the sum of two angles opposite a common edge is less than π. This paper extends this property to higher order and uses it to generalize two classic properties from order-1 to order-2: (1) among the complete level-2 hypertriangulations of a generic point set in R2, the order-2 Delaunay triangulation lexicographically maximizes the sorted angle vector; (2) among the maximal level-2 hypertriangulations of a generic point set in R2, the order-2 Delaunay triangulation is the only one that has the local angle property. We also use our method of establishing (2) to give a new short proof of the angle vector optimality for the (order-1) Delaunay triangulation. For order-1, both properties have been instrumental in numerous applications of Delaunay triangulations, and we expect that their generalization will make order-2 Delaunay triangulations more attractive to applications as well."}],"quality_controlled":"1","article_processing_charge":"No","date_published":"2025-02-01T00:00:00Z","date_updated":"2025-04-15T07:16:53Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"repository","intvolume":"       461","publication_identifier":{"issn":["0001-8708"],"eissn":["1090-2082"]},"_id":"18626","language":[{"iso":"eng"}],"day":"01","isi":1,"title":"Order-2 Delaunay triangulations optimize angles","arxiv":1,"date_created":"2024-12-08T23:01:54Z","citation":{"mla":"Edelsbrunner, Herbert, et al. “Order-2 Delaunay Triangulations Optimize Angles.” <i>Advances in Mathematics</i>, vol. 461, 110055, Elsevier, 2025, doi:<a href=\"https://doi.org/10.1016/j.aim.2024.110055\">10.1016/j.aim.2024.110055</a>.","short":"H. Edelsbrunner, A. Garber, M. Saghafian, Advances in Mathematics 461 (2025).","apa":"Edelsbrunner, H., Garber, A., &#38; Saghafian, M. (2025). Order-2 Delaunay triangulations optimize angles. <i>Advances in Mathematics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.aim.2024.110055\">https://doi.org/10.1016/j.aim.2024.110055</a>","ama":"Edelsbrunner H, Garber A, Saghafian M. Order-2 Delaunay triangulations optimize angles. <i>Advances in Mathematics</i>. 2025;461. doi:<a href=\"https://doi.org/10.1016/j.aim.2024.110055\">10.1016/j.aim.2024.110055</a>","ieee":"H. Edelsbrunner, A. Garber, and M. Saghafian, “Order-2 Delaunay triangulations optimize angles,” <i>Advances in Mathematics</i>, vol. 461. Elsevier, 2025.","ista":"Edelsbrunner H, Garber A, Saghafian M. 2025. Order-2 Delaunay triangulations optimize angles. Advances in Mathematics. 461, 110055.","chicago":"Edelsbrunner, Herbert, Alexey Garber, and Morteza Saghafian. “Order-2 Delaunay Triangulations Optimize Angles.” <i>Advances in Mathematics</i>. Elsevier, 2025. <a href=\"https://doi.org/10.1016/j.aim.2024.110055\">https://doi.org/10.1016/j.aim.2024.110055</a>."},"year":"2025","OA_type":"green","department":[{"_id":"HeEd"}],"status":"public","oa":1,"author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"full_name":"Garber, Alexey","last_name":"Garber","first_name":"Alexey"},{"first_name":"Morteza","id":"f86f7148-b140-11ec-9577-95435b8df824","last_name":"Saghafian","full_name":"Saghafian, Morteza"}],"external_id":{"arxiv":["2310.18238"],"isi":["001370682500001"]},"month":"02"},{"article_processing_charge":"No","quality_controlled":"1","abstract":[{"text":"Simplets are elementary units within simplicial complexes and are fundamental for analyzing the structure of simplicial complexes. Previous efforts have mainly focused on accurately counting or approximating the number of simplets rather than studying their frequencies. However, analyzing simplet frequencies is more practical for large-scale simplicial complexes. This paper introduces the Simplet Frequency Distribution (SFD) vector, which enables the analysis of simplet frequencies in simplicial complexes. Additionally, we provide a bound on the sample complexity required to approximate the SFD vector using any uniform sampling-based algorithm accurately. We extend the definition of simplet frequency distribution to encompass simplices, allowing for the analysis of simplet frequencies within simplices of simplicial complexes. This paper introduces the Simplet Degree Vector (SDV) and the Simplet Degree Centrality (SDC), facilitating this analysis for each simplex. Furthermore, we present a bound on the sample complexity required for accurately approximating the SDV and SDC for a set of simplices using any uniform sampling-based algorithm. We also introduce algorithms for approximating SFD, geometric SFD, SDV, and SDC. We also validate the theoretical bounds with experiments on random simplicial complexes and demonstrate the practical application through a case study.","lang":"eng"}],"article_type":"original","publication":"Information Sciences","project":[{"grant_number":"788183","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425","name":"Mathematics, Computer Science","grant_number":"Z00342"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes","call_identifier":"FWF"}],"acknowledgement":"The authors would like to thank the anonymous reviewers for their valuable comments and suggestions, which improved this paper.\r\nWork by the first and fourth authors is partially supported by the European Research Council (ERC), grant no. 788183, by the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31, and by the DFG Collaborative Research Center TRR 109, Austrian Science Fund (FWF), grant no. I 02979-N35.","doi":"10.1016/j.ins.2025.122425","volume":719,"article_number":"122425","oa_version":"None","publication_status":"published","corr_author":"1","scopus_import":"1","publisher":"Elsevier","type":"journal_article","fulldoi":"https://doi.org/10.1016/j.ins.2025.122425","ec_funded":1,"month":"11","external_id":{"isi":["001516170500002"]},"author":[{"full_name":"Mahini, Mohammad","last_name":"Mahini","first_name":"Mohammad"},{"full_name":"Beigy, Hamid","first_name":"Hamid","last_name":"Beigy"},{"full_name":"Qadami, Salman","last_name":"Qadami","first_name":"Salman"},{"full_name":"Saghafian, Morteza","last_name":"Saghafian","id":"f86f7148-b140-11ec-9577-95435b8df824","first_name":"Morteza"}],"status":"public","department":[{"_id":"HeEd"}],"year":"2025","OA_type":"closed access","date_created":"2025-06-30T08:48:48Z","citation":{"apa":"Mahini, M., Beigy, H., Qadami, S., &#38; Saghafian, M. (2025). Simplet-based signatures and approximation in simplicial complexes: Frequency, degree, and centrality. <i>Information Sciences</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ins.2025.122425\">https://doi.org/10.1016/j.ins.2025.122425</a>","short":"M. Mahini, H. Beigy, S. Qadami, M. Saghafian, Information Sciences 719 (2025).","ama":"Mahini M, Beigy H, Qadami S, Saghafian M. Simplet-based signatures and approximation in simplicial complexes: Frequency, degree, and centrality. <i>Information Sciences</i>. 2025;719(11). doi:<a href=\"https://doi.org/10.1016/j.ins.2025.122425\">10.1016/j.ins.2025.122425</a>","mla":"Mahini, Mohammad, et al. “Simplet-Based Signatures and Approximation in Simplicial Complexes: Frequency, Degree, and Centrality.” <i>Information Sciences</i>, vol. 719, no. 11, 122425, Elsevier, 2025, doi:<a href=\"https://doi.org/10.1016/j.ins.2025.122425\">10.1016/j.ins.2025.122425</a>.","ieee":"M. Mahini, H. Beigy, S. Qadami, and M. Saghafian, “Simplet-based signatures and approximation in simplicial complexes: Frequency, degree, and centrality,” <i>Information Sciences</i>, vol. 719, no. 11. Elsevier, 2025.","ista":"Mahini M, Beigy H, Qadami S, Saghafian M. 2025. Simplet-based signatures and approximation in simplicial complexes: Frequency, degree, and centrality. Information Sciences. 719(11), 122425.","chicago":"Mahini, Mohammad, Hamid Beigy, Salman Qadami, and Morteza Saghafian. “Simplet-Based Signatures and Approximation in Simplicial Complexes: Frequency, Degree, and Centrality.” <i>Information Sciences</i>. Elsevier, 2025. <a href=\"https://doi.org/10.1016/j.ins.2025.122425\">https://doi.org/10.1016/j.ins.2025.122425</a>."},"title":"Simplet-based signatures and approximation in simplicial complexes: Frequency, degree, and centrality","isi":1,"issue":"11","day":"01","language":[{"iso":"eng"}],"_id":"19937","intvolume":"       719","publication_identifier":{"issn":["0020-0255"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2025-12-30T09:05:32Z","date_published":"2025-11-01T00:00:00Z"},{"type":"conference","fulldoi":"https://doi.org/10.4230/LIPIcs.SoCG.2025.43","scopus_import":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","publication_status":"published","corr_author":"1","alternative_title":["LIPIcs"],"volume":332,"article_number":"43","acknowledgement":"Herbert Edelsbrunner: partially supported by the Wittgenstein Prize, Austrian Science\r\nFund (FWF), grant no. Z 342-N31, and by the DFG Collaborative Research Center TRR 109,\r\nAustrian Science Fund (FWF), grant no. I 02979-N35.\r\nAlexey Garber: partially supported by the Simons Foundation.\r\nMorteza Saghafian: partially supported by the Wittgenstein Prize, Austrian Science Fund (FWF),\r\ngrant no. Z 342-N31, and by the DFG Collaborative Research Center TRR 109, Austrian Science\r\nFund (FWF), grant no. I 02979-N35","doi":"10.4230/LIPIcs.SoCG.2025.43","file":[{"creator":"dernst","file_name":"2025_LIPIcs.SoCG_Edelsbrunner.pdf","checksum":"b5313ed8575ea87913c71a6e3c7513c8","file_size":661893,"file_id":"20016","success":1,"relation":"main_file","date_created":"2025-07-14T07:24:22Z","date_updated":"2025-07-14T07:24:22Z","content_type":"application/pdf","access_level":"open_access"}],"abstract":[{"text":"We generalize a classical result by Boris Delaunay that introduced Delaunay triangulations. In particular, we prove that for a locally finite and coarsely dense generic point set A in ℝ^d, every generic point of ℝ^d belongs to exactly binom(d+k,d) simplices whose vertices belong to A and whose circumspheres enclose exactly k points of A. We extend this result to the cases in which the points are weighted, and when A contains only finitely many points in ℝ^d or in 𝕊^d. Furthermore, we use the result to give a new geometric proof for the fact that volumes of hypersimplices are Eulerian numbers.","lang":"eng"}],"project":[{"call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425","name":"Mathematics, Computer Science","grant_number":"Z00342"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes","call_identifier":"FWF"}],"publication":"41st International Symposium on Computational Geometry","article_processing_charge":"Yes","quality_controlled":"1","date_published":"2025-06-20T00:00:00Z","ddc":["510"],"date_updated":"2025-07-14T07:26:14Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"isbn":["9783959773706"],"eissn":["1868-8969"]},"intvolume":"       332","file_date_updated":"2025-07-14T07:24:22Z","OA_place":"publisher","day":"20","language":[{"iso":"eng"}],"_id":"20005","arxiv":1,"title":"On spheres with k points inside","department":[{"_id":"HeEd"}],"OA_type":"gold","year":"2025","citation":{"mla":"Edelsbrunner, Herbert, et al. “On Spheres with k Points Inside.” <i>41st International Symposium on Computational Geometry</i>, vol. 332, 43, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2025.43\">10.4230/LIPIcs.SoCG.2025.43</a>.","ama":"Edelsbrunner H, Garber A, Saghafian M. On spheres with k points inside. In: <i>41st International Symposium on Computational Geometry</i>. Vol 332. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2025.43\">10.4230/LIPIcs.SoCG.2025.43</a>","short":"H. Edelsbrunner, A. Garber, M. Saghafian, in:, 41st International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","apa":"Edelsbrunner, H., Garber, A., &#38; Saghafian, M. (2025). On spheres with k points inside. In <i>41st International Symposium on Computational Geometry</i> (Vol. 332). Kanazawa, Japan: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2025.43\">https://doi.org/10.4230/LIPIcs.SoCG.2025.43</a>","chicago":"Edelsbrunner, Herbert, Alexey Garber, and Morteza Saghafian. “On Spheres with k Points Inside.” In <i>41st International Symposium on Computational Geometry</i>, Vol. 332. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2025.43\">https://doi.org/10.4230/LIPIcs.SoCG.2025.43</a>.","ista":"Edelsbrunner H, Garber A, Saghafian M. 2025. On spheres with k points inside. 41st International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 332, 43.","ieee":"H. Edelsbrunner, A. Garber, and M. Saghafian, “On spheres with k points inside,” in <i>41st International Symposium on Computational Geometry</i>, Kanazawa, Japan, 2025, vol. 332."},"date_created":"2025-07-13T22:01:22Z","status":"public","author":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Alexey","last_name":"Garber","full_name":"Garber, Alexey"},{"first_name":"Morteza","last_name":"Saghafian","id":"f86f7148-b140-11ec-9577-95435b8df824","full_name":"Saghafian, Morteza"}],"conference":{"location":"Kanazawa, Japan","name":"SoCG: Symposium on Computational Geometry","end_date":"2025-06-27","start_date":"2025-06-23"},"oa":1,"has_accepted_license":"1","month":"06","external_id":{"arxiv":["2410.21204"]}},{"publication":"41st International Symposium on Computational Geometry","project":[{"_id":"9B9290DE-BA93-11EA-9121-9846C619BF3A","name":"Vienna Graduate School on Computational Optimization","grant_number":"W1260-N35"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","call_identifier":"FWF"},{"call_identifier":"FWF","grant_number":"Z00342","name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425"}],"abstract":[{"text":"In numerous fields, dynamic time series data require continuous updates, necessitating efficient data processing techniques for accurate analysis. This paper examines the banana tree data structure, specifically designed to efficiently maintain the multi-scale topological descriptor commonly known as persistent homology for dynamically changing time series data. We implement this data structure and conduct an experimental study to assess its properties and runtime for update operations. Our findings indicate that banana trees are highly effective with unbiased random data, outperforming state-of-the-art static algorithms in these scenarios. Additionally, our results show that real-world time series share structural properties with unbiased random walks, suggesting potential practical utility for our implementation.","lang":"eng"}],"quality_controlled":"1","article_processing_charge":"Yes","doi":"10.4230/LIPIcs.SoCG.2025.71","related_material":{"link":[{"relation":"software","url":"https://github.com/laraost/BananaPersist"}]},"acknowledgement":"Lara Ost: Supported by the Vienna Graduate School on Computational Optimization\r\n(VGSCO), FWF project no. W1260-N35.\r\nSebastiano Cultrera di Montesano: Supported by the Eric and Wendy Schmidt Center at the Broad Institute of MIT and Harvard.\r\nHerbert Edelsbrunner: Partially supported by the Wittgenstein Prize, FWF grant no. Z 342-N31,\r\nand by the DFG Collaborative Research Center TRR 109, FWF grant no. I 02979-N35.","file":[{"date_updated":"2025-07-14T08:23:38Z","date_created":"2025-07-14T08:23:38Z","content_type":"application/pdf","access_level":"open_access","file_name":"2025_LIPIcs.SoCG_Ost.pdf","checksum":"3a4a7a707a56e0cfdf51428782dee55a","file_size":834623,"creator":"dernst","file_id":"20017","success":1,"relation":"main_file"}],"corr_author":"1","oa_version":"Published Version","publication_status":"published","volume":332,"alternative_title":["LIPIcs"],"article_number":"71","type":"conference","fulldoi":"https://doi.org/10.4230/LIPIcs.SoCG.2025.71","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"scopus_import":"1","has_accepted_license":"1","oa":1,"author":[{"full_name":"Ost, Lara","first_name":"Lara","last_name":"Ost"},{"id":"34D2A09C-F248-11E8-B48F-1D18A9856A87","last_name":"Cultrera di Montesano","first_name":"Sebastiano","orcid":"0000-0001-6249-0832","full_name":"Cultrera di Montesano, Sebastiano"},{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner"}],"conference":{"start_date":"2025-06-23","end_date":"2025-06-27","name":"SoCG: Symposium on Computational Geometry","location":"Kanazawa, Japan"},"external_id":{"arxiv":["2405.17920"]},"month":"06","year":"2025","OA_type":"gold","date_created":"2025-07-13T22:01:22Z","citation":{"apa":"Ost, L., Cultrera di Montesano, S., &#38; Edelsbrunner, H. (2025). Banana trees for the persistence in time series experimentally. In <i>41st International Symposium on Computational Geometry</i> (Vol. 332). Kanazawa, Japan: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2025.71\">https://doi.org/10.4230/LIPIcs.SoCG.2025.71</a>","short":"L. Ost, S. Cultrera di Montesano, H. Edelsbrunner, in:, 41st International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","ama":"Ost L, Cultrera di Montesano S, Edelsbrunner H. Banana trees for the persistence in time series experimentally. In: <i>41st International Symposium on Computational Geometry</i>. Vol 332. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2025.71\">10.4230/LIPIcs.SoCG.2025.71</a>","mla":"Ost, Lara, et al. “Banana Trees for the Persistence in Time Series Experimentally.” <i>41st International Symposium on Computational Geometry</i>, vol. 332, 71, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2025.71\">10.4230/LIPIcs.SoCG.2025.71</a>.","ieee":"L. Ost, S. Cultrera di Montesano, and H. Edelsbrunner, “Banana trees for the persistence in time series experimentally,” in <i>41st International Symposium on Computational Geometry</i>, Kanazawa, Japan, 2025, vol. 332.","chicago":"Ost, Lara, Sebastiano Cultrera di Montesano, and Herbert Edelsbrunner. “Banana Trees for the Persistence in Time Series Experimentally.” In <i>41st International Symposium on Computational Geometry</i>, Vol. 332. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2025.71\">https://doi.org/10.4230/LIPIcs.SoCG.2025.71</a>.","ista":"Ost L, Cultrera di Montesano S, Edelsbrunner H. 2025. Banana trees for the persistence in time series experimentally. 41st International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 332, 71."},"department":[{"_id":"HeEd"}],"status":"public","_id":"20006","language":[{"iso":"eng"}],"day":"20","title":"Banana trees for the persistence in time series experimentally","arxiv":1,"date_published":"2025-06-20T00:00:00Z","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2025-12-30T11:04:33Z","OA_place":"publisher","intvolume":"       332","publication_identifier":{"isbn":["9783959773706"],"eissn":["1868-8969"]},"file_date_updated":"2025-07-14T08:23:38Z"},{"PlanS_conform":"1","day":"01","language":[{"iso":"eng"}],"_id":"20260","title":"Burning or collapsing the medial axis is unstable","date_published":"2025-12-01T00:00:00Z","date_updated":"2026-04-07T11:42:48Z","ddc":["510"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"         4","publication_identifier":{"eissn":["2730-9657"]},"file_date_updated":"2025-12-30T07:52:58Z","OA_place":"publisher","author":[{"full_name":"Chambers, Erin Wolf","last_name":"Chambers","first_name":"Erin Wolf"},{"full_name":"Fillmore, Christopher D","first_name":"Christopher D","last_name":"Fillmore","id":"35638A5C-AAC7-11E9-B0BF-5503E6697425"},{"last_name":"Stephenson","id":"2D04F932-F248-11E8-B48F-1D18A9856A87","first_name":"Elizabeth R","orcid":"0000-0002-6862-208X","full_name":"Stephenson, Elizabeth R"},{"first_name":"Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","last_name":"Wintraecken","full_name":"Wintraecken, Mathijs","orcid":"0000-0002-7472-2220"}],"has_accepted_license":"1","oa":1,"month":"12","department":[{"_id":"HeEd"}],"OA_type":"hybrid","year":"2025","citation":{"chicago":"Chambers, Erin Wolf, Christopher D Fillmore, Elizabeth R Stephenson, and Mathijs Wintraecken. “Burning or Collapsing the Medial Axis Is Unstable.” <i>La Matematica</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/s44007-025-00170-0\">https://doi.org/10.1007/s44007-025-00170-0</a>.","ista":"Chambers EW, Fillmore CD, Stephenson ER, Wintraecken M. 2025. Burning or collapsing the medial axis is unstable. La Matematica. 4, 811–828.","ieee":"E. W. Chambers, C. D. Fillmore, E. R. Stephenson, and M. Wintraecken, “Burning or collapsing the medial axis is unstable,” <i>La Matematica</i>, vol. 4. Springer Nature, pp. 811–828, 2025.","ama":"Chambers EW, Fillmore CD, Stephenson ER, Wintraecken M. Burning or collapsing the medial axis is unstable. <i>La Matematica</i>. 2025;4:811-828. doi:<a href=\"https://doi.org/10.1007/s44007-025-00170-0\">10.1007/s44007-025-00170-0</a>","apa":"Chambers, E. W., Fillmore, C. D., Stephenson, E. R., &#38; Wintraecken, M. (2025). Burning or collapsing the medial axis is unstable. <i>La Matematica</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s44007-025-00170-0\">https://doi.org/10.1007/s44007-025-00170-0</a>","short":"E.W. Chambers, C.D. Fillmore, E.R. Stephenson, M. Wintraecken, La Matematica 4 (2025) 811–828.","mla":"Chambers, Erin Wolf, et al. “Burning or Collapsing the Medial Axis Is Unstable.” <i>La Matematica</i>, vol. 4, Springer Nature, 2025, pp. 811–28, doi:<a href=\"https://doi.org/10.1007/s44007-025-00170-0\">10.1007/s44007-025-00170-0</a>."},"date_created":"2025-08-31T22:01:33Z","status":"public","oa_version":"Published Version","publication_status":"published","corr_author":"1","volume":4,"page":"811-828","type":"journal_article","ec_funded":1,"fulldoi":"https://doi.org/10.1007/s44007-025-00170-0","scopus_import":"1","publisher":"Springer Nature","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_type":"original","abstract":[{"lang":"eng","text":"The medial axis of a set consists of the points in the ambient space without a unique closest point in the original set. Since its introduction, the medial axis has been used extensively in many applications as a method of computing a skeleton topologically equivalent to the original set. Unfortunately, one limiting factor in the use of the medial axis of a smooth manifold is that it is not necessarily topologically stable under small perturbations of the manifold. To counter these instabilities, various prunings of the medial axis have been proposed in the computational geometry community. Here, we examine one type of pruning, called burning. Because of the good experimental results it was hoped that the burning method of simplifying the medial axis would be stable. In this work, we show a simple example that dashes such hopes. Based on Bing’s house with two rooms, we demonstrate an isotopy of a shape where the medial axis goes from collapsible to non-collapsible. More precisely, we consider the standard deformation retract from the closed ball to Bing’s house with two rooms, but stop just short of the point where Bing’s house becomes two dimensional. This way we obtain an isotopy from the 3-ball to a thickened version of Bing’s house. Under this isotopy, the medial axis goes from collapsible to non-collapsible. We stress that this isotopy can be made generic, in the sense of singularity theory, as developed by Arnol’d and Thom."}],"publication":"La Matematica","project":[{"call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended","grant_number":"788183"},{"_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020"},{"_id":"fc390959-9c52-11eb-aca3-afa58bd282b2","name":"Learning and triangulating manifolds via collapses","grant_number":"M03073"}],"article_processing_charge":"Yes (via OA deal)","quality_controlled":"1","acknowledgement":"We thank André Lieutier, David Letscher, Ellen Gasparovic, Kathryn Leonard, and Tao Ju for early discussions on this work. We also thank Lu Liu, Yajie Yan, and Tao Ju for sharing code to generate the examples. We further thank Abigail Thompson for discussion on the conjecture and James Damon for sharing his insight in singularity theory. We thank the reviewers for their detailed reviews, which helped to improve the exposition.\r\nOpen access funding provided by Institute of Science and Technology (IST Austria). Partially supported by the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’ and the European Research Council (ERC), grant no. 788183, ‘Alpha Shape Theory Extended’. The first author was supported in part by the National Science Foundation through grants DBI-1759807, CCF-1907612, and CCF-2444309. The fourth author was supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411, the Austrian science fund (FWF) M-3073, ANR grant StratMesh, ANR-24-CE48-1899, and the welcome package from IDEX of the Université Côte d’Azur, ANR-15-IDEX-01.","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"21021"}]},"doi":"10.1007/s44007-025-00170-0","file":[{"relation":"main_file","checksum":"e2043259194bfcdf3d74c4da8a5a853f","creator":"dernst","file_size":2678640,"file_name":"2025_LaMatematica_Chambers.pdf","success":1,"file_id":"20885","content_type":"application/pdf","access_level":"open_access","date_created":"2025-12-30T07:52:58Z","date_updated":"2025-12-30T07:52:58Z"}]},{"article_number":"854","volume":27,"publication_status":"published","oa_version":"Published Version","corr_author":"1","scopus_import":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publisher":"MDPI","fulldoi":"https://doi.org/10.3390/e27080854","ec_funded":1,"DOAJ_listed":"1","type":"journal_article","article_processing_charge":"Yes","quality_controlled":"1","abstract":[{"lang":"eng","text":"Motivated by questions arising at the intersection of information theory and geometry, we compare two dissimilarity measures between finite categorical distributions. One is the well-known Jensen–Shannon divergence, which is easy to compute and whose square root is a proper metric. The other is what we call the minmax divergence, which is harder to compute. Just like the Jensen–Shannon divergence, it arises naturally from the Kullback–Leibler divergence. The main contribution of this paper is a proof showing that the minmax divergence can be tightly approximated by the Jensen–Shannon divergence. The bounds suggest that the square root of the minmax divergence is a metric, and we prove that this is indeed true in the one-dimensional case. The general case remains open. Finally, we consider analogous questions in the context of another Bregman divergence and the corresponding Burbea–Rao (Jensen–Bregman) divergence."}],"article_type":"original","publication":"Entropy","project":[{"name":"Alpha Shape Theory Extended","grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425","name":"Mathematics, Computer Science","grant_number":"Z00342"},{"grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"file":[{"file_id":"20309","success":1,"checksum":"65c5399c4015d9c8abb8c7a96f3d7836","creator":"dernst","file_name":"2025_Entropy_Akopyan.pdf","file_size":379340,"relation":"main_file","date_created":"2025-09-08T07:55:48Z","date_updated":"2025-09-08T07:55:48Z","access_level":"open_access","content_type":"application/pdf"}],"acknowledgement":"This research received partial funding from the European Research Council (ERC) under\r\nthe European Union’s Horizon 2020 research and innovation programme, grant no. 788183, the\r\nWittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31, the DFG Collaborative\r\nResearch Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), grant no. I 02979-N35, and the 2022 Google Research Scholar Award for project ‘Algorithms for Topological Analysis of Neural Networks’. The APC was waived.","doi":"10.3390/e27080854","title":"Tight bounds between the Jensen–Shannon divergence and the minmax divergence","PlanS_conform":"1","day":"01","pmid":1,"isi":1,"issue":"8","language":[{"iso":"eng"}],"_id":"20293","file_date_updated":"2025-09-08T07:55:48Z","intvolume":"        27","publication_identifier":{"eissn":["1099-4300"]},"OA_place":"publisher","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-30T14:32:31Z","ddc":["500"],"date_published":"2025-08-01T00:00:00Z","month":"08","external_id":{"isi":["001557476000001"],"pmid":["40870326"]},"author":[{"full_name":"Akopyan, Arseniy","orcid":"0000-0002-2548-617X","first_name":"Arseniy","last_name":"Akopyan","id":"430D2C90-F248-11E8-B48F-1D18A9856A87"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"id":"2E36B656-F248-11E8-B48F-1D18A9856A87","last_name":"Virk","first_name":"Ziga","full_name":"Virk, Ziga"},{"full_name":"Wagner, Hubert","first_name":"Hubert","last_name":"Wagner","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87"}],"has_accepted_license":"1","oa":1,"status":"public","department":[{"_id":"HeEd"}],"citation":{"mla":"Akopyan, Arseniy, et al. “Tight Bounds between the Jensen–Shannon Divergence and the Minmax Divergence.” <i>Entropy</i>, vol. 27, no. 8, 854, MDPI, 2025, doi:<a href=\"https://doi.org/10.3390/e27080854\">10.3390/e27080854</a>.","short":"A. Akopyan, H. Edelsbrunner, Z. Virk, H. Wagner, Entropy 27 (2025).","apa":"Akopyan, A., Edelsbrunner, H., Virk, Z., &#38; Wagner, H. (2025). Tight bounds between the Jensen–Shannon divergence and the minmax divergence. <i>Entropy</i>. MDPI. <a href=\"https://doi.org/10.3390/e27080854\">https://doi.org/10.3390/e27080854</a>","ama":"Akopyan A, Edelsbrunner H, Virk Z, Wagner H. Tight bounds between the Jensen–Shannon divergence and the minmax divergence. <i>Entropy</i>. 2025;27(8). doi:<a href=\"https://doi.org/10.3390/e27080854\">10.3390/e27080854</a>","ieee":"A. Akopyan, H. Edelsbrunner, Z. Virk, and H. Wagner, “Tight bounds between the Jensen–Shannon divergence and the minmax divergence,” <i>Entropy</i>, vol. 27, no. 8. MDPI, 2025.","chicago":"Akopyan, Arseniy, Herbert Edelsbrunner, Ziga Virk, and Hubert Wagner. “Tight Bounds between the Jensen–Shannon Divergence and the Minmax Divergence.” <i>Entropy</i>. MDPI, 2025. <a href=\"https://doi.org/10.3390/e27080854\">https://doi.org/10.3390/e27080854</a>.","ista":"Akopyan A, Edelsbrunner H, Virk Z, Wagner H. 2025. Tight bounds between the Jensen–Shannon divergence and the minmax divergence. Entropy. 27(8), 854."},"date_created":"2025-09-07T22:01:33Z","year":"2025","OA_type":"gold"},{"fulldoi":"https://doi.org/10.1007/978-3-032-09544-2_10","type":"conference","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2504.14743","open_access":"1"}],"scopus_import":"1","publisher":"Springer Nature","publication_status":"published","oa_version":"Preprint","page":"133-147","alternative_title":["LNCS"],"volume":16296,"doi":"10.1007/978-3-032-09544-2_10","abstract":[{"lang":"eng","text":"The medial axis of a smoothly embedded surface in R^3 consists of all points for which the Euclidean distance function on the surface has at least two global minima. We generalize this notion to the mid-sphere axis, which consists of all points for which the Euclidean distance function has two interchanging saddles that swap their partners in the pairing by persistent homology. It offers a discrete-algebraic multi-scale approach to computing ridge-like structures on the surface. As a proof of concept, an algorithm that computes stair-case approximations of the mid-sphere axis is provided."}],"publication":"4th International Joint Conference on Discrete Geometry and Mathematical Morphology","article_processing_charge":"No","quality_controlled":"1","date_updated":"2025-11-24T10:05:11Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2025-11-01T00:00:00Z","intvolume":"     16296","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783032095435"],"issn":["0302-9743"]},"OA_place":"repository","day":"01","language":[{"iso":"eng"}],"_id":"20658","arxiv":1,"title":"The mid-sphere cousin of the medial axis transform","department":[{"_id":"HeEd"}],"citation":{"chicago":"Edelsbrunner, Herbert, Elizabeth R Stephenson, and Martin H Thoresen. “The Mid-Sphere Cousin of the Medial Axis Transform.” In <i>4th International Joint Conference on Discrete Geometry and Mathematical Morphology</i>, 16296:133–47. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-032-09544-2_10\">https://doi.org/10.1007/978-3-032-09544-2_10</a>.","ista":"Edelsbrunner H, Stephenson ER, Thoresen MH. 2025. The mid-sphere cousin of the medial axis transform. 4th International Joint Conference on Discrete Geometry and Mathematical Morphology. DGMM: Discrete Geometry and Mathematical Morphology, LNCS, vol. 16296, 133–147.","ieee":"H. Edelsbrunner, E. R. Stephenson, and M. H. Thoresen, “The mid-sphere cousin of the medial axis transform,” in <i>4th International Joint Conference on Discrete Geometry and Mathematical Morphology</i>, Groningen, The Netherlands, 2025, vol. 16296, pp. 133–147.","ama":"Edelsbrunner H, Stephenson ER, Thoresen MH. The mid-sphere cousin of the medial axis transform. In: <i>4th International Joint Conference on Discrete Geometry and Mathematical Morphology</i>. Vol 16296. Springer Nature; 2025:133-147. doi:<a href=\"https://doi.org/10.1007/978-3-032-09544-2_10\">10.1007/978-3-032-09544-2_10</a>","short":"H. Edelsbrunner, E.R. Stephenson, M.H. Thoresen, in:, 4th International Joint Conference on Discrete Geometry and Mathematical Morphology, Springer Nature, 2025, pp. 133–147.","apa":"Edelsbrunner, H., Stephenson, E. R., &#38; Thoresen, M. H. (2025). The mid-sphere cousin of the medial axis transform. In <i>4th International Joint Conference on Discrete Geometry and Mathematical Morphology</i> (Vol. 16296, pp. 133–147). Groningen, The Netherlands: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-032-09544-2_10\">https://doi.org/10.1007/978-3-032-09544-2_10</a>","mla":"Edelsbrunner, Herbert, et al. “The Mid-Sphere Cousin of the Medial Axis Transform.” <i>4th International Joint Conference on Discrete Geometry and Mathematical Morphology</i>, vol. 16296, Springer Nature, 2025, pp. 133–47, doi:<a href=\"https://doi.org/10.1007/978-3-032-09544-2_10\">10.1007/978-3-032-09544-2_10</a>."},"date_created":"2025-11-23T23:01:37Z","year":"2025","OA_type":"green","status":"public","conference":{"end_date":"2025-11-06","name":"DGMM: Discrete Geometry and Mathematical Morphology","location":"Groningen, The Netherlands","start_date":"2025-11-03"},"author":[{"last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"full_name":"Stephenson, Elizabeth R","orcid":"0000-0002-6862-208X","last_name":"Stephenson","id":"2D04F932-F248-11E8-B48F-1D18A9856A87","first_name":"Elizabeth R"},{"full_name":"Thoresen, Martin H","first_name":"Martin H","id":"47CB1472-F248-11E8-B48F-1D18A9856A87","last_name":"Thoresen"}],"oa":1,"month":"11","external_id":{"arxiv":["2504.14743"]}},{"department":[{"_id":"HeEd"}],"citation":{"ieee":"R. Gonzalez-Diaz, M. Soriano Trigueros, and A. Torras-Casas, “Additive partial matchings for persistent homology,” in <i>Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation</i>, Guanajuato, Mexico, 2025, pp. 188–196.","ista":"Gonzalez-Diaz R, Soriano Trigueros M, Torras-Casas A. 2025. Additive partial matchings for persistent homology. Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation. ISSAC: International Symposium on Symbolic and Algebraic Computation, 188–196.","chicago":"Gonzalez-Diaz, Rocio, Manuel Soriano Trigueros, and Alvaro Torras-Casas. “Additive Partial Matchings for Persistent Homology.” In <i>Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation</i>, 188–96. Association for Computing Machinery, 2025. <a href=\"https://doi.org/10.1145/3747199.3747561\">https://doi.org/10.1145/3747199.3747561</a>.","mla":"Gonzalez-Diaz, Rocio, et al. “Additive Partial Matchings for Persistent Homology.” <i>Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation</i>, Association for Computing Machinery, 2025, pp. 188–96, doi:<a href=\"https://doi.org/10.1145/3747199.3747561\">10.1145/3747199.3747561</a>.","apa":"Gonzalez-Diaz, R., Soriano Trigueros, M., &#38; Torras-Casas, A. (2025). Additive partial matchings for persistent homology. In <i>Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation</i> (pp. 188–196). Guanajuato, Mexico: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3747199.3747561\">https://doi.org/10.1145/3747199.3747561</a>","short":"R. Gonzalez-Diaz, M. Soriano Trigueros, A. Torras-Casas, in:, Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation, Association for Computing Machinery, 2025, pp. 188–196.","ama":"Gonzalez-Diaz R, Soriano Trigueros M, Torras-Casas A. Additive partial matchings for persistent homology. In: <i>Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation</i>. Association for Computing Machinery; 2025:188-196. doi:<a href=\"https://doi.org/10.1145/3747199.3747561\">10.1145/3747199.3747561</a>"},"date_created":"2025-12-07T23:02:01Z","OA_type":"hybrid","year":"2025","status":"public","conference":{"start_date":"2025-07-28","end_date":"2025-08-01","name":"ISSAC: International Symposium on Symbolic and Algebraic Computation","location":"Guanajuato, Mexico"},"author":[{"full_name":"Gonzalez-Diaz, Rocio","last_name":"Gonzalez-Diaz","first_name":"Rocio"},{"id":"15ebd7cf-15bf-11ee-aebd-bb4bb5121ea8","last_name":"Soriano Trigueros","first_name":"Manuel","orcid":"0000-0003-2449-1433","full_name":"Soriano Trigueros, Manuel"},{"first_name":"Alvaro","last_name":"Torras-Casas","full_name":"Torras-Casas, Alvaro"}],"has_accepted_license":"1","oa":1,"month":"11","ddc":["510"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2025-11-10T00:00:00Z","date_updated":"2025-12-09T13:46:42Z","file_date_updated":"2025-12-09T13:43:17Z","publication_identifier":{"isbn":["9798400720758"]},"OA_place":"publisher","day":"10","language":[{"iso":"eng"}],"_id":"20729","title":"Additive partial matchings for persistent homology","acknowledgement":"Álvaro Torras-Casas contract is funded by the French Agence Nationale de la Recherche through the project reference ANR-22-CPJ1-0047-01. Rocio Gonzalez-Diaz is partially funded by the European Union under grant agreement no. 101070028-2 (REXASI-PRO).","doi":"10.1145/3747199.3747561","file":[{"relation":"main_file","file_id":"20751","success":1,"checksum":"1c299cca165a20e2518afe4fda63dbf1","file_size":761617,"creator":"dernst","file_name":"2025_ISSAC_GonzalezDiaz.pdf","access_level":"open_access","content_type":"application/pdf","date_updated":"2025-12-09T13:43:17Z","date_created":"2025-12-09T13:43:17Z"}],"abstract":[{"lang":"eng","text":"Persistence modules (defined as a sequence of vector spaces and linear maps between them) are a key tool in topological data analysis. They are easy to interpret and fast to compute. However, when considering persistence maps (i.e. maps between persistence modules), these properties are lost. We propose a new invariant for persistence maps consisting of a partial matching such that: it is easy to interpret, it is more discriminative than the image of the persistence map, and can be calculated with cubical complexity."}],"publication":"Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation","article_processing_charge":"Yes (in subscription journal)","quality_controlled":"1","fulldoi":"https://doi.org/10.1145/3747199.3747561","type":"conference","scopus_import":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publisher":"Association for Computing Machinery","publication_status":"published","oa_version":"Published Version","corr_author":"1","page":"188-196"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2025-05-23T00:00:00Z","date_updated":"2026-07-22T06:33:07Z","das_tickbox":"1","OA_place":"repository","day":"23","language":[{"iso":"eng"}],"_id":"21016","arxiv":1,"title":"Identifying cobordisms using kernel persistence","department":[{"_id":"HeEd"}],"citation":{"mla":"Bokor Bleile, Yossi, et al. “Identifying Cobordisms Using Kernel Persistence.” <i>ArXiv</i>, 2505.17858, doi:<a href=\"https://doi.org/10.48550/arXiv.2505.17858\">10.48550/arXiv.2505.17858</a>.","ama":"Bokor Bleile Y, Fajstrup L, Heiss T, Svane AM, Sørensen SS. Identifying cobordisms using kernel persistence. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2505.17858\">10.48550/arXiv.2505.17858</a>","short":"Y. Bokor Bleile, L. Fajstrup, T. Heiss, A.M. Svane, S.S. Sørensen, ArXiv (n.d.).","apa":"Bokor Bleile, Y., Fajstrup, L., Heiss, T., Svane, A. M., &#38; Sørensen, S. S. (n.d.). Identifying cobordisms using kernel persistence. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2505.17858\">https://doi.org/10.48550/arXiv.2505.17858</a>","chicago":"Bokor Bleile, Yossi, Lisbeth Fajstrup, Teresa Heiss, Anne Marie Svane, and Søren Strandskov Sørensen. “Identifying Cobordisms Using Kernel Persistence.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2505.17858\">https://doi.org/10.48550/arXiv.2505.17858</a>.","ista":"Bokor Bleile Y, Fajstrup L, Heiss T, Svane AM, Sørensen SS. Identifying cobordisms using kernel persistence. arXiv, 2505.17858.","ieee":"Y. Bokor Bleile, L. Fajstrup, T. Heiss, A. M. Svane, and S. S. Sørensen, “Identifying cobordisms using kernel persistence,” <i>arXiv</i>. ."},"date_created":"2026-01-20T10:12:21Z","year":"2025","OA_type":"green","status":"public","author":[{"full_name":"Bleile, Yossi","orcid":"0000-0002-4861-9174","last_name":"Bleile","id":"920a7385-7995-11ef-9bfd-8c434cd8f3c2","first_name":"Yossi"},{"full_name":"Fajstrup, Lisbeth","first_name":"Lisbeth","last_name":"Fajstrup"},{"orcid":"0000-0002-1780-2689","full_name":"Heiss, Teresa","last_name":"Heiss","id":"4879BB4E-F248-11E8-B48F-1D18A9856A87","first_name":"Teresa"},{"full_name":"Svane, Anne Marie","first_name":"Anne Marie","last_name":"Svane"},{"full_name":"Sørensen, Søren Strandskov","first_name":"Søren Strandskov","last_name":"Sørensen"}],"oa":1,"month":"05","external_id":{"arxiv":["2505.17858"]},"fulldoi":"https://doi.org/10.48550/arXiv.2505.17858","ec_funded":1,"type":"preprint","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2505.17858"}],"publication_status":"submitted","oa_version":"Preprint","article_number":"2505.17858","acknowledgement":"Y. B. B. and L. F. were funded by the Independent Research Fund Denmark, grant\r\nnumber 1026-00037. T. H. was partially supported by the European Research Council\r\n(ERC) Horizon 2020, grant number 788183.","doi":"10.48550/arXiv.2505.17858","abstract":[{"text":"Motivated by applications in chemistry, we give a homlogical definition of tunnels, or more generally cobordisms, connecting disjoint parts of a cell complex. For a filtered complex, this defines a persistence module. We give a method for identifying birth and death times using kernel persistence and a matrix reduction algorithm for pairing birth and death times.","lang":"eng"}],"publication":"arXiv","project":[{"grant_number":"788183","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"article_processing_charge":"No"},{"article_processing_charge":"No","publication":"arXiv","abstract":[{"lang":"eng","text":"In 1873, James C. Maxwell conjectured that the electric field generated by $n$ point charges in generic position has at most $(n-1)^2$ isolated zeroes. The first (non-optimal) upper bound was only obtained in 2007 by Gabrielov, Novikov and Shapiro, who also posed two additional interesting conjectures.\r\n In this article, we give the best upper bound known to date on the number of zeroes of the electric field, and construct a counterexample to a conjecture of Gabrielov, Novikov and Shapiro that the number of equilibria cannot exceed those of the distance function defined by the unit point charges.\r\n Finally, we note that it is quite possible that Maxwell's quadratic upper bound is not tight, so it is prudent to find smaller bounds. Hence, we also explore examples and construct configurations of charges achieving the highest ratios of the number of electric field zeroes by point charges found to this day."}],"doi":"10.48550/ARXIV.2501.05315","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"21021"},{"relation":"later_version","status":"public","id":"21931"}]},"article_number":"2501.05315","corr_author":"1","oa_version":"Preprint","publication_status":"draft","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2501.05315"}],"type":"preprint","fulldoi":"https://doi.org/10.48550/ARXIV.2501.05315","external_id":{"arxiv":["2501.05315"]},"month":"03","oa":1,"author":[{"first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"id":"35638A5C-AAC7-11E9-B0BF-5503E6697425","last_name":"Fillmore","first_name":"Christopher D","full_name":"Fillmore, Christopher D"},{"first_name":"Gonçalo","last_name":"Olivera","full_name":"Olivera, Gonçalo"}],"status":"public","year":"2025","OA_type":"green","citation":{"ama":"Edelsbrunner H, Fillmore CD, Olivera G. Counting equilibria of the electrostatic potential. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/ARXIV.2501.05315\">10.48550/ARXIV.2501.05315</a>","apa":"Edelsbrunner, H., Fillmore, C. D., &#38; Olivera, G. (n.d.). Counting equilibria of the electrostatic potential. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/ARXIV.2501.05315\">https://doi.org/10.48550/ARXIV.2501.05315</a>","short":"H. Edelsbrunner, C.D. Fillmore, G. Olivera, ArXiv (n.d.).","mla":"Edelsbrunner, Herbert, et al. “Counting Equilibria of the Electrostatic Potential.” <i>ArXiv</i>, 2501.05315, doi:<a href=\"https://doi.org/10.48550/ARXIV.2501.05315\">10.48550/ARXIV.2501.05315</a>.","chicago":"Edelsbrunner, Herbert, Christopher D Fillmore, and Gonçalo Olivera. “Counting Equilibria of the Electrostatic Potential.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/ARXIV.2501.05315\">https://doi.org/10.48550/ARXIV.2501.05315</a>.","ista":"Edelsbrunner H, Fillmore CD, Olivera G. Counting equilibria of the electrostatic potential. arXiv, 2501.05315.","ieee":"H. Edelsbrunner, C. D. Fillmore, and G. Olivera, “Counting equilibria of the electrostatic potential,” <i>arXiv</i>. ."},"date_created":"2026-01-27T14:29:27Z","department":[{"_id":"HeEd"}],"title":"Counting equilibria of the electrostatic potential","arxiv":1,"language":[{"iso":"eng"}],"_id":"21050","day":"20","das_tickbox":"1","OA_place":"repository","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2025-03-20T00:00:00Z","date_updated":"2026-07-22T06:33:55Z"},{"author":[{"first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"orcid":"0000-0002-0659-3201","full_name":"Nikitenko, Anton","first_name":"Anton","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","last_name":"Nikitenko"}],"oa":1,"has_accepted_license":"1","month":"03","external_id":{"arxiv":["2012.03350"],"isi":["001238566200004"],"pmid":["39974750"]},"department":[{"_id":"HeEd"}],"OA_type":"hybrid","year":"2025","citation":{"mla":"Edelsbrunner, Herbert, and Anton Nikitenko. “Average and Expected Distortion of Voronoi Paths and Scapes.” <i>Discrete &#38; Computational Geometry</i>, vol. 73, Springer Nature, 2025, pp. 490–99, doi:<a href=\"https://doi.org/10.1007/s00454-024-00660-y\">10.1007/s00454-024-00660-y</a>.","short":"H. Edelsbrunner, A. Nikitenko, Discrete &#38; Computational Geometry 73 (2025) 490–499.","apa":"Edelsbrunner, H., &#38; Nikitenko, A. (2025). Average and expected distortion of Voronoi paths and scapes. <i>Discrete &#38; Computational Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00454-024-00660-y\">https://doi.org/10.1007/s00454-024-00660-y</a>","ama":"Edelsbrunner H, Nikitenko A. Average and expected distortion of Voronoi paths and scapes. <i>Discrete &#38; Computational Geometry</i>. 2025;73:490-499. doi:<a href=\"https://doi.org/10.1007/s00454-024-00660-y\">10.1007/s00454-024-00660-y</a>","ieee":"H. Edelsbrunner and A. Nikitenko, “Average and expected distortion of Voronoi paths and scapes,” <i>Discrete &#38; Computational Geometry</i>, vol. 73. Springer Nature, pp. 490–499, 2025.","ista":"Edelsbrunner H, Nikitenko A. 2025. Average and expected distortion of Voronoi paths and scapes. Discrete &#38; Computational Geometry. 73, 490–499.","chicago":"Edelsbrunner, Herbert, and Anton Nikitenko. “Average and Expected Distortion of Voronoi Paths and Scapes.” <i>Discrete &#38; Computational Geometry</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/s00454-024-00660-y\">https://doi.org/10.1007/s00454-024-00660-y</a>."},"date_created":"2024-06-16T22:01:07Z","status":"public","isi":1,"pmid":1,"day":"01","language":[{"iso":"eng"}],"_id":"17149","arxiv":1,"title":"Average and expected distortion of Voronoi paths and scapes","date_published":"2025-03-01T00:00:00Z","date_updated":"2026-10-02T11:48:46Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","ddc":["510"],"supplementarymaterial":"no","intvolume":"        73","publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"file_date_updated":"2025-04-23T07:31:32Z","OA_place":"publisher","das_tickbox":"0","abstract":[{"text":"The approximation of a circle with the edges of a fine square grid distorts the perimeter by a factor about 4/Pi. We prove that this factor is the same on average (in the ergodic sense) for approximations of any rectifiable curve by the edges of any non-exotic Delaunay mosaic (known as Voronoi path), and extend the results to all dimensions, generalizing Voronoi paths to Voronoi scapes.","lang":"eng"}],"article_type":"original","publication":"Discrete & Computational Geometry","researchdata_availability":"no","project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended","grant_number":"788183","call_identifier":"H2020"},{"grant_number":"Z00342","name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","call_identifier":"FWF"}],"article_processing_charge":"Yes (via OA deal)","quality_controlled":"1","acknowledgement":"The authors thank Ranita Biswas and Tatiana Ezubova for the collaboration on computational experiments that motivated the work reported in this paper. The authors also thank Daniel Bonnema for proofreading and noticing an issue with the original proof of Lemma 4.3.\r\nOpen access funding provided by Institute of Science and Technology (IST Austria).\r\nThis project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, Grant No. 788183, from the Wittgenstein Prize, Austrian Science Fund (FWF), Grant No. Z 342-N31, and from the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), Grant No. I 02979-N35.","doi":"10.1007/s00454-024-00660-y","file":[{"checksum":"ffb0c818222138f9f113f4bbea41e834","file_name":"2025_DiscreteComputGeom_EdelsbrunnerHe.pdf","file_size":283443,"creator":"dernst","success":1,"file_id":"19610","relation":"main_file","date_updated":"2025-04-23T07:31:32Z","date_created":"2025-04-23T07:31:32Z","content_type":"application/pdf","access_level":"open_access"}],"oa_version":"Published Version","publication_status":"published","corr_author":"1","volume":73,"page":"490-499","type":"journal_article","ec_funded":1,"fulldoi":"https://doi.org/10.1007/s00454-024-00660-y","scopus_import":"1","publisher":"Springer Nature","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"}}]