Printable PDF
Department of Mathematics,
University of California San Diego

****************************

Center for Computational Mathematics Seminar

Tamal Dey

Purdue University

An Efficient Algorithm for Computing the Conley–Morse Barcode for Combinatorial Dynamical Systems

Abstract:

Recent advances in combinatorial dynamical systems, extending classical discrete Morse theory, have stimulated growing algorithmic interest in combinatorial vector fields. In this context, the authors of [1] recently introduced the Conley–Morse persistence barcode, a topological summary that captures the evolution of invariant sets (Conley indices) in a changing vector field through homological persistence. In this work, we present an efficient algorithm for computing this barcode. Our approach incrementally updates the matrix decomposition R=DU used in standard persistence algorithms via a collection of suitably defined atomic operations. The correctness of the algorithm follows from a new interpretation of the transition diagram introduced in [1].

[1] Conley–Morse Persistence Barcode: A Homological Signature of a Combinatorial Bifurcation, Tamal K. Dey, Michal Lipinsky, and Manuel Soriano-Trigueros, Foundations of Computational Mathematics (2026), to appear.

November 17, 2026

11:00 AM

APM 2402 and Zoom ID 961 4627 1748

****************************