[{"project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183","call_identifier":"H2020","name":"Alpha Shape Theory Extended"},{"call_identifier":"FWF","name":"Mathematics, Computer Science","grant_number":"Z00342","_id":"268116B8-B435-11E9-9278-68D0E5697425"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes","call_identifier":"FWF","grant_number":"I02979-N35"}],"ddc":["510"],"intvolume":" 75","date_created":"2025-10-12T22:01:26Z","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","publisher":"Springer Nature","ec_funded":1,"volume":75,"type":"journal_article","acknowledgement":"The fourth author thanks Boris Aronov for insightful discussions on the size of the overlay of Voronoi tessellations. Open access funding provided by Institute of Science and Technology (IST Austria). This 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.","language":[{"iso":"eng"}],"publication_status":"published","arxiv":1,"citation":{"ama":"Biswas R, Cultrera di Montesano S, Draganov O, Edelsbrunner H, Saghafian M. On the size of chromatic Delaunay mosaics. Discrete and Computational Geometry. 2026;75:24-47. doi:10.1007/s00454-025-00778-7","short":"R. Biswas, S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner, M. Saghafian, Discrete and Computational Geometry 75 (2026) 24–47.","ieee":"R. Biswas, S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner, and M. Saghafian, “On the size of chromatic Delaunay mosaics,” Discrete and Computational Geometry, vol. 75. Springer Nature, pp. 24–47, 2026.","chicago":"Biswas, Ranita, Sebastiano Cultrera di Montesano, Ondrej Draganov, Herbert Edelsbrunner, and Morteza Saghafian. “On the Size of Chromatic Delaunay Mosaics.” Discrete and Computational Geometry. Springer Nature, 2026. https://doi.org/10.1007/s00454-025-00778-7.","apa":"Biswas, R., Cultrera di Montesano, S., Draganov, O., Edelsbrunner, H., & Saghafian, M. (2026). On the size of chromatic Delaunay mosaics. Discrete and Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-025-00778-7","mla":"Biswas, Ranita, et al. “On the Size of Chromatic Delaunay Mosaics.” Discrete and Computational Geometry, vol. 75, Springer Nature, 2026, pp. 24–47, doi:10.1007/s00454-025-00778-7.","ista":"Biswas R, Cultrera di Montesano S, Draganov O, Edelsbrunner H, Saghafian M. 2026. On the size of chromatic Delaunay mosaics. Discrete and Computational Geometry. 75, 24–47."},"isi":1,"external_id":{"isi":["001584166900001"],"arxiv":["2212.03121"]},"oa":1,"OA_type":"hybrid","page":"24-47","corr_author":"1","author":[{"id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5372-7890","last_name":"Biswas","full_name":"Biswas, Ranita","first_name":"Ranita"},{"orcid":"0000-0001-6249-0832","last_name":"Cultrera di Montesano","full_name":"Cultrera di Montesano, Sebastiano","first_name":"Sebastiano","id":"34D2A09C-F248-11E8-B48F-1D18A9856A87"},{"id":"2B23F01E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0464-3823","first_name":"Ondrej","full_name":"Draganov, Ondrej","last_name":"Draganov"},{"first_name":"Herbert","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Saghafian, Morteza","first_name":"Morteza","last_name":"Saghafian","id":"f86f7148-b140-11ec-9577-95435b8df824"}],"file":[{"file_name":"2026_DiscreteCompGeom_Biswas.pdf","date_updated":"2026-01-05T13:21:20Z","access_level":"open_access","date_created":"2026-01-05T13:21:20Z","relation":"main_file","checksum":"0addb5c1b78142f9fb453bfa04695400","success":1,"file_size":570922,"content_type":"application/pdf","creator":"dernst","file_id":"20952"}],"quality_controlled":"1","article_type":"original","date_updated":"2026-01-05T13:21:56Z","_id":"20456","OA_place":"publisher","year":"2026","scopus_import":"1","file_date_updated":"2026-01-05T13:21:20Z","publication":"Discrete and Computational Geometry","month":"01","abstract":[{"lang":"eng","text":"Given a locally finite set A⊆Rd and a coloring χ:A→{0,1,…,s}, we introduce the chromatic Delaunay mosaic of χ, which is a Delaunay mosaic in Rs+d that represents how points of different colors mingle. Our main results are bounds on the size of the chromatic Delaunay mosaic, in which we assume that d and s are constants. For example, if A is finite with n=#A, and the coloring is random, then the chromatic Delaunay mosaic has O(n⌈d/2⌉) cells in expectation. In contrast, for Delone sets and Poisson point processes in Rd, the expected number of cells within a closed ball is only a constant times the number of points in this ball. Furthermore, in R2 all colorings of a dense set of n points have chromatic Delaunay mosaics of size O(n). This encourages the use of chromatic Delaunay mosaics in applications."}],"department":[{"_id":"HeEd"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"15090"}]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"title":"On the size of chromatic Delaunay mosaics","date_published":"2026-01-01T00:00:00Z","doi":"10.1007/s00454-025-00778-7","oa_version":"Published Version","PlanS_conform":"1","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public"},{"project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413","call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program"}],"ddc":["510"],"intvolume":" 25","volume":25,"article_processing_charge":"No","ec_funded":1,"publisher":"Society for Industrial & Applied Mathematics","type":"journal_article","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","date_created":"2026-01-12T11:17:06Z","citation":{"ama":"Dey TK, Haas A, Lipiński M. Computing a connection matrix and persistence efficiently from a morse decomposition. SIAM Journal on Applied Dynamical Systems. 2026;25(1):108-130. doi:10.1137/25m1739406","short":"T.K. Dey, A. Haas, M. Lipiński, SIAM Journal on Applied Dynamical Systems 25 (2026) 108–130.","ieee":"T. K. Dey, A. Haas, and M. Lipiński, “Computing a connection matrix and persistence efficiently from a morse decomposition,” SIAM Journal on Applied Dynamical Systems, vol. 25, no. 1. Society for Industrial & Applied Mathematics, pp. 108–130, 2026.","apa":"Dey, T. K., Haas, A., & Lipiński, M. (2026). Computing a connection matrix and persistence efficiently from a morse decomposition. SIAM Journal on Applied Dynamical Systems. Society for Industrial & Applied Mathematics. https://doi.org/10.1137/25m1739406","mla":"Dey, Tamal K., et al. “Computing a Connection Matrix and Persistence Efficiently from a Morse Decomposition.” SIAM Journal on Applied Dynamical Systems, vol. 25, no. 1, Society for Industrial & Applied Mathematics, 2026, pp. 108–30, doi:10.1137/25m1739406.","chicago":"Dey, Tamal K., Andrew Haas, and Michał Lipiński. “Computing a Connection Matrix and Persistence Efficiently from a Morse Decomposition.” SIAM Journal on Applied Dynamical Systems. Society for Industrial & Applied Mathematics, 2026. https://doi.org/10.1137/25m1739406.","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."},"arxiv":1,"language":[{"iso":"eng"}],"publication_status":"published","OA_type":"green","page":"108-130","oa":1,"external_id":{"arxiv":["2502.19369"]},"date_updated":"2026-01-20T07:40:39Z","author":[{"last_name":"Dey","full_name":"Dey, Tamal K.","first_name":"Tamal K."},{"last_name":"Haas","first_name":"Andrew","full_name":"Haas, Andrew"},{"id":"dfffb474-4317-11ee-8f5c-fe3fc95a425e","orcid":"0000-0001-9789-9750","last_name":"Lipiński","full_name":"Lipiński, Michał","first_name":"Michał"}],"article_type":"original","quality_controlled":"1","department":[{"_id":"HeEd"}],"publication":"SIAM Journal on Applied Dynamical Systems","month":"01","abstract":[{"lang":"eng","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."}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2502.19369","open_access":"1"}],"year":"2026","scopus_import":"1","OA_place":"repository","_id":"20980","title":"Computing a connection matrix and persistence efficiently from a morse decomposition","publication_identifier":{"issn":["1536-0040"]},"day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","issue":"1","oa_version":"Preprint","date_published":"2026-01-01T00:00:00Z","doi":"10.1137/25m1739406"},{"editor":[{"first_name":"Kasper","full_name":"Green Larsen, Kasper","last_name":"Green Larsen"},{"full_name":"Saha, Barna","first_name":"Barna","last_name":"Saha"}],"type":"book_chapter","publisher":"Society for Industrial and Applied Mathematics","article_processing_charge":"No","acknowledgement":"We thank the reviewers for both SODA and ATMCS for their comments, whichimproved the exposition. We thank Kate Turner for discussion and Clément Maria for pointing out thatAlexander’s theorem was already (well) known. Mathijs Wintraecken would like to express his gratitude tothe administrative support he received from University of Notre Dame during his visit and from Sophie Honnoratand Stephanie Verdonck at Inria in general.This work has been supported by the ANR grant StratMesh, ANR-24-CE48-1899, by NSF award 2444309, andthe welcome package from IDEX of the Université Côte d’Azur, ANR-15-IDEX-01.","date_created":"2026-01-28T12:58:16Z","citation":{"ista":"Chambers EW, Fillmore CD, Stephenson ER, Wintraecken M. 2026.Braiding Vineyards. In: Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms. , 6240–6263.","chicago":"Chambers, Erin W., Christopher D Fillmore, Elizabeth R Stephenson, and Mathijs Wintraecken. “Braiding Vineyards.” In Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, edited by Kasper Green Larsen and Barna Saha, 6240–63. Philadelphia, PA, United States: Society for Industrial and Applied Mathematics, 2026. https://doi.org/10.1137/1.9781611978971.225.","mla":"Chambers, Erin W., et al. “Braiding Vineyards.” Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, edited by Kasper Green Larsen and Barna Saha, Society for Industrial and Applied Mathematics, 2026, pp. 6240–63, doi:10.1137/1.9781611978971.225.","apa":"Chambers, E. W., Fillmore, C. D., Stephenson, E. R., & Wintraecken, M. (2026). Braiding Vineyards. In K. Green Larsen & B. Saha (Eds.), Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 6240–6263). Philadelphia, PA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611978971.225","ieee":"E. W. Chambers, C. D. Fillmore, E. R. Stephenson, and M. Wintraecken, “Braiding Vineyards,” in Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, K. Green Larsen and B. Saha, Eds. Philadelphia, PA, United States: Society for Industrial and Applied Mathematics, 2026, pp. 6240–6263.","short":"E.W. Chambers, C.D. Fillmore, E.R. Stephenson, M. Wintraecken, in:, K. Green Larsen, B. Saha (Eds.), Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, United States, 2026, pp. 6240–6263.","ama":"Chambers EW, Fillmore CD, Stephenson ER, Wintraecken M. Braiding Vineyards. In: Green Larsen K, Saha B, eds. Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA, United States: Society for Industrial and Applied Mathematics; 2026:6240-6263. doi:10.1137/1.9781611978971.225"},"arxiv":1,"language":[{"iso":"eng"}],"publication_status":"published","OA_type":"green","page":"6240-6263","oa":1,"external_id":{"arxiv":["2504.11203"]},"date_updated":"2026-02-16T08:06:23Z","author":[{"last_name":"Chambers","full_name":"Chambers, Erin W.","first_name":"Erin W."},{"id":"35638A5C-AAC7-11E9-B0BF-5503E6697425","last_name":"Fillmore","first_name":"Christopher D","full_name":"Fillmore, Christopher D"},{"first_name":"Elizabeth R","full_name":"Stephenson, Elizabeth R","last_name":"Stephenson","orcid":"0000-0002-6862-208X","id":"2D04F932-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-7472-2220","first_name":"Mathijs","full_name":"Wintraecken, Mathijs","last_name":"Wintraecken","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87"}],"quality_controlled":"1","department":[{"_id":"HeEd"}],"related_material":{"record":[{"relation":"earlier_version","id":"21051","status":"public"}]},"month":"01","publication":"Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms","abstract":[{"lang":"eng","text":"In this work, we introduce and study what we believe is an intriguing, and, to the best of our knowledge, previously unknown connection between two fundamental areas in computational topology, namely topological data analysis (TDA) and knot theory. Given a function from a topological space to ℝ, TDA provides tools to simplify and study the importance of topological features: in particular, the 𝑙^𝑡ℎ-dimensional persistence diagram encodes the topological changes (or 𝑙-homology) in the sublevel set as the function value increases into a set of points in the plane. Given a continuous one parameter family of such functions, we can combine the persistence diagrams into an object known as a vineyard, which tracks the evolution of points in the persistence diagram as the function changes. If we further restrict that family of functions to be periodic, we identify the two ends of the vineyard, yielding a closed vineyard. This allows the study of monodromy, which in this context means that following the family of functions for a period permutes the set of points in a non-trivial way. Recent work has studied monodromy in the directional persistent homology transform, demonstrating some interesting connections between an input shape and monodromy in the persistent homology transform for 0-dimensional homology embedded in ℝ^2.\r\nIn this work, given a link and a value 𝑙, we construct a topological space (based on the given link) and periodic family of functions on this space (based on the Euclidean distance function), such that the closed 𝑙-vineyard contains this link. This shows that vineyards are topologically as rich as one could possibly hope, suggesting many future directions of work. Importantly, it has at least two immediate consequences we explicitly point out:\r\n1.\tMonodromy of any periodicity can occur in a 𝑙-vineyard for any 𝑙. This answers a variant of a question by Arya and collaborators. To exhibit this as a consequence of our first main result we also reformulate monodromy in a more geometric way, which may be of interest in itself.\r\n2.\tTopologically distinguishing closed vineyards is likely to be difficult (from a complexity theory as well as from a practical perspective) because of the difficulty of knot and link recognition, which have strong connections to many NP-hard problems."}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2504.11203"}],"year":"2026","OA_place":"repository","_id":"21056","title":"Braiding Vineyards","publication_identifier":{"eisbn":["9781611978971"]},"place":"Philadelphia, PA, United States","day":"07","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","oa_version":"Preprint","date_published":"2026-01-07T00:00:00Z","doi":"10.1137/1.9781611978971.225"},{"oa_version":"Preprint","doi":"10.1007/978-3-032-17801-5_39","date_published":"2026-02-13T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","day":"13","title":"Edge-constrained Hamiltonian paths on a point set","publication_identifier":{"isbn":["9783032178008"],"issn":["0302-9743"],"eissn":["1611-3349"]},"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2511.22526"}],"year":"2026","_id":"21374","OA_place":"repository","department":[{"_id":"HeEd"}],"abstract":[{"text":"Let . S be a set of distinct points in general position in the\r\nEuclidean plane. A plane Hamiltonian path on . S is a crossing-free geometric path such that every point of .S is a vertex of the path. It is\r\nknown that, if. S is sufficiently large, there exist three edge-disjoint plane\r\nHamiltonian paths on . S. In this paper we study an edge-constrained\r\nversion of the problem of finding Hamiltonian paths on a point set. We\r\nfirst consider the problem of finding a single plane Hamiltonian path . π\r\nwith endpoints .s, t ∈ S and constraints given by a segment . ab, where\r\n.a, b ∈ S. We consider the following scenarios: (i) .ab ∈ π; (ii) .ab π. We\r\ncharacterize those quintuples . S, a, b, s, t for which . π exists. Secondly,\r\nwe consider the problem of finding two plane Hamiltonian paths . π1, π2\r\non a set . S with constraints given by a segment . ab, where .a, b ∈ S. We\r\nconsider the following scenarios: (i) .π1 and .π2 share no edges and .ab is\r\nan edge of . π1; (ii) .π1 and .π2 share no edges and none of them includes\r\n.ab as an edge; (iii) both .π1 and .π2 include .ab as an edge and share no\r\nother edges. In all cases, we characterize those triples . S, a, b for which\r\n.π1 and .π2 exist.","lang":"eng"}],"publication":"51st International Conference on Current Trends in Theory and Practice of Computer Science","month":"02","date_updated":"2026-03-02T08:49:20Z","quality_controlled":"1","author":[{"last_name":"Antić","full_name":"Antić, Todor","first_name":"Todor"},{"last_name":"Džuklevski","full_name":"Džuklevski, Aleksa","first_name":"Aleksa"},{"last_name":"Fiala","first_name":"Jiří","full_name":"Fiala, Jiří"},{"first_name":"Jan","full_name":"Kratochvíl, Jan","last_name":"Kratochvíl"},{"last_name":"Liotta","full_name":"Liotta, Giuseppe","first_name":"Giuseppe"},{"first_name":"Morteza","full_name":"Saghafian, Morteza","last_name":"Saghafian","id":"f86f7148-b140-11ec-9577-95435b8df824"},{"first_name":"Maria","full_name":"Saumell, Maria","last_name":"Saumell"},{"full_name":"Zink, Johannes","first_name":"Johannes","last_name":"Zink"}],"oa":1,"external_id":{"arxiv":["2511.22526"]},"conference":{"end_date":"2026-02-13","location":"Krakow, Poland","start_date":"2026-02-09","name":"SOFSEM: Conference on Current Trends in Theory and Practice of Computer Science"},"alternative_title":["LNCS"],"page":"532-546","OA_type":"green","language":[{"iso":"eng"}],"publication_status":"published","citation":{"ieee":"T. Antić et al., “Edge-constrained Hamiltonian paths on a point set,” in 51st International Conference on Current Trends in Theory and Practice of Computer Science, Krakow, Poland, 2026, vol. 16448, pp. 532–546.","short":"T. Antić, A. Džuklevski, J. Fiala, J. Kratochvíl, G. Liotta, M. Saghafian, M. Saumell, J. Zink, in:, 51st International Conference on Current Trends in Theory and Practice of Computer Science, Springer Nature, 2026, pp. 532–546.","ama":"Antić T, Džuklevski A, Fiala J, et al. Edge-constrained Hamiltonian paths on a point set. In: 51st International Conference on Current Trends in Theory and Practice of Computer Science. Vol 16448. Springer Nature; 2026:532-546. doi:10.1007/978-3-032-17801-5_39","ista":"Antić T, Džuklevski A, Fiala J, Kratochvíl J, Liotta G, Saghafian M, Saumell M, Zink J. 2026. Edge-constrained Hamiltonian paths on a point set. 51st International Conference on Current Trends in Theory and Practice of Computer Science. SOFSEM: Conference on Current Trends in Theory and Practice of Computer Science, LNCS, vol. 16448, 532–546.","chicago":"Antić, Todor, Aleksa Džuklevski, Jiří Fiala, Jan Kratochvíl, Giuseppe Liotta, Morteza Saghafian, Maria Saumell, and Johannes Zink. “Edge-Constrained Hamiltonian Paths on a Point Set.” In 51st International Conference on Current Trends in Theory and Practice of Computer Science, 16448:532–46. Springer Nature, 2026. https://doi.org/10.1007/978-3-032-17801-5_39.","mla":"Antić, Todor, et al. “Edge-Constrained Hamiltonian Paths on a Point Set.” 51st International Conference on Current Trends in Theory and Practice of Computer Science, vol. 16448, Springer Nature, 2026, pp. 532–46, doi:10.1007/978-3-032-17801-5_39.","apa":"Antić, T., Džuklevski, A., Fiala, J., Kratochvíl, J., Liotta, G., Saghafian, M., … Zink, J. (2026). Edge-constrained Hamiltonian paths on a point set. In 51st International Conference on Current Trends in Theory and Practice of Computer Science (Vol. 16448, pp. 532–546). Krakow, Poland: Springer Nature. https://doi.org/10.1007/978-3-032-17801-5_39"},"arxiv":1,"date_created":"2026-03-01T23:01:40Z","acknowledgement":"We thank the organizers of the HOMONOLO 2024 workshop in Nová Louka, Czech Republic, for the fruitful atmosphere where the research on this project was initiated.\r\n\r\nT. Antić, A. Džuklevski, J. Kratochvíl and M. Saumell received funding from GAČR grant 23–04949X, T.A and A.Dž were additionally supported by GAUK grant SVV–2025–260822. G. Liotta was supported in part by MUR of Italy, PRIN Project no. 2022TS4Y3N – EXPAND and PON Project ARS01_00540. J. Fiala was in part supported by GAČR grant 25-16847S.","type":"conference","article_processing_charge":"No","volume":16448,"publisher":"Springer Nature","intvolume":" 16448"},{"intvolume":" 10","project":[{"grant_number":"Z00342","name":"Mathematics, Computer Science","call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes","call_identifier":"FWF","grant_number":"I02979-N35"}],"ddc":["500"],"date_created":"2026-03-08T23:01:45Z","has_accepted_license":"1","acknowledgement":"The authors would like to thank Michael Lesnick and Primoz Skraba for their helpful comments regarding sparse approximations of filtrations. We are also grateful to the anonymous referees for their careful reading and constructive suggestions. The three authors are supported by the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31, by the DFG Collaborative Research Center TRR 109, Austrian Science Fund (FWF), grant no. I 02979-N35, the U.S. National Science Foundation (NSF-DMS), grant no. 2005630, and a JSPS Grant-in-Aid for Transformative Research Areas (A) (22H05107, Y.H.), EPSRC Research Grant EP/Y008642/1.","type":"journal_article","article_processing_charge":"Yes (in subscription journal)","volume":10,"publisher":"Springer Nature","publication_status":"published","language":[{"iso":"eng"}],"arxiv":1,"citation":{"apa":"Edelsbrunner, H., Kahle, M., & Kanazawa, S. (2026). Maximum persistent Betti numbers of Čech complexes. Journal of Applied and Computational Topology. Springer Nature. https://doi.org/10.1007/s41468-026-00233-3","mla":"Edelsbrunner, Herbert, et al. “Maximum Persistent Betti Numbers of Čech Complexes.” Journal of Applied and Computational Topology, vol. 10, 5, Springer Nature, 2026, doi:10.1007/s41468-026-00233-3.","chicago":"Edelsbrunner, Herbert, Matthew Kahle, and Shu Kanazawa. “Maximum Persistent Betti Numbers of Čech Complexes.” Journal of Applied and Computational Topology. Springer Nature, 2026. https://doi.org/10.1007/s41468-026-00233-3.","ista":"Edelsbrunner H, Kahle M, Kanazawa S. 2026. Maximum persistent Betti numbers of Čech complexes. Journal of Applied and Computational Topology. 10, 5.","ama":"Edelsbrunner H, Kahle M, Kanazawa S. Maximum persistent Betti numbers of Čech complexes. Journal of Applied and Computational Topology. 2026;10. doi:10.1007/s41468-026-00233-3","short":"H. Edelsbrunner, M. Kahle, S. Kanazawa, Journal of Applied and Computational Topology 10 (2026).","ieee":"H. Edelsbrunner, M. Kahle, and S. Kanazawa, “Maximum persistent Betti numbers of Čech complexes,” Journal of Applied and Computational Topology, vol. 10. Springer Nature, 2026."},"article_number":"5","external_id":{"arxiv":["2409.05241"]},"oa":1,"OA_type":"hybrid","quality_controlled":"1","article_type":"original","file":[{"file_name":"2026_JourAppliedCompTopology_Edelsbrunner.pdf","access_level":"open_access","date_updated":"2026-03-09T11:29:30Z","success":1,"checksum":"0bf6dc430cafa40c08f260fe17d54595","date_created":"2026-03-09T11:29:30Z","relation":"main_file","content_type":"application/pdf","file_id":"21416","creator":"dernst","file_size":323111}],"author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert"},{"full_name":"Kahle, Matthew","first_name":"Matthew","last_name":"Kahle"},{"last_name":"Kanazawa","full_name":"Kanazawa, Shu","first_name":"Shu"}],"date_updated":"2026-03-09T11:31:29Z","_id":"21407","OA_place":"publisher","scopus_import":"1","file_date_updated":"2026-03-09T11:29:30Z","year":"2026","abstract":[{"lang":"eng","text":"This note proves that only a linear number of holes in a Cech complex of n points in R^d\r\ncan persist over an interval of constant length. Specifically, for any fixed dimension p <\r\nd and fixed ε > 0, the number of p-dimensional holes in the ˇ Cech complex at radius 1\r\nthat persist to radius 1+ε is bounded above by a constant times n,where n is the number\r\nof points. The proof uses a packing argument supported by relating theCˇ ech complexes\r\nwith corresponding snap complexes over the cells in a partition of space. The argument\r\nis self-contained and elementary, relying on geometric and combinatorial constructions\r\nrather than on the existing theory of sparse approximations or interleavings. The bound\r\nalso applies to Alpha complexes and Vietoris–Rips complexes. While our result can be\r\ninferred from prior work on sparse filtrations, to our knowledge, no explicit statement\r\nor direct proof of this bound appears in the literature."}],"month":"03","publication":"Journal of Applied and Computational Topology","department":[{"_id":"HeEd"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication_identifier":{"issn":["2367-1726"],"eissn":["2367-1734"]},"title":"Maximum persistent Betti numbers of Čech complexes","doi":"10.1007/s41468-026-00233-3","date_published":"2026-03-01T00:00:00Z","oa_version":"Published Version","PlanS_conform":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","day":"01"},{"OA_place":"repository","_id":"21410","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2409.11079"}],"year":"2026","scopus_import":"1","publication":"20th International Conference and Workshops on Algorithms and Computation","month":"02","abstract":[{"text":"Given a finite set of red and blue points in R^d, the MST-ratio is defined as the total length of the Euclidean minimum spanning trees of the red points and the blue points, divided by the length of the Euclidean minimum spanning tree of their union. The MST-ratio has recently gained attention due to its direct interpretation in topological models for studying point sets with applications in spatial biology. The maximum MST-ratio of a point set is the maximum MST-ratio over all proper colorings of its points by red and blue. We prove that finding the maximum MST-ratio of a given point set is NP-hard when the dimension is part of the input. Moreover, we present a quadratic-time 3-approximation algorithm for this problem. As part of the proof, we show that in any metric space, the maximum MST-ratio is smaller than 3. Furthermore, we study the average MST-ratio over all colorings of a set of n points. We show that this average is always at least n-2/n-1, and for n random points uniformly distributed in a d-dimensional unit cube, the average tends to (math formular) in expectation as n approaches infinity.","lang":"eng"}],"department":[{"_id":"HeEd"}],"author":[{"last_name":"Jabal Ameli","first_name":"Afrouz","full_name":"Jabal Ameli, Afrouz"},{"full_name":"Motiei, Faezeh","first_name":"Faezeh","last_name":"Motiei"},{"last_name":"Saghafian","first_name":"Morteza","full_name":"Saghafian, Morteza","id":"f86f7148-b140-11ec-9577-95435b8df824"}],"quality_controlled":"1","date_updated":"2026-03-09T10:25:41Z","date_published":"2026-02-14T00:00:00Z","doi":"10.1007/978-981-95-7127-7_26","oa_version":"Preprint","day":"14","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"isbn":["9789819571260"],"issn":["0302-9743"],"eissn":["1611-3349"]},"title":"On the MST-ratio: Theoretical bounds and complexity of finding the maximum","date_created":"2026-03-08T23:01:45Z","type":"conference","article_processing_charge":"No","publisher":"Springer Nature","volume":16444,"ec_funded":1,"acknowledgement":"A. J. Ameli—Supported by the project COALESCE (ERC grant no. 853234).\r\nM. Saghafian—Partially supported by the European Research Council (ERC), grant no. 788183, and by the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31.","project":[{"call_identifier":"H2020","name":"Alpha Shape Theory Extended","grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"_id":"268116B8-B435-11E9-9278-68D0E5697425","name":"Mathematics, Computer Science","call_identifier":"FWF","grant_number":"Z00342"}],"intvolume":" 16444","alternative_title":["LNCS"],"conference":{"name":"WALCOM: International Conference and Workshops on Algorithms and Computation","start_date":"2026-03-04","location":"Perugia, Italy","end_date":"2026-03-06"},"external_id":{"arxiv":["2409.11079"]},"oa":1,"OA_type":"green","page":"386-401","publication_status":"published","language":[{"iso":"eng"}],"arxiv":1,"citation":{"ama":"Jabal Ameli A, Motiei F, Saghafian M. On the MST-ratio: Theoretical bounds and complexity of finding the maximum. In: 20th International Conference and Workshops on Algorithms and Computation. Vol 16444. Springer Nature; 2026:386-401. doi:10.1007/978-981-95-7127-7_26","short":"A. Jabal Ameli, F. Motiei, M. Saghafian, in:, 20th International Conference and Workshops on Algorithms and Computation, Springer Nature, 2026, pp. 386–401.","ieee":"A. Jabal Ameli, F. Motiei, and M. Saghafian, “On the MST-ratio: Theoretical bounds and complexity of finding the maximum,” in 20th International Conference and Workshops on Algorithms and Computation, Perugia, Italy, 2026, vol. 16444, pp. 386–401.","mla":"Jabal Ameli, Afrouz, et al. “On the MST-Ratio: Theoretical Bounds and Complexity of Finding the Maximum.” 20th International Conference and Workshops on Algorithms and Computation, vol. 16444, Springer Nature, 2026, pp. 386–401, doi:10.1007/978-981-95-7127-7_26.","apa":"Jabal Ameli, A., Motiei, F., & Saghafian, M. (2026). On the MST-ratio: Theoretical bounds and complexity of finding the maximum. In 20th International Conference and Workshops on Algorithms and Computation (Vol. 16444, pp. 386–401). Perugia, Italy: Springer Nature. https://doi.org/10.1007/978-981-95-7127-7_26","chicago":"Jabal Ameli, Afrouz, Faezeh Motiei, and Morteza Saghafian. “On the MST-Ratio: Theoretical Bounds and Complexity of Finding the Maximum.” In 20th International Conference and Workshops on Algorithms and Computation, 16444:386–401. Springer Nature, 2026. https://doi.org/10.1007/978-981-95-7127-7_26.","ista":"Jabal Ameli A, Motiei F, Saghafian M. 2026. On the MST-ratio: Theoretical bounds and complexity of finding the maximum. 20th International Conference and Workshops on Algorithms and Computation. WALCOM: International Conference and Workshops on Algorithms and Computation, LNCS, vol. 16444, 386–401."}},{"file_date_updated":"2026-01-30T11:40:09Z","year":"2026","OA_place":"publisher","_id":"21021","related_material":{"record":[{"status":"public","id":"20260","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"21050"},{"id":"21051","status":"public","relation":"part_of_dissertation"}]},"department":[{"_id":"GradSch"},{"_id":"HeEd"},{"_id":"UlWa"}],"abstract":[{"lang":"eng","text":"This thesis examines how geometry and topology intersect in the representation, transformation, and analysis of complex shapes. It considers how continuous manifolds relate to their discrete analogues, how topological structures evolve in persistence vineyards, and how tools from topological data analysis can illuminate problems in mathematical physics. Central to this exploration is the question of how structure, both geometric and topological, persists or changes under approximation, sampling, or deformation. The work develops new approaches to skeletal and grid-based representations of surfaces, reveals the full expressive capacity of persistence vineyards, and applies topological methods to the longstanding problem of equilibria in electrostatic fields. These threads braid together into a broader understanding of how topology and geometry inform one another across theory, computation, and application."}],"month":"01","corr_author":"1","date_updated":"2026-04-07T11:42:49Z","file":[{"checksum":"4c0889130095c31d4e5088c5b8dfd607","relation":"main_file","date_created":"2026-01-26T19:44:46Z","file_id":"21046","content_type":"application/pdf","creator":"cfillmor","file_size":55954297,"file_name":"2025_Fillmore_Christopher_Thesis.pdf","access_level":"open_access","date_updated":"2026-01-30T11:40:09Z"},{"date_updated":"2026-01-26T19:46:20Z","access_level":"closed","file_name":"Thesis.zip","content_type":"application/x-zip-compressed","creator":"cfillmor","file_id":"21047","file_size":166080788,"checksum":"d69afb71d82ab98f856886126ee7303a","relation":"source_file","date_created":"2026-01-26T19:46:20Z"}],"author":[{"last_name":"Fillmore","full_name":"Fillmore, Christopher D","first_name":"Christopher D","id":"35638A5C-AAC7-11E9-B0BF-5503E6697425"}],"oa_version":"Published Version","doi":"10.15479/AT-ISTA-21021","date_published":"2026-01-21T00:00:00Z","status":"public","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","day":"21","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"ScienComp"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"degree_awarded":"PhD","title":"Braiding geometry and topology to study shapes and data","publication_identifier":{"issn":["2663-337X"]},"has_accepted_license":"1","date_created":"2026-01-20T21:38:40Z","acknowledgement":"The research presented in this thesis was funded by the DFG Collaborative Research\r\nCenter TRR 109, ‘Discretization in Geometry and Dynamics’.\r\n","type":"dissertation","publisher":"Institute of Science and Technology Austria","article_processing_charge":"No","ddc":["514","516"],"oa":1,"alternative_title":["ISTA Thesis"],"page":"122","publication_status":"published","language":[{"iso":"eng"}],"citation":{"apa":"Fillmore, C. D. (2026). Braiding geometry and topology to study shapes and data. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21021","chicago":"Fillmore, Christopher D. “Braiding Geometry and Topology to Study Shapes and Data.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21021.","mla":"Fillmore, Christopher D. Braiding Geometry and Topology to Study Shapes and Data. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21021.","ista":"Fillmore CD. 2026. Braiding geometry and topology to study shapes and data. Institute of Science and Technology Austria.","ieee":"C. D. Fillmore, “Braiding geometry and topology to study shapes and data,” Institute of Science and Technology Austria, 2026.","ama":"Fillmore CD. Braiding geometry and topology to study shapes and data. 2026. doi:10.15479/AT-ISTA-21021","short":"C.D. Fillmore, Braiding Geometry and Topology to Study Shapes and Data, Institute of Science and Technology Austria, 2026."},"supervisor":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"orcid":"0000-0002-1494-0568","last_name":"Wagner","first_name":"Uli","full_name":"Wagner, Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"}]},{"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2504.11203","open_access":"1"}],"year":"2026","date_created":"2026-01-27T14:41:44Z","OA_place":"repository","_id":"21051","department":[{"_id":"HeEd"}],"related_material":{"record":[{"relation":"later_version","id":"21056","status":"public"},{"status":"public","id":"21021","relation":"dissertation_contains"}]},"publication":"arXiv","article_processing_charge":"No","month":"01","type":"preprint","abstract":[{"lang":"eng","text":"In this work, we introduce and study what we believe is an intriguing and, to the best of our knowledge, previously unknown connection between two areas in computational topology, topological data analysis (TDA) and knot theory. Given a function from a topological space to $\\mathbb{R}$, TDA provides tools to simplify and study the importance of topological features: in particular, the $l^{th}$-dimensional persistence diagram encodes the $l$-homology in the sublevel set as the function value increases as a set of points in the plane. Given a continuous one-parameter family of such functions, we can combine the persistence diagrams into an object known as a vineyard, which track the evolution of points in the persistence diagram. If we further restrict that family of functions to be periodic, we identify the two ends of the vineyard, yielding a closed vineyard. This allows the study of monodromy, which in this context means that following the family of functions for a period permutes the set of points in a non-trivial way. In this work, given a link and value $l$, we construct a topological space and periodic family of functions such that the closed $l$-vineyard contains this link. This shows that vineyards are topologically as rich as one could possibly hope. Importantly, it has at least two immediate consequences: First, monodromy of any periodicity can occur in a $l$-vineyard, answering a variant of a question by [Arya et al 2024]. To exhibit this, we also reformulate monodromy in a more geometric way, which may be of interest in itself. Second, distinguishing vineyards is likely to be difficult given the known difficulty of knot and link recognition, which have strong connections to many NP-hard problems."}],"corr_author":"1","date_updated":"2026-04-07T11:42:48Z","author":[{"full_name":" Chambers, Erin","first_name":"Erin","last_name":" Chambers"},{"id":"35638A5C-AAC7-11E9-B0BF-5503E6697425","last_name":"Fillmore","first_name":"Christopher D","full_name":"Fillmore, Christopher D"},{"orcid":"0000-0002-6862-208X","last_name":"Stephenson","first_name":"Elizabeth R","full_name":"Stephenson, Elizabeth R","id":"2D04F932-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-7472-2220","first_name":"Mathijs","full_name":"Wintraecken, Mathijs","last_name":"Wintraecken","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87"}],"oa":1,"external_id":{"arxiv":["2504.11203"]},"oa_version":"Preprint","date_published":"2026-01-02T00:00:00Z","doi":"10.48550/ARXIV.2504.11203","day":"02","status":"public","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication_status":"draft","language":[{"iso":"eng"}],"citation":{"ieee":"E. Chambers, C. D. Fillmore, E. R. Stephenson, and M. Wintraecken, “Braiding vineyards,” arXiv. .","short":"E. Chambers, C.D. Fillmore, E.R. Stephenson, M. Wintraecken, ArXiv (n.d.).","ama":"Chambers E, Fillmore CD, Stephenson ER, Wintraecken M. Braiding vineyards. arXiv. doi:10.48550/ARXIV.2504.11203","ista":"Chambers E, Fillmore CD, Stephenson ER, Wintraecken M. Braiding vineyards. arXiv, 10.48550/ARXIV.2504.11203.","chicago":"Chambers, Erin, Christopher D Fillmore, Elizabeth R Stephenson, and Mathijs Wintraecken. “Braiding Vineyards.” ArXiv, n.d. https://doi.org/10.48550/ARXIV.2504.11203.","apa":"Chambers, E., Fillmore, C. D., Stephenson, E. R., & Wintraecken, M. (n.d.). Braiding vineyards. arXiv. https://doi.org/10.48550/ARXIV.2504.11203","mla":"Chambers, Erin, et al. “Braiding Vineyards.” ArXiv, doi:10.48550/ARXIV.2504.11203."},"title":"Braiding vineyards","arxiv":1},{"page":"73-82","OA_type":"green","external_id":{"arxiv":["2507.10840"]},"oa":1,"arxiv":1,"citation":{"apa":"Dumitrescu, A., Pach, J., Saghafian, M., & Scott, A. (2026). Covering complete geometric graphs by monotone paths. Combinatorics and Number Theory. Mathematical Sciences Publishers. https://doi.org/10.2140/cnt.2026.15.73","mla":"Dumitrescu, Adrian, et al. “Covering Complete Geometric Graphs by Monotone Paths.” Combinatorics and Number Theory, vol. 15, no. 1, Mathematical Sciences Publishers, 2026, pp. 73–82, doi:10.2140/cnt.2026.15.73.","chicago":"Dumitrescu, Adrian, János Pach, Morteza Saghafian, and Alex Scott. “Covering Complete Geometric Graphs by Monotone Paths.” Combinatorics and Number Theory. Mathematical Sciences Publishers, 2026. https://doi.org/10.2140/cnt.2026.15.73.","ista":"Dumitrescu A, Pach J, Saghafian M, Scott A. 2026. Covering complete geometric graphs by monotone paths. Combinatorics and Number Theory. 15(1), 73–82.","ieee":"A. Dumitrescu, J. Pach, M. Saghafian, and A. Scott, “Covering complete geometric graphs by monotone paths,” Combinatorics and Number Theory, vol. 15, no. 1. Mathematical Sciences Publishers, pp. 73–82, 2026.","ama":"Dumitrescu A, Pach J, Saghafian M, Scott A. Covering complete geometric graphs by monotone paths. Combinatorics and Number Theory. 2026;15(1):73-82. doi:10.2140/cnt.2026.15.73","short":"A. Dumitrescu, J. Pach, M. Saghafian, A. Scott, Combinatorics and Number Theory 15 (2026) 73–82."},"language":[{"iso":"eng"}],"publication_status":"published","acknowledgement":"Research partially supported by ERC Advanced Grant \"GeoScape\", no. 882971 and\r\nHungarian NKFIH grant no. K-131529. Work by the third author is supported by EPSRC grant\r\nEP/X013642/1. Work by the third author is partially supported by the European Research Council (ERC), grant no. 788183, and by the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31.","volume":15,"article_processing_charge":"No","publisher":"Mathematical Sciences Publishers","type":"journal_article","ec_funded":1,"date_created":"2026-05-03T22:01:37Z","intvolume":" 15","project":[{"grant_number":"788183","name":"Alpha Shape Theory Extended","call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342","name":"Mathematics, Computer Science","call_identifier":"FWF"}],"issue":"1","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"17","doi":"10.2140/cnt.2026.15.73","date_published":"2026-04-17T00:00:00Z","oa_version":"Preprint","publication_identifier":{"issn":["2996-2196"],"eissn":["2996-220X"]},"title":"Covering complete geometric graphs by monotone paths","abstract":[{"lang":"eng","text":"Given a set A of n points (vertices) in general position in the plane, the complete geometric graph \r\nKn[A] consists of all (n2) segments (edges) between the elements of A. It is known that the edge set of every complete geometric graph on n vertices can be partitioned into O(n3∕2) crossing-free paths (or matchings). We strengthen this result under various additional assumptions on the point set. In particular, we prove that for a set A of n randomly selected points, uniformly distributed in [0,1]2, with probability tending to 1 as n→∞, the edge set of Kn[A] can be covered by O(nlogn) crossing-free paths and by O(n√logn) crossing-free matchings. On the other hand, we construct n-element point sets such that covering the edge set of Kn[A] requires a quadratic number of monotone paths."}],"month":"04","publication":"Combinatorics and Number Theory","department":[{"_id":"HeEd"}],"OA_place":"repository","_id":"21781","scopus_import":"1","year":"2026","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2507.10840"}],"article_type":"original","quality_controlled":"1","author":[{"last_name":"Dumitrescu","first_name":"Adrian","full_name":"Dumitrescu, Adrian"},{"full_name":"Pach, János","first_name":"János","last_name":"Pach"},{"full_name":"Saghafian, Morteza","first_name":"Morteza","last_name":"Saghafian","id":"f86f7148-b140-11ec-9577-95435b8df824"},{"last_name":"Scott","full_name":"Scott, Alex","first_name":"Alex"}],"date_updated":"2026-05-07T07:45:24Z"},{"OA_type":"green","article_number":"e70163","oa":1,"external_id":{"arxiv":["2501.05315"]},"arxiv":1,"citation":{"ama":"Edelsbrunner H, Fillmore CD, Oliveira G. Counting equilibria of the electrostatic potential. Proceedings of the London Mathematical Society. 2026;132(5). doi:10.1112/plms.70163","short":"H. Edelsbrunner, C.D. Fillmore, G. Oliveira, Proceedings of the London Mathematical Society 132 (2026).","ieee":"H. Edelsbrunner, C. D. Fillmore, and G. Oliveira, “Counting equilibria of the electrostatic potential,” Proceedings of the London Mathematical Society, vol. 132, no. 5. Wiley, 2026.","mla":"Edelsbrunner, Herbert, et al. “Counting Equilibria of the Electrostatic Potential.” Proceedings of the London Mathematical Society, vol. 132, no. 5, e70163, Wiley, 2026, doi:10.1112/plms.70163.","chicago":"Edelsbrunner, Herbert, Christopher D Fillmore, and Goncalo Oliveira. “Counting Equilibria of the Electrostatic Potential.” Proceedings of the London Mathematical Society. Wiley, 2026. https://doi.org/10.1112/plms.70163.","apa":"Edelsbrunner, H., Fillmore, C. D., & Oliveira, G. (2026). Counting equilibria of the electrostatic potential. Proceedings of the London Mathematical Society. Wiley. https://doi.org/10.1112/plms.70163","ista":"Edelsbrunner H, Fillmore CD, Oliveira G. 2026. Counting equilibria of the electrostatic potential. Proceedings of the London Mathematical Society. 132(5), e70163."},"language":[{"iso":"eng"}],"publication_status":"published","publisher":"Wiley","volume":132,"type":"journal_article","article_processing_charge":"No","date_created":"2026-05-31T22:02:13Z","intvolume":" 132","issue":"5","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","doi":"10.1112/plms.70163","date_published":"2026-05-01T00:00:00Z","oa_version":"Preprint","publication_identifier":{"issn":["0024-6115"],"eissn":["1460-244X"]},"title":"Counting equilibria of the electrostatic potential","abstract":[{"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.","lang":"eng"}],"publication":"Proceedings of the London Mathematical Society","month":"05","related_material":{"record":[{"status":"public","id":"21050","relation":"earlier_version"}]},"department":[{"_id":"HeEd"},{"_id":"TaHa"}],"_id":"21931","OA_place":"repository","scopus_import":"1","year":"2026","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2501.05315","open_access":"1"}],"quality_controlled":"1","article_type":"original","author":[{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"id":"35638A5C-AAC7-11E9-B0BF-5503E6697425","last_name":"Fillmore","full_name":"Fillmore, Christopher D","first_name":"Christopher D"},{"first_name":"Goncalo","full_name":"Oliveira, Goncalo","last_name":"Oliveira","id":"58abbde8-f455-11eb-a497-98c8fd71b905"}],"date_updated":"2026-06-02T09:24:18Z","corr_author":"1"},{"date_created":"2026-01-30T10:36:32Z","has_accepted_license":"1","acknowledgement":"We thank Stephan Huckemann, Katharine Turner, Benjamin Eltzner, Stephan Tillmann, Fariza Rashid, Vanessa Robins, and Lamiae Azizi for many useful discussions at various stages of this project. FR and PY gratefully acknowledge Matthias Weiss (Experimental Physics I, University of Bayreuth, Germany) for granting access to cell culture and laboratories, as well as funding consumables and the fruitful discussion that contributed to this work. For open access purposes, the author has applied a CC BY public copyright license to any author-accepted manuscript version arising from this submission.","article_processing_charge":"Yes","volume":22,"publisher":"Public Library of Science","type":"journal_article","intvolume":" 22","ddc":["000"],"article_number":"e1013890","external_id":{"pmid":["41604421"]},"oa":1,"OA_type":"gold","pmid":1,"language":[{"iso":"eng"}],"publication_status":"published","citation":{"ama":"Bokor Bleile Y, Yadav P, Koehl P, Rehfeldt F. Persistence diagrams as morphological signatures of cells: A method to measure and compare cells within a population. PLoS Computational Biology. 2026;22. doi:10.1371/journal.pcbi.1013890","short":"Y. Bokor Bleile, P. Yadav, P. Koehl, F. Rehfeldt, PLoS Computational Biology 22 (2026).","ieee":"Y. Bokor Bleile, P. Yadav, P. Koehl, and F. Rehfeldt, “Persistence diagrams as morphological signatures of cells: A method to measure and compare cells within a population,” PLoS Computational Biology, vol. 22. Public Library of Science, 2026.","mla":"Bokor Bleile, Yossi, et al. “Persistence Diagrams as Morphological Signatures of Cells: A Method to Measure and Compare Cells within a Population.” PLoS Computational Biology, vol. 22, e1013890, Public Library of Science, 2026, doi:10.1371/journal.pcbi.1013890.","chicago":"Bokor Bleile, Yossi, Pooja Yadav, Patrice Koehl, and Florian Rehfeldt. “Persistence Diagrams as Morphological Signatures of Cells: A Method to Measure and Compare Cells within a Population.” PLoS Computational Biology. Public Library of Science, 2026. https://doi.org/10.1371/journal.pcbi.1013890.","apa":"Bokor Bleile, Y., Yadav, P., Koehl, P., & Rehfeldt, F. (2026). Persistence diagrams as morphological signatures of cells: A method to measure and compare cells within a population. PLoS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1013890","ista":"Bokor Bleile Y, Yadav P, Koehl P, Rehfeldt F. 2026. Persistence diagrams as morphological signatures of cells: A method to measure and compare cells within a population. PLoS Computational Biology. 22, e1013890."},"scopus_import":"1","file_date_updated":"2026-02-10T07:13:06Z","year":"2026","_id":"21115","OA_place":"publisher","related_material":{"link":[{"url":"https://github.com/yossibokorbleile/correa","relation":"software"}]},"department":[{"_id":"HeEd"}],"abstract":[{"lang":"eng","text":"Quantifying cell morphology is central to understanding cellular regulation, fate, and heterogeneity, yet conventional image-based analyses often struggle with diverse or irregular shapes. We present a computational framework that uses topological data analysis to characterise and compare single-cell morphologies from fluorescence microscopy. Each cell is represented by its contour together with the position of its nucleus, from which we construct a filtration based on a radial distance function and derive a persistence diagram encoding the shape’s topological evolution. The similarity between two cells is quantified using the 2-Wasserstein distance between their diagrams, yielding a shape distance we call the PH distance. We apply this method to two representative experimental systems—primary human mesenchymal stem cells (hMSCs) and HeLa cells—and show that PH distances enable the detection of outliers in those systems, the identification of sub-populations, and the quantification of shape heterogeneity. We benchmark PH against three established contour-based distances (aspect ratio, Fourier descriptors, and elastic shape analysis) and show that PH offers better separation between cell types and greater robustness when clustering heterogeneous populations. Together, these results demonstrate that persistent-homology-based signatures provide a principled and sensitive approach for analysing cell morphology in settings where traditional geometric or image-based descriptors are insufficient."}],"publication":"PLoS Computational Biology","month":"01","corr_author":"1","date_updated":"2026-06-11T11:51:13Z","file":[{"date_updated":"2026-02-10T07:13:06Z","access_level":"open_access","file_name":"2026_PloSCompBio_Bleile.pdf","file_size":8908746,"content_type":"application/pdf","file_id":"21204","creator":"dernst","relation":"main_file","date_created":"2026-02-10T07:13:06Z","checksum":"3899d929ee9be0453c95524e49992d72","success":1}],"article_type":"original","quality_controlled":"1","author":[{"full_name":"Bleile, Yossi","first_name":"Yossi","last_name":"Bleile","orcid":"0000-0002-4861-9174","id":"920a7385-7995-11ef-9bfd-8c434cd8f3c2"},{"last_name":"Yadav","first_name":"Pooja","full_name":"Yadav, Pooja"},{"full_name":"Koehl, Patrice","first_name":"Patrice","last_name":"Koehl"},{"first_name":"Florian","full_name":"Rehfeldt, Florian","last_name":"Rehfeldt"}],"oa_version":"Published Version","doi":"10.1371/journal.pcbi.1013890","date_published":"2026-01-28T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","day":"28","PlanS_conform":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"title":"Persistence diagrams as morphological signatures of cells: A method to measure and compare cells within a population","DOAJ_listed":"1","publication_identifier":{"issn":["1553-7358"]}},{"date_updated":"2026-06-11T11:51:14Z","author":[{"id":"920a7385-7995-11ef-9bfd-8c434cd8f3c2","last_name":"Bleile","first_name":"Yossi","full_name":"Bleile, Yossi","orcid":"0000-0002-4861-9174"}],"quality_controlled":"1","article_type":"original","file":[{"access_level":"open_access","date_updated":"2026-02-23T10:18:52Z","file_name":"2026_LaMatematica_Bleile.pdf","creator":"dernst","content_type":"application/pdf","file_id":"21347","file_size":15051582,"success":1,"checksum":"6cae2efb47b025af22a8539c606a4e09","date_created":"2026-02-23T10:18:52Z","relation":"main_file"}],"corr_author":"1","department":[{"_id":"HeEd"}],"publication":"La Matematica","month":"02","abstract":[{"lang":"eng","text":"Abstract\r\n In this paper, we consider a simple class of stratified spaces – 2-complexes. We present an algorithm that learns the abstract structure of an embedded 2-complex from a point cloud sampled from it. We use tools and inspiration from computational geometry, algebraic topology, and topological data analysis and prove the correctness of the identified abstract structure under assumptions on the embedding."}],"year":"2026","scopus_import":"1","file_date_updated":"2026-02-23T10:18:52Z","OA_place":"publisher","_id":"21232","title":"Towards stratified space learning: 2-complexes","publication_identifier":{"issn":["2730-9657"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"day":"08","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","PlanS_conform":"1","oa_version":"Published Version","date_published":"2026-02-08T00:00:00Z","doi":"10.1007/s44007-025-00183-9","ddc":["510"],"intvolume":" 5","type":"journal_article","publisher":"Springer Nature","article_processing_charge":"Yes (via OA deal)","volume":5,"acknowledgement":"The author would like to thank Kate Turner, Chris Williams, Jonathan Spreer, Stephan Tillmann, Vanessa Robins, Vigleik Angeltveit, Martin Helmer, and James Morgan for very helpful discussions; and thanks Sara Kališnik Hintz and Paul Bendich for comments on an earlier version. Additonally, the author would like to thank both reviewers for their very insightful and helpful comments, without which the paper would be infinitely less coherent than it currently is. Open access funding provided by Institute of Science and Technology (IST Austria). The work in this paper was supported by an Australian Federal Government Grant, 2019-2022, Stratified Space Learning.","has_accepted_license":"1","date_created":"2026-02-16T10:44:44Z","citation":{"ieee":"Y. Bokor Bleile, “Towards stratified space learning: 2-complexes,” La Matematica, vol. 5. Springer Nature, 2026.","ama":"Bokor Bleile Y. Towards stratified space learning: 2-complexes. La Matematica. 2026;5. doi:10.1007/s44007-025-00183-9","short":"Y. Bokor Bleile, La Matematica 5 (2026).","apa":"Bokor Bleile, Y. (2026). Towards stratified space learning: 2-complexes. La Matematica. Springer Nature. https://doi.org/10.1007/s44007-025-00183-9","chicago":"Bokor Bleile, Yossi. “Towards Stratified Space Learning: 2-Complexes.” La Matematica. Springer Nature, 2026. https://doi.org/10.1007/s44007-025-00183-9.","mla":"Bokor Bleile, Yossi. “Towards Stratified Space Learning: 2-Complexes.” La Matematica, vol. 5, 17, Springer Nature, 2026, doi:10.1007/s44007-025-00183-9.","ista":"Bokor Bleile Y. 2026. Towards stratified space learning: 2-complexes. La Matematica. 5, 17."},"arxiv":1,"language":[{"iso":"eng"}],"publication_status":"published","OA_type":"hybrid","oa":1,"external_id":{"arxiv":["2305.02724"]},"article_number":"17"},{"department":[{"_id":"HeEd"}],"license":"https://opensource.org/licenses/MIT","type":"software","publisher":"Institute of Science and Technology Austria","month":"06","abstract":[{"text":"A Rust library for analyzing dendritic structures using quadric matrices. This project provides efficient tools for representing dendritic trees, computing quadric error metrics, and visualizing eigenvalue distributions on hexagonal plots.\r\n\r\nThis library implements quadric-based geometric analysis of dendritic structures, commonly found in neuroscience applications. Key features include:\r\n\r\nTree data structures: Hierarchical vertex and edge representations for dendritic trees\r\nQuadric matrices: Computation of quadric error metrics for edges and vertices\r\nVisualisation: Hexagonal plot generation using NormPolar transformations\r\nInteractive tools: Desktop application with plotting capabilities","lang":"eng"}],"year":"2026","date_created":"2026-06-09T19:19:13Z","has_accepted_license":"1","file_date_updated":"2026-06-15T08:14:24Z","_id":"21971","date_updated":"2026-06-15T23:00:03Z","project":[{"grant_number":"ESP 9584724","name":"Quantitative Unbiased Shape Analysis with Geometry & Topology","_id":"9106a876-16d5-11f0-9cad-bbf11c9952f9"}],"author":[{"orcid":"0000-0002-4861-9174","last_name":"Bleile","full_name":"Bleile, Yossi","first_name":"Yossi","id":"920a7385-7995-11ef-9bfd-8c434cd8f3c2"},{"last_name":"Cortinovis","full_name":"Cortinovis, Emanuele","first_name":"Emanuele"}],"file":[{"file_size":1081,"file_id":"21974","content_type":"application/octet-stream","creator":"ybleile","relation":"main_file","date_created":"2026-06-09T19:16:02Z","checksum":"48f633b6767c4b15dd6220ca2b4dc175","success":1,"date_updated":"2026-06-09T19:16:02Z","access_level":"open_access","file_name":"LICENSE"},{"file_name":"quadrix-x64.exe","access_level":"open_access","date_updated":"2026-06-09T19:16:27Z","success":1,"checksum":"de25d0b224acbde3d38f837fdd8f97d5","relation":"main_file","date_created":"2026-06-09T19:16:27Z","file_id":"21975","content_type":"application/octet-stream","creator":"ybleile","file_size":11308032},{"file_id":"21976","content_type":"application/octet-stream","creator":"ybleile","file_size":10655744,"checksum":"a7b94a7380dc178e76ebdba9f1fa45c2","date_created":"2026-06-09T19:16:28Z","relation":"main_file","success":1,"date_updated":"2026-06-09T19:16:28Z","access_level":"open_access","file_name":"quadrix-arm64.exe"},{"file_name":"Quadrix Desktop.app.zip","date_updated":"2026-06-09T19:16:27Z","access_level":"open_access","date_created":"2026-06-09T19:16:27Z","relation":"main_file","checksum":"2404aa8619a56668bd95032791ee1250","success":1,"file_size":2032,"file_id":"21977","creator":"ybleile","content_type":"application/zip"},{"file_size":12187896,"content_type":"application/octet-stream","file_id":"21978","creator":"ybleile","success":1,"relation":"main_file","date_created":"2026-06-09T19:16:40Z","checksum":"106930f81563c5c719a5f4030b5ca5ed","access_level":"open_access","date_updated":"2026-06-09T19:16:40Z","file_name":"quadrix-arm64"},{"creator":"ybleile","file_id":"21979","content_type":"application/octet-stream","file_size":20587592,"success":1,"checksum":"0e6ba129318446676f220087e7e6ff41","relation":"main_file","date_created":"2026-06-09T19:16:52Z","access_level":"open_access","date_updated":"2026-06-09T19:16:52Z","file_name":"quadrix-x64"},{"checksum":"f0b03385d17df049219465ab7403fe09","relation":"main_file","date_created":"2026-06-09T19:19:12Z","file_id":"21972","content_type":"application/gzip","creator":"pub-gitlab-bot","file_size":1914198,"file_name":"Quadrix.zip","access_level":"open_access","date_updated":"2026-06-09T19:19:12Z"},{"file_size":37557,"creator":"ybleile","file_id":"21993","content_type":"application/zip","relation":"supplementary_material","date_created":"2026-06-10T19:09:38Z","checksum":"ede0bbb24bf41ab4009cf1b6a9009671","date_updated":"2026-06-10T19:09:38Z","access_level":"open_access","file_name":"THIRD_PARTY_LICENSES.zip"},{"file_name":"README.md","date_updated":"2026-06-15T08:13:32Z","access_level":"open_access","relation":"main_file","date_created":"2026-06-15T08:13:32Z","checksum":"f3c5fcc62c88e449ab5c660244df5aef","success":1,"file_size":3839,"content_type":"text/markdown","file_id":"22009","creator":"ybleile"},{"date_updated":"2026-06-15T08:14:24Z","access_level":"open_access","file_name":"Quadrix.zip","file_size":1912923,"content_type":"application/gzip","creator":"pub-gitlab-bot","file_id":"22008","relation":"main_file","date_created":"2026-06-15T08:14:24Z","checksum":"aa74828c3165aafcdee4ddcc9ecd37ac"}],"corr_author":"1","day":"15","keyword":["quadratics","mathematics","dendrites","geometry","topology"],"status":"public","user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","oa":1,"date_published":"2026-06-15T00:00:00Z","doi":"10.15479/AT-ISTA-21971","citation":{"ieee":"Y. Bokor Bleile and E. Cortinovis, “Quadrix.” Institute of Science and Technology Austria, 2026.","ama":"Bokor Bleile Y, Cortinovis E. Quadrix. 2026. doi:10.15479/AT-ISTA-21971","short":"Y. Bokor Bleile, E. Cortinovis, (2026).","apa":"Bokor Bleile, Y., & Cortinovis, E. (2026). Quadrix. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21971","mla":"Bokor Bleile, Yossi, and Emanuele Cortinovis. Quadrix. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21971.","chicago":"Bokor Bleile, Yossi, and Emanuele Cortinovis. “Quadrix.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21971.","ista":"Bokor Bleile Y, Cortinovis E. 2026. Quadrix, Institute of Science and Technology Austria, 10.15479/AT-ISTA-21971."},"title":"Quadrix","tmp":{"legal_code_url":"https://opensource.org/licenses/MIT","short":"MIT","name":"The MIT License"}},{"citation":{"chicago":"Edelsbrunner, Herbert, Alexey Garber, and Morteza Saghafian. “Order-2 Delaunay Triangulations Optimize Angles.” Advances in Mathematics. Elsevier, 2025. https://doi.org/10.1016/j.aim.2024.110055.","mla":"Edelsbrunner, Herbert, et al. “Order-2 Delaunay Triangulations Optimize Angles.” Advances in Mathematics, vol. 461, 110055, Elsevier, 2025, doi:10.1016/j.aim.2024.110055.","apa":"Edelsbrunner, H., Garber, A., & Saghafian, M. (2025). Order-2 Delaunay triangulations optimize angles. Advances in Mathematics. Elsevier. https://doi.org/10.1016/j.aim.2024.110055","ista":"Edelsbrunner H, Garber A, Saghafian M. 2025. Order-2 Delaunay triangulations optimize angles. Advances in Mathematics. 461, 110055.","ieee":"H. Edelsbrunner, A. Garber, and M. Saghafian, “Order-2 Delaunay triangulations optimize angles,” Advances in Mathematics, vol. 461. Elsevier, 2025.","ama":"Edelsbrunner H, Garber A, Saghafian M. Order-2 Delaunay triangulations optimize angles. Advances in Mathematics. 2025;461. doi:10.1016/j.aim.2024.110055","short":"H. Edelsbrunner, A. Garber, M. Saghafian, Advances in Mathematics 461 (2025)."},"arxiv":1,"publication_status":"published","language":[{"iso":"eng"}],"OA_type":"green","external_id":{"isi":["001370682500001"],"arxiv":["2310.18238"]},"oa":1,"article_number":"110055","isi":1,"project":[{"call_identifier":"H2020","name":"Alpha Shape Theory Extended","grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z00342","call_identifier":"FWF","name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425"},{"grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes","call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"intvolume":" 461","publisher":"Elsevier","article_processing_charge":"No","ec_funded":1,"volume":461,"type":"journal_article","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.","date_created":"2024-12-08T23:01:54Z","title":"Order-2 Delaunay triangulations optimize angles","publication_identifier":{"issn":["0001-8708"],"eissn":["1090-2082"]},"day":"01","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","date_published":"2025-02-01T00:00:00Z","doi":"10.1016/j.aim.2024.110055","date_updated":"2025-04-15T07:16:53Z","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner"},{"full_name":"Garber, Alexey","first_name":"Alexey","last_name":"Garber"},{"first_name":"Morteza","full_name":"Saghafian, Morteza","last_name":"Saghafian","id":"f86f7148-b140-11ec-9577-95435b8df824"}],"article_type":"original","quality_controlled":"1","corr_author":"1","department":[{"_id":"HeEd"}],"month":"02","publication":"Advances in Mathematics","abstract":[{"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.","lang":"eng"}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2310.18238","open_access":"1"}],"year":"2025","scopus_import":"1","OA_place":"repository","_id":"18626"},{"date_updated":"2025-12-30T09:05:32Z","quality_controlled":"1","article_type":"original","author":[{"last_name":"Mahini","first_name":"Mohammad","full_name":"Mahini, Mohammad"},{"last_name":"Beigy","full_name":"Beigy, Hamid","first_name":"Hamid"},{"last_name":"Qadami","full_name":"Qadami, Salman","first_name":"Salman"},{"first_name":"Morteza","full_name":"Saghafian, Morteza","last_name":"Saghafian","id":"f86f7148-b140-11ec-9577-95435b8df824"}],"corr_author":"1","department":[{"_id":"HeEd"}],"abstract":[{"lang":"eng","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."}],"publication":"Information Sciences","month":"11","scopus_import":"1","year":"2025","_id":"19937","title":"Simplet-based signatures and approximation in simplicial complexes: Frequency, degree, and centrality","publication_identifier":{"issn":["0020-0255"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","day":"01","issue":"11","oa_version":"None","doi":"10.1016/j.ins.2025.122425","date_published":"2025-11-01T00:00:00Z","intvolume":" 719","project":[{"call_identifier":"H2020","name":"Alpha Shape Theory Extended","grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z00342","name":"Mathematics, Computer Science","call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35"}],"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.","ec_funded":1,"type":"journal_article","article_processing_charge":"No","publisher":"Elsevier","volume":719,"date_created":"2025-06-30T08:48:48Z","citation":{"ama":"Mahini M, Beigy H, Qadami S, Saghafian M. Simplet-based signatures and approximation in simplicial complexes: Frequency, degree, and centrality. Information Sciences. 2025;719(11). doi:10.1016/j.ins.2025.122425","short":"M. Mahini, H. Beigy, S. Qadami, M. Saghafian, Information Sciences 719 (2025).","ieee":"M. Mahini, H. Beigy, S. Qadami, and M. Saghafian, “Simplet-based signatures and approximation in simplicial complexes: Frequency, degree, and centrality,” Information Sciences, vol. 719, no. 11. Elsevier, 2025.","apa":"Mahini, M., Beigy, H., Qadami, S., & Saghafian, M. (2025). Simplet-based signatures and approximation in simplicial complexes: Frequency, degree, and centrality. Information Sciences. Elsevier. https://doi.org/10.1016/j.ins.2025.122425","chicago":"Mahini, Mohammad, Hamid Beigy, Salman Qadami, and Morteza Saghafian. “Simplet-Based Signatures and Approximation in Simplicial Complexes: Frequency, Degree, and Centrality.” Information Sciences. Elsevier, 2025. https://doi.org/10.1016/j.ins.2025.122425.","mla":"Mahini, Mohammad, et al. “Simplet-Based Signatures and Approximation in Simplicial Complexes: Frequency, Degree, and Centrality.” Information Sciences, vol. 719, no. 11, 122425, Elsevier, 2025, doi:10.1016/j.ins.2025.122425.","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."},"publication_status":"published","language":[{"iso":"eng"}],"OA_type":"closed access","article_number":"122425","external_id":{"isi":["001516170500002"]},"isi":1},{"has_accepted_license":"1","date_created":"2025-07-13T22:01:22Z","article_processing_charge":"Yes","volume":332,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","type":"conference","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","project":[{"_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Mathematics, Computer Science","grant_number":"Z00342"},{"name":"Persistence and stability of geometric complexes","call_identifier":"FWF","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"ddc":["510"],"intvolume":" 332","alternative_title":["LIPIcs"],"conference":{"name":"SoCG: Symposium on Computational Geometry","start_date":"2025-06-23","end_date":"2025-06-27","location":"Kanazawa, Japan"},"oa":1,"external_id":{"arxiv":["2410.21204"]},"article_number":"43","OA_type":"gold","language":[{"iso":"eng"}],"publication_status":"published","arxiv":1,"citation":{"chicago":"Edelsbrunner, Herbert, Alexey Garber, and Morteza Saghafian. “On Spheres with k Points Inside.” In 41st International Symposium on Computational Geometry, Vol. 332. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.SoCG.2025.43.","mla":"Edelsbrunner, Herbert, et al. “On Spheres with k Points Inside.” 41st International Symposium on Computational Geometry, vol. 332, 43, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.SoCG.2025.43.","apa":"Edelsbrunner, H., Garber, A., & Saghafian, M. (2025). On spheres with k points inside. In 41st International Symposium on Computational Geometry (Vol. 332). Kanazawa, Japan: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2025.43","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 41st International Symposium on Computational Geometry, Kanazawa, Japan, 2025, vol. 332.","ama":"Edelsbrunner H, Garber A, Saghafian M. On spheres with k points inside. In: 41st International Symposium on Computational Geometry. Vol 332. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:10.4230/LIPIcs.SoCG.2025.43","short":"H. Edelsbrunner, A. Garber, M. Saghafian, in:, 41st International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025."},"_id":"20005","OA_place":"publisher","year":"2025","file_date_updated":"2025-07-14T07:24:22Z","scopus_import":"1","month":"06","publication":"41st International Symposium on Computational Geometry","abstract":[{"lang":"eng","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."}],"department":[{"_id":"HeEd"}],"corr_author":"1","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert"},{"last_name":"Garber","full_name":"Garber, Alexey","first_name":"Alexey"},{"last_name":"Saghafian","first_name":"Morteza","full_name":"Saghafian, Morteza","id":"f86f7148-b140-11ec-9577-95435b8df824"}],"file":[{"success":1,"date_created":"2025-07-14T07:24:22Z","relation":"main_file","checksum":"b5313ed8575ea87913c71a6e3c7513c8","file_size":661893,"file_id":"20016","content_type":"application/pdf","creator":"dernst","file_name":"2025_LIPIcs.SoCG_Edelsbrunner.pdf","access_level":"open_access","date_updated":"2025-07-14T07:24:22Z"}],"quality_controlled":"1","date_updated":"2025-07-14T07:26:14Z","date_published":"2025-06-20T00:00:00Z","doi":"10.4230/LIPIcs.SoCG.2025.43","oa_version":"Published Version","day":"20","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication_identifier":{"eissn":["1868-8969"],"isbn":["9783959773706"]},"title":"On spheres with k points inside"},{"year":"2025","file_date_updated":"2025-07-14T08:23:38Z","scopus_import":"1","OA_place":"publisher","_id":"20006","department":[{"_id":"HeEd"}],"related_material":{"link":[{"relation":"software","url":"https://github.com/laraost/BananaPersist"}]},"month":"06","publication":"41st International Symposium on Computational Geometry","abstract":[{"lang":"eng","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."}],"corr_author":"1","date_updated":"2025-12-30T11:04:33Z","author":[{"full_name":"Ost, Lara","first_name":"Lara","last_name":"Ost"},{"orcid":"0000-0001-6249-0832","last_name":"Cultrera di Montesano","first_name":"Sebastiano","full_name":"Cultrera di Montesano, Sebastiano","id":"34D2A09C-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"file":[{"relation":"main_file","date_created":"2025-07-14T08:23:38Z","checksum":"3a4a7a707a56e0cfdf51428782dee55a","success":1,"file_size":834623,"content_type":"application/pdf","creator":"dernst","file_id":"20017","file_name":"2025_LIPIcs.SoCG_Ost.pdf","date_updated":"2025-07-14T08:23:38Z","access_level":"open_access"}],"quality_controlled":"1","oa_version":"Published Version","date_published":"2025-06-20T00:00:00Z","doi":"10.4230/LIPIcs.SoCG.2025.71","day":"20","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"title":"Banana trees for the persistence in time series experimentally","publication_identifier":{"isbn":["9783959773706"],"eissn":["1868-8969"]},"date_created":"2025-07-13T22:01:22Z","has_accepted_license":"1","type":"conference","volume":332,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","article_processing_charge":"Yes","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.","ddc":["000"],"project":[{"name":"Vienna Graduate School on Computational Optimization","grant_number":"W1260-N35","_id":"9B9290DE-BA93-11EA-9121-9846C619BF3A"},{"grant_number":"I02979-N35","call_identifier":"FWF","name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"},{"_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Mathematics, Computer Science","grant_number":"Z00342"}],"intvolume":" 332","oa":1,"external_id":{"arxiv":["2405.17920"]},"article_number":"71","alternative_title":["LIPIcs"],"conference":{"location":"Kanazawa, Japan","end_date":"2025-06-27","start_date":"2025-06-23","name":"SoCG: Symposium on Computational Geometry"},"OA_type":"gold","language":[{"iso":"eng"}],"publication_status":"published","citation":{"ieee":"L. Ost, S. Cultrera di Montesano, and H. Edelsbrunner, “Banana trees for the persistence in time series experimentally,” in 41st International Symposium on Computational Geometry, Kanazawa, Japan, 2025, vol. 332.","ama":"Ost L, Cultrera di Montesano S, Edelsbrunner H. Banana trees for the persistence in time series experimentally. In: 41st International Symposium on Computational Geometry. Vol 332. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:10.4230/LIPIcs.SoCG.2025.71","short":"L. Ost, S. Cultrera di Montesano, H. Edelsbrunner, in:, 41st International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","chicago":"Ost, Lara, Sebastiano Cultrera di Montesano, and Herbert Edelsbrunner. “Banana Trees for the Persistence in Time Series Experimentally.” In 41st International Symposium on Computational Geometry, Vol. 332. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.SoCG.2025.71.","mla":"Ost, Lara, et al. “Banana Trees for the Persistence in Time Series Experimentally.” 41st International Symposium on Computational Geometry, vol. 332, 71, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.SoCG.2025.71.","apa":"Ost, L., Cultrera di Montesano, S., & Edelsbrunner, H. (2025). Banana trees for the persistence in time series experimentally. In 41st International Symposium on Computational Geometry (Vol. 332). Kanazawa, Japan: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2025.71","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."},"arxiv":1},{"date_created":"2025-09-07T22:01:33Z","has_accepted_license":"1","publisher":"MDPI","type":"journal_article","volume":27,"article_processing_charge":"Yes","ec_funded":1,"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.","project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended","call_identifier":"H2020","grant_number":"788183"},{"_id":"268116B8-B435-11E9-9278-68D0E5697425","name":"Mathematics, Computer Science","call_identifier":"FWF","grant_number":"Z00342"},{"call_identifier":"FWF","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"ddc":["500"],"intvolume":" 27","external_id":{"pmid":["40870326"],"isi":["001557476000001"]},"oa":1,"article_number":"854","isi":1,"OA_type":"gold","publication_status":"published","pmid":1,"language":[{"iso":"eng"}],"citation":{"short":"A. Akopyan, H. Edelsbrunner, Z. Virk, H. Wagner, Entropy 27 (2025).","ama":"Akopyan A, Edelsbrunner H, Virk Z, Wagner H. Tight bounds between the Jensen–Shannon divergence and the minmax divergence. Entropy. 2025;27(8). doi:10.3390/e27080854","ieee":"A. Akopyan, H. Edelsbrunner, Z. Virk, and H. Wagner, “Tight bounds between the Jensen–Shannon divergence and the minmax divergence,” Entropy, vol. 27, no. 8. MDPI, 2025.","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.","apa":"Akopyan, A., Edelsbrunner, H., Virk, Z., & Wagner, H. (2025). Tight bounds between the Jensen–Shannon divergence and the minmax divergence. Entropy. MDPI. https://doi.org/10.3390/e27080854","mla":"Akopyan, Arseniy, et al. “Tight Bounds between the Jensen–Shannon Divergence and the Minmax Divergence.” Entropy, vol. 27, no. 8, 854, MDPI, 2025, doi:10.3390/e27080854.","chicago":"Akopyan, Arseniy, Herbert Edelsbrunner, Ziga Virk, and Hubert Wagner. “Tight Bounds between the Jensen–Shannon Divergence and the Minmax Divergence.” Entropy. MDPI, 2025. https://doi.org/10.3390/e27080854."},"year":"2025","scopus_import":"1","file_date_updated":"2025-09-08T07:55:48Z","_id":"20293","OA_place":"publisher","department":[{"_id":"HeEd"}],"publication":"Entropy","month":"08","abstract":[{"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.","lang":"eng"}],"corr_author":"1","date_updated":"2025-09-30T14:32:31Z","author":[{"id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X","last_name":"Akopyan","full_name":"Akopyan, Arseniy","first_name":"Arseniy"},{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Virk, Ziga","first_name":"Ziga","last_name":"Virk","id":"2E36B656-F248-11E8-B48F-1D18A9856A87"},{"id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Hubert","first_name":"Hubert","last_name":"Wagner"}],"quality_controlled":"1","article_type":"original","file":[{"file_id":"20309","content_type":"application/pdf","creator":"dernst","file_size":379340,"success":1,"checksum":"65c5399c4015d9c8abb8c7a96f3d7836","relation":"main_file","date_created":"2025-09-08T07:55:48Z","access_level":"open_access","date_updated":"2025-09-08T07:55:48Z","file_name":"2025_Entropy_Akopyan.pdf"}],"oa_version":"Published Version","date_published":"2025-08-01T00:00:00Z","doi":"10.3390/e27080854","day":"01","status":"public","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","PlanS_conform":"1","issue":"8","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"title":"Tight bounds between the Jensen–Shannon divergence and the minmax divergence","publication_identifier":{"eissn":["1099-4300"]},"DOAJ_listed":"1"},{"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"18981"}]},"department":[{"_id":"HeEd"}],"abstract":[{"lang":"eng","text":"We establish several results combining discrete Morse theory and microlocal sheaf theory in the setting of finite posets and simplicial complexes. Our primary tool is a computationally tractable description of the bounded derived category of sheaves on a poset with the Alexandrov topology. We prove that each bounded complex of sheaves on a finite poset admits a unique (up to isomorphism of complexes) minimal injective resolution, and we provide algorithms for computing minimal injective resolution of an injective complex, as well as several useful functors between derived categories of sheaves. For the constant sheaf on a simplicial complex, we give asymptotically tight bounds on the complexity of computing the minimal injective resolution using those algorithms. Our main result is a novel definition of the discrete microsupport of a bounded complex of sheaves on a finite poset. We detail several foundational properties of the discrete microsupport, as well as a microlocal generalization of the discrete homological Morse theorem and Morse inequalities."}],"publication":"Journal of Pure and Applied Algebra","month":"10","scopus_import":"1","file_date_updated":"2025-12-30T07:55:08Z","year":"2025","OA_place":"publisher","_id":"20323","date_updated":"2025-12-30T07:55:21Z","file":[{"success":1,"date_created":"2025-12-30T07:55:08Z","relation":"main_file","checksum":"39bcad462278c9322ef810af7db67f56","file_size":3090836,"file_id":"20886","content_type":"application/pdf","creator":"dernst","file_name":"2025_JourPureAppliedAlgebra_Brown.pdf","access_level":"open_access","date_updated":"2025-12-30T07:55:08Z"}],"article_type":"original","quality_controlled":"1","author":[{"id":"70B7FDF6-608D-11E9-9333-8535E6697425","last_name":"Brown","first_name":"Adam","full_name":"Brown, Adam"},{"id":"2B23F01E-F248-11E8-B48F-1D18A9856A87","last_name":"Draganov","first_name":"Ondrej","full_name":"Draganov, Ondrej","orcid":"0000-0003-0464-3823"}],"corr_author":"1","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","issue":"10","PlanS_conform":"1","oa_version":"Published Version","doi":"10.1016/j.jpaa.2025.108068","date_published":"2025-10-01T00:00:00Z","title":"Discrete microlocal Morse theory","publication_identifier":{"issn":["0022-4049"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"acknowledgement":"This 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. Z342-N31, and from the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), grant no. I 02979-N35","type":"journal_article","article_processing_charge":"Yes (via OA deal)","ec_funded":1,"publisher":"Elsevier","volume":229,"has_accepted_license":"1","date_created":"2025-09-10T05:40:09Z","intvolume":" 229","ddc":["510"],"project":[{"name":"Alpha Shape Theory Extended","call_identifier":"H2020","grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Mathematics, Computer Science","grant_number":"Z00342"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes","call_identifier":"FWF","grant_number":"I02979-N35"}],"OA_type":"hybrid","article_number":"108068","oa":1,"external_id":{"arxiv":["2209.14993"]},"citation":{"short":"A. Brown, O. Draganov, Journal of Pure and Applied Algebra 229 (2025).","ama":"Brown A, Draganov O. Discrete microlocal Morse theory. Journal of Pure and Applied Algebra. 2025;229(10). doi:10.1016/j.jpaa.2025.108068","ieee":"A. Brown and O. Draganov, “Discrete microlocal Morse theory,” Journal of Pure and Applied Algebra, vol. 229, no. 10. Elsevier, 2025.","ista":"Brown A, Draganov O. 2025. Discrete microlocal Morse theory. Journal of Pure and Applied Algebra. 229(10), 108068.","apa":"Brown, A., & Draganov, O. (2025). Discrete microlocal Morse theory. Journal of Pure and Applied Algebra. Elsevier. https://doi.org/10.1016/j.jpaa.2025.108068","chicago":"Brown, Adam, and Ondrej Draganov. “Discrete Microlocal Morse Theory.” Journal of Pure and Applied Algebra. Elsevier, 2025. https://doi.org/10.1016/j.jpaa.2025.108068.","mla":"Brown, Adam, and Ondrej Draganov. “Discrete Microlocal Morse Theory.” Journal of Pure and Applied Algebra, vol. 229, no. 10, 108068, Elsevier, 2025, doi:10.1016/j.jpaa.2025.108068."},"arxiv":1,"publication_status":"published","language":[{"iso":"eng"}]},{"oa_version":"Preprint","doi":"10.1016/j.ejc.2025.104248","date_published":"2025-10-10T00:00:00Z","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"10","title":"Flips in two-dimensional hypertriangulations","publication_identifier":{"issn":["0195-6698"]},"scopus_import":"1","year":"2025","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2212.11380","open_access":"1"}],"OA_place":"repository","_id":"20490","department":[{"_id":"HeEd"}],"abstract":[{"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","lang":"eng"}],"month":"10","publication":"European Journal of Combinatorics","corr_author":"1","date_updated":"2025-12-01T12:57:29Z","article_type":"original","quality_controlled":"1","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner"},{"full_name":"Garber, Alexey","first_name":"Alexey","last_name":"Garber"},{"last_name":"Ghafari","full_name":"Ghafari, Mohadese","first_name":"Mohadese"},{"orcid":"0000-0002-1780-2689","full_name":"Heiss, Teresa","first_name":"Teresa","last_name":"Heiss","id":"4879BB4E-F248-11E8-B48F-1D18A9856A87"},{"id":"f86f7148-b140-11ec-9577-95435b8df824","full_name":"Saghafian, Morteza","first_name":"Morteza","last_name":"Saghafian"}],"article_number":"104248","oa":1,"external_id":{"isi":["001599061500002"],"arxiv":["2212.11380"]},"isi":1,"OA_type":"green","publication_status":"epub_ahead","language":[{"iso":"eng"}],"citation":{"short":"H. Edelsbrunner, A. Garber, M. Ghafari, T. Heiss, M. Saghafian, European Journal of Combinatorics 132 (2025).","ama":"Edelsbrunner H, Garber A, Ghafari M, Heiss T, Saghafian M. Flips in two-dimensional hypertriangulations. European Journal of Combinatorics. 2025;132. doi:10.1016/j.ejc.2025.104248","ieee":"H. Edelsbrunner, A. Garber, M. Ghafari, T. Heiss, and M. Saghafian, “Flips in two-dimensional hypertriangulations,” European Journal of Combinatorics, vol. 132. Elsevier, 2025.","ista":"Edelsbrunner H, Garber A, Ghafari M, Heiss T, Saghafian M. 2025. Flips in two-dimensional hypertriangulations. European Journal of Combinatorics. 132, 104248.","mla":"Edelsbrunner, Herbert, et al. “Flips in Two-Dimensional Hypertriangulations.” European Journal of Combinatorics, vol. 132, 104248, Elsevier, 2025, doi:10.1016/j.ejc.2025.104248.","chicago":"Edelsbrunner, Herbert, Alexey Garber, Mohadese Ghafari, Teresa Heiss, and Morteza Saghafian. “Flips in Two-Dimensional Hypertriangulations.” European Journal of Combinatorics. Elsevier, 2025. https://doi.org/10.1016/j.ejc.2025.104248.","apa":"Edelsbrunner, H., Garber, A., Ghafari, M., Heiss, T., & Saghafian, M. (2025). Flips in two-dimensional hypertriangulations. European Journal of Combinatorics. Elsevier. https://doi.org/10.1016/j.ejc.2025.104248"},"arxiv":1,"date_created":"2025-10-19T22:01:31Z","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.","article_processing_charge":"No","volume":132,"type":"journal_article","publisher":"Elsevier","ec_funded":1,"intvolume":" 132","project":[{"grant_number":"788183","call_identifier":"H2020","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z00342","call_identifier":"FWF","name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35","call_identifier":"FWF","name":"Persistence and stability of geometric complexes"}]}]