Invariance of connection matrices under compatible functions

Let f1f_1 and f2f_2 be functions compatible with the same input vector field, and fix the orders of simplices within each Morse set. Connection-matrix invariance conjecture. The connection matrices obtained from f1f_1 and f2f_2 remain the same. This is motivated by the fact that arranging incomparable Morse sets in any order does not change the connection matrix; the source notes that no analogous statement was obtained for Conley-complex persistence.

Sources & referencesView supporting material

Primary source

Tamal K. Dey, Michał Lipiński and Andrew Haas, “Computing a Connection Matrix and Persistence Efficiently from a Morse Decomposition”, arXiv:2502.19369 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.