28 citations · 31 across the 8 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.AT2026
Computing Conley-Morse Persistence Barcode Efficiently by Updating Matrix Decompositions
Tamal K. Dey, Andrew Haas, Michał Lipiński
Recent advances in combinatorial dynamical systems that generalize the classic discrete Morse theory have prompted algorithmic studies of combinatorial vector fields. In this regar…
math.AT2026
Topological simplification guided by forbidden regions
Jakub Leśkiewicz, Bartosz Furmanek, Michał Lipiński +1
Topological simplification is the process of reducing complexity of a function while maintaining its essential features. Its goal is to find a new filter function, which reorders c…