2 papers
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.DS2025
Computing a Connection Matrix and Persistence Efficiently from a Morse Decomposition
Tamal K. Dey, MichaÅ LipiÅski, Andrew Haas
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…