pith. sign in

arxiv: 2504.17105 · v3 · submitted 2025-04-23 · 🧮 math.DS · math.AT

Conley-Morse persistence barcode: a homological signature of combinatorial bifurcations

Tamal K. Dey , Micha{\l} Lipi\'nski , Manuel Soriano-Trigueros This is my paper

Pith reviewed 2026-05-22 17:30 UTC · model grok-4.3

classification 🧮 math.DS math.AT
keywords Conley-Morse persistence barcodecombinatorial bifurcationsConley indexMorse decompositionspersistence modulegentle algebraszigzag persistencedynamical systems
0
0 comments X

The pith

A persistence barcode from Conley indices tracks combinatorial bifurcations in dynamical systems.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper introduces the Conley-Morse persistence barcode to record qualitative changes that occur in a dynamical system as parameters vary. It builds the barcode from the Conley index of invariant sets arranged over a poset that represents the bifurcation structure. The authors show that the resulting persistence module decomposes into simple interval bars when gentle algebras are used, which then lets them adapt the zigzag persistence algorithm for computation. A reader would care if the approach turns the study of how Morse decompositions reorganize into a compact, trackable algebraic object that also labels the type of transition.

Core claim

The paper establishes that the persistence module obtained from the Conley index of invariant sets indexed over a poset decomposes into simple intervals via gentle algebras. This decomposition supports the definition of the Conley-Morse persistence barcode and permits its computation through an adaptation of the zigzag persistence algorithm, yielding a homological signature that characterizes the nature of combinatorial bifurcations.

What carries the argument

The Conley-Morse persistence barcode, formed by decomposing a poset-indexed persistence module of Conley indices into interval bars through the structure of gentle algebras.

If this is right

  • Structural changes in Morse decompositions become visible as algebraic bars when parameters vary.
  • Observed transitions receive a characterization based on the Conley index of the invariant sets involved.
  • The barcode supplies a compact algebraic descriptor for the overall bifurcation diagram.
  • Computation of the signature becomes possible by adapting the existing zigzag persistence algorithm.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same construction could be tested on discretized models of well-known continuous systems to see whether the bars align with classically known bifurcation points.
  • Links may appear to other parameter-sweep techniques in topological data analysis that also produce barcodes from homological data.
  • If the poset can be refined or coarsened, the barcode might serve as a tool for comparing bifurcation diagrams across different levels of combinatorial approximation.

Load-bearing premise

The persistence module built from Conley indices of invariant sets over a poset decomposes into simple intervals when gentle algebras are applied.

What would settle it

A concrete combinatorial dynamical system whose poset-indexed Conley-index module fails to decompose into interval bars under gentle algebras, or an instance where the adapted zigzag algorithm produces bars that do not match the expected decomposition.

Figures

Figures reproduced from arXiv: 2504.17105 by Manuel Soriano-Trigueros, Micha{\l} Lipi\'nski, Tamal K. Dey.

Figure 1
Figure 1. Figure 1: The gray region is an isolating block for the saddle point in the center and the orange segments represent its exit part [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: A parameterized flow on a 2-sphere [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Conley-Morse persistence barcode corresponding to the pa￾rameterized vector field in [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: shows a combinatorial model of the example in [PITH_FULL_IMAGE:figures/full_fig_p007_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Let N1 be the union of N0 and the light brown disc in the right panel. In particular, we have N0 ⊂ N1 ⊂ N2. As discussed earlier, R in λ = 0 continues to the invariant disc at λ = 1—that is, the union of E, O and the trajectories connecting them—because both sets are isolated by a common isolating block N2. With N1 and N0 we can decompose the Conley index of R as follows. First, observe that BE := cl(N1 \N… view at source ↗
Figure 6
Figure 6. Figure 6: Combinatorial analogue of a Hopf bifurcation. The left panel represents the top view of the octahedron in [PITH_FULL_IMAGE:figures/full_fig_p009_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Two 1-dimensional flows parameterized by λ. The bottom row presents the corresponding Conley-Morse persistence barcodes [PITH_FULL_IMAGE:figures/full_fig_p010_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Minimalist combinatorial models for the parameterized 1- dimensional flows in [PITH_FULL_IMAGE:figures/full_fig_p010_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: Example of a multivector field on a simplicial complex. 4. Combinatorial Multivector Fields Theory In this section we cover the theory of combinatorial multivector fields. Most of the definitions comes from [29, 15]. We reformulate some of the concepts and introduce new ones to fit our specific needs. 4.1. Elementary notions. Let X be a finite topological space; in particular X can be a simplicial or a reg… view at source ↗
Figure 10
Figure 10. Figure 10: Examples of isolating blocks (brown sets) and isolated in￾variant sets (green sets) for a multivector field V from [PITH_FULL_IMAGE:figures/full_fig_p014_10.png] view at source ↗
Figure 11
Figure 11. Figure 11: Example of the finest block partition (brown sets in the left panel) and the corresponding finest Morse decomposition (green sets in the right panel) for a multivector field V from [PITH_FULL_IMAGE:figures/full_fig_p017_11.png] view at source ↗
Figure 12
Figure 12. Figure 12: A sequence of index pairs between (P, E) and (P ′ , E′ ) in￾ducing isomorphisms in homology constructed from two (4.4) sequences. 4.4. Combinatorial continuation. Let V and V ′ be two multivector fields for X. Whenever V ⊑ V′ we say that V is a refinement of V ′ , and symmet￾rically, V ′ is a coarsening of V. We denote the collection of all possible multivector fields on X by MVF(X). Pair (MVF(X), ⊑) form… view at source ↗
Figure 13
Figure 13. Figure 13: The poset of (MVF(X), ⊑) for simplicial complex X. its refinements; we denote it opn⊑ V. An example of the MVF(X) is presented in [PITH_FULL_IMAGE:figures/full_fig_p020_13.png] view at source ↗
Figure 14
Figure 14. Figure 14: From top to bottom, multivector fields V0, V1, and V2 on a simplicial complex K. In particular, V0 ⊒ V1 ⊑ V2 ⊑ V3 ⊑ V4. Proposition 5.2. Let B and B ′ be the finest block partitions for V and V ′ , respectively. If V ∈ opn⊑ V ′ then B ⊑ B′ . Proof. Note that GV ⊂ GV ′, that is, whenever (x, y) is an edge in GV then it is in GV ′ as well. Therefore, the assertion follows directly from Theorem 4.12. □ Examp… view at source ↗
Figure 15
Figure 15. Figure 15: The central column shows the finest block partitions for multivector fields in [PITH_FULL_IMAGE:figures/full_fig_p023_15.png] view at source ↗
Figure 16
Figure 16. Figure 16: Flow induced partial orders corresponding to block decom￾positions in Example 5.3 [PITH_FULL_IMAGE:figures/full_fig_p023_16.png] view at source ↗
Figure 17
Figure 17. Figure 17: Indexing maps ←−ι0, −→ι1, ←−ι2, and ←−ι3 for the zigzag filtration of block decompositions B from [PITH_FULL_IMAGE:figures/full_fig_p024_17.png] view at source ↗
Figure 18
Figure 18. Figure 18: The AR-split diagrams for a basic triple N0 ⊂ N1 ⊂ N2. It is easy to notice that a basic triple forms the long exact sequence, as shown below, from which we can relate Conley indices of sets involved in the AR￾decomposition, that is M, Ma and Mr. . . . i d ∗ −→ Hd(N2, N0) j d ∗ −→ Hd(N2, N1) ∂ d ∗ −→ Hd−1(N1, N0) i d−1 ∗−→ . . . (5.2) Theorem 5.12 (The AR-split). Consider a basic triple N0 ⊂ N1 ⊂ N2 and t… view at source ↗
Figure 19
Figure 19. Figure 19: Transition diagram for the first four steps of the zigzag filtration B from Example 5.3 (see also [PITH_FULL_IMAGE:figures/full_fig_p030_19.png] view at source ↗
Figure 20
Figure 20. Figure 20: Splitting cascade for the step B3 ⊒ B4 of zigzag filtration B from Example 5.3 [PITH_FULL_IMAGE:figures/full_fig_p032_20.png] view at source ↗
Figure 21
Figure 21. Figure 21: Transition diagram for the splitting cascade from Exam￾ple 5.19 (see also [PITH_FULL_IMAGE:figures/full_fig_p032_21.png] view at source ↗
Figure 22
Figure 22. Figure 22: A transition diagram for the zigzag filtration B from Ex￾ample 5.3 with concrete simplicial complexes representing index pairs. (b) Let q ∈ P1, Q := −→ι −1 (q) and p := max Q. Then Bq,1 ⊂ Np \ Np−|Q| . Proof. By definition, Bp,0 ⊂ pfV0 (Bp,0, X) ⊂ Np. Suppose that there exists an x ∈ Bp,0∩Np−1. Since x ∈ Np−1 we have two cases corresponding to formula (5.3); in the first one, there exists a p ′ ∈ P such t… view at source ↗
Figure 23
Figure 23. Figure 23: Every node in the Hasse diagram of P can have at most one arrow coming from, and another going to, a previous column; and one arrow coming from, and another going to, a later column. Proposition 7.3. Consider poset P induced by TD, and the quiver Q formed by the Hasse diagram of P. Consider the ideal I generated by all 2-element paths βα forming AR-splits in TD (that is corresponding to j∗ ◦ i∗ in [PITH_… view at source ↗
Figure 24
Figure 24. Figure 24: The Conley-Morse persistence module obtained from dia￾gram in [PITH_FULL_IMAGE:figures/full_fig_p042_24.png] view at source ↗
Figure 25
Figure 25. Figure 25: Choice of zigzag filtration (colored green): when the al￾gorithm processes the point d, it chooses the zigzag filtration indicated green. While going backward, the path supporting the filtration faces a choice at a between the points b and c where it chooses the point c. Case 2: Point ait has a single immediate point aℓ(t+1) at time t + 1 where the matrices have already been computed while proceeding from… view at source ↗
Figure 26
Figure 26. Figure 26: A minimalist combinatorial model for a pitchfork bifurca￾tion [PITH_FULL_IMAGE:figures/full_fig_p051_26.png] view at source ↗
Figure 27
Figure 27. Figure 27: Two possible transition diagrams for the example in Fig￾ure 26 [PITH_FULL_IMAGE:figures/full_fig_p051_27.png] view at source ↗
Figure 28
Figure 28. Figure 28: Pitchfork bifurcation (left) and a perturbation of the pitch￾fork bifurcation. Acknowledgment M.L. acknowledges that this project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lo￾dowska-Curie Grant Agreement No. 101034413. T.D. acknowledges the support of NSF funds CCF-2437030 and DMS-2301360. References [1] P.S. Alexandrov, Diskrete r¨aum… view at source ↗
read the original abstract

Bifurcation characterizes the qualitative changes in parameterized dynamical systems and is one of the major topics in the field. In this work, we study combinatorial bifurcations within the framework of combinatorial dynamical systems -- a young but already well-established theory. We introduce the Conley-Morse persistence barcode, a compact algebraic descriptor of combinatorial bifurcations. This barcode captures structural changes in a dynamical system at the level of Morse decompositions and provides a characterization of the nature of observed transitions in terms of the Conley index. The construction of Conley-Morse persistence barcode builds upon ideas from topological persistence. Specifically, we consider a persistence module obtained from the Conley index of invariant sets indexed over a poset. Using gentle algebras, we prove that this module decomposes into simple intervals (bars) and compute them by adapting the zigzag persistence algorithm to our purpose.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 3 minor

Summary. The manuscript introduces the Conley-Morse persistence barcode as a compact algebraic descriptor of combinatorial bifurcations. It constructs a persistence module from the Conley index of invariant sets indexed over a poset, proves that this module decomposes into simple interval modules (bars) via the representation theory of gentle algebras, and computes the barcode by adapting the zigzag persistence algorithm to string modules arising from combinatorial dynamical systems, thereby characterizing the nature of transitions in Morse decompositions in terms of Conley indices.

Significance. If the central claims hold, the work supplies a homological signature that links Conley-Morse theory with persistence methods, yielding a parameter-free algebraic tool for detecting and classifying combinatorial bifurcations. Strengths include the explicit use of gentle-algebra classification for the decomposition (avoiding ad-hoc fitting) and the direct algorithmic adaptation in §4, which supports reproducibility and potential computational implementation for parameterized dynamical systems.

major comments (1)
  1. [§3.2] §3.2 and Definition 3.4: the decomposition into interval modules is asserted to follow from the classification of representations of gentle algebras; while internally consistent, the manuscript would benefit from a one-paragraph recall of the precise classification theorem (including the role of string and band modules) to make the step self-contained rather than relying solely on external references.
minor comments (3)
  1. The introduction would be strengthened by citing one or two foundational references for combinatorial dynamical systems and the Conley index in the combinatorial setting.
  2. [§4] Notation for the poset-indexed Conley index and the resulting persistence module could be illustrated with a small concrete example (e.g., a two-element poset) to clarify the string-module structure before the general algorithm.
  3. Figure captions and axis labels in any diagrams of barcodes or Morse decompositions should explicitly indicate the poset ordering and the Conley index grading.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the positive assessment of our work and the constructive suggestion for improving the exposition. We address the single major comment below.

read point-by-point responses

  1. Referee: [§3.2] §3.2 and Definition 3.4: the decomposition into interval modules is asserted to follow from the classification of representations of gentle algebras; while internally consistent, the manuscript would benefit from a one-paragraph recall of the precise classification theorem (including the role of string and band modules) to make the step self-contained rather than relying solely on external references.

    Authors: We agree that a concise recall of the classification theorem would enhance self-containment. In the revised manuscript we will insert a one-paragraph summary of the relevant results on representations of gentle algebras, explicitly noting the roles of string modules and band modules and indicating how the absence of band modules in our setting yields the decomposition into interval modules. This addition will clarify the transition from the poset-indexed Conley index to the persistence barcode without changing any proofs or results. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation relies on independent external theorems

full rationale

The paper defines the Conley-Morse persistence barcode by forming a poset-indexed persistence module from the Conley index of invariant sets, then applies the classification of representations of gentle algebras (a standard result in representation theory) to obtain a decomposition into interval modules. Computation proceeds by an explicit adaptation of the zigzag persistence algorithm to the resulting string modules. These steps invoke established results from Conley index theory, algebraic persistence, and gentle algebra representation theory without any reduction of the central claim to a self-definition, a fitted parameter renamed as prediction, or a load-bearing self-citation chain. The characterization of combinatorial bifurcations therefore follows from independent mathematical foundations rather than circular construction.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 1 invented entities

The central claim rests on standard background results in Conley index theory and persistence module decomposition; no free parameters or new invented entities beyond the barcode itself are introduced in the abstract.

axioms (2)
  • domain assumption The Conley index is a well-defined topological invariant for isolated invariant sets in combinatorial dynamical systems.
    Invoked when forming the persistence module from Conley indices of invariant sets.
  • standard math Persistence modules over posets indexed by gentle algebras decompose into direct sums of interval modules.
    Used to prove that the module decomposes into simple bars.
invented entities (1)
  • Conley-Morse persistence barcode no independent evidence
    purpose: Compact algebraic descriptor that captures structural changes in Morse decompositions during combinatorial bifurcations.
    New object defined by the paper; no independent evidence outside the construction is provided in the abstract.

pith-pipeline@v0.9.0 · 5687 in / 1244 out tokens · 35534 ms · 2026-05-22T17:30:55.199563+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

39 extracted references · 39 canonical work pages

  1. [1]

    Alexandrov, Diskrete r¨ aume, Mathematiceskii Sbornik (N.S.) 2 (1937), 501–518

    P.S. Alexandrov, Diskrete r¨ aume, Mathematiceskii Sbornik (N.S.) 2 (1937), 501–518

    work page 1937

  2. [2]

    3, 757–789

    Zin Arai, William Kalies, Hiroshi Kokubu, Konstantin Mischaikow, Hiroe Oka, and Pawel Pilarczyk, A database schema for the analysis of global dynamics of multiparameter sys- tems, SIAM Journal on Applied Dynamical Systems 8 (2009), no. 3, 757–789

    work page 2009

  3. [3]

    2, 201 – 229

    Ibrahim Assem, Thomas Br¨ ustle, Gabrielle Charbonneau-Jodoin, and Pierre-Guy Plam- ondon, Gentle algebras arising from surface triangulations , Algebra & Number Theory 4 (2010), no. 2, 201 – 229. 52 TAMAL K. DEY, MICHA L LIPI ´NSKI, MANUEL SORIANO-TRIGUEROS

    work page 2010

  4. [4]

    20, 2101–2125

    Ibrahim Assem and Dieter Happel, Generalized tilted algebras of type An, Communications in Algebra 9 (1981), no. 20, 2101–2125

    work page 1981

  5. [5]

    2, 269–290

    Ibrahim Assem and Andrzej Skowro´ nski,Iterated tilted algebras of type ˜An, Mathematische Zeitschrift 195 (1987), no. 2, 269–290

    work page 1987

  6. [6]

    11, 4581–4596

    Magnus Botnan and William Crawley-Boevey, Decomposition of persistence modules, Pro- ceedings of the American Mathematical Society 148 (2020), no. 11, 4581–4596

    work page 2020

  7. [7]

    , Chaos 22 (2012), no

    Justin Bush, Marcio Gameiro, Shaun Harker, Hiroshi Kokubu, Konstantin Mischaikow, Ippei Obayashi, and Pawe l Pilarczyk,Combinatorial-topological framework for the analysis of global dynamics. , Chaos 22 (2012), no. 4, 047508

    work page 2012

  8. [8]

    M. C. R. Butler and Claus Michael Ringel, Auslander-reiten sequences with few middle terms and applications to string algebrass , Communications in Algebra 15 (1987), 145– 179

    work page 1987

  9. [9]

    4, 367–405

    Gunnar Carlsson and Vin De Silva, Zigzag persistence , Foundations of Computational Mathematics 10 (2010), no. 4, 367–405

    work page 2010

  10. [10]

    Fr´ ed´ eric Chazal, Vin De Silva, Marc Glisse, and Steve Oudot,The structure and stability of persistence modules, SpringerBriefs in Mathematics, Springer International Publishing, 2016

    work page 2016

  11. [11]

    38, American Mathematical Society, Providence, R.I., 1978

    Charles Conley, Isolated invariant sets and the Morse index , CBMS Regional Conference Series in Mathematics, vol. 38, American Mathematical Society, Providence, R.I., 1978

    work page 1978

  12. [12]

    Tamal K. Dey, Andrew Haas, and Micha l Lipi´ nski, Computing connection matrix and persistence efficiently from a Morse decomposition , SIAM Journal on Applied Dynamical Systems (to appear), arXiv:2502.19369, (2025)

    work page arXiv 2025

  13. [13]

    Dey and Tao Hou, Fast computation of zigzag persistence, 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany, LIPIcs, vol

    Tamal K. Dey and Tao Hou, Fast computation of zigzag persistence, 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany, LIPIcs, vol. 244, Schloss Dagstuhl - Leibniz-Zentrum f¨ ur Informatik, 2022, pp. 43:1–43:15

    work page 2022

  14. [14]

    Tamal K. Dey, Mateusz Juda, Tomasz Kapela, Jacek Kubica, Micha l Lipi´ nski, and Marian Mrozek, Persistent homology of Morse decompositions in combinatorial dynamics , SIAM Journal on Applied Dynamical Systems 18 (2019), no. 1, 510–530

    work page 2019

  15. [15]

    Dey, Micha l Lipi´ nski, Marian Mrozek, and Ryan Slechta, Tracking dynamical features via continuation and persistence , 38th Symposium on Computational Geometry, 2022

    Tamal K. Dey, Micha l Lipi´ nski, Marian Mrozek, and Ryan Slechta, Tracking dynamical features via continuation and persistence , 38th Symposium on Computational Geometry, 2022

    work page 2022

  16. [16]

    Dey, Micha l Lipi´ nski, Marian Mrozek, and Ryan Slechta,Computing connection matrices via persistence-like reductions, SIAM Journal on Applied Dynamical Systems 23 (2024), no

    Tamal K. Dey, Micha l Lipi´ nski, Marian Mrozek, and Ryan Slechta,Computing connection matrices via persistence-like reductions, SIAM Journal on Applied Dynamical Systems 23 (2024), no. 1, 81–97

    work page 2024

  17. [17]

    Dey, Marian Mrozek, and Ryan Slechta, Persistence of the Conley-Morse graph in combinatorial dynamical systems , SIAM Journal on Applied Dynamical Systems 21 (2022), no

    Tamal K. Dey, Marian Mrozek, and Ryan Slechta, Persistence of the Conley-Morse graph in combinatorial dynamical systems , SIAM Journal on Applied Dynamical Systems 21 (2022), no. 2, 817–839

    work page 2022

  18. [18]

    Dey and Yusu Wang, Computational topology for data analysis , Cambridge University Press, 2022

    Tamal K. Dey and Yusu Wang, Computational topology for data analysis , Cambridge University Press, 2022

    work page 2022

  19. [19]

    Dowling, William D

    Alex K. Dowling, William D. Kalies, and Robert C.A.M. Vandervorst, Continuation sheaves in dynamics: Sheaf cohomology and bifurcation , Journal of Differential Equations 367 (2023), 124–198

    work page 2023

  20. [20]

    Engelking, General topology, Heldermann Verlag, Berlin, 1989

    R. Engelking, General topology, Heldermann Verlag, Berlin, 1989

    work page 1989

  21. [21]

    4, 629–681

    Robin Forman, Combinatorial vector fields and dynamical systems , Mathematische Zeitschrift 228 (1998), no. 4, 629–681

    work page 1998

  22. [22]

    1, 90–145

    Robin Forman, Morse theory for cell complexes , Advances in Mathematics 134 (1998), no. 1, 90–145

    work page 1998

  23. [23]

    Franzosa, The continuation theory for Morse decompositions and connection matrices, Transactions of the American Mathematical Society 310 (1988), no

    Robert D. Franzosa, The continuation theory for Morse decompositions and connection matrices, Transactions of the American Mathematical Society 310 (1988), no. 2, 781–803

    work page 1988

  24. [24]

    1, 71–103

    Peter Gabriel, Unzerlegbare darstellungen I , manuscripta mathematica 6 (1972), no. 1, 71–103. CONLEY-MORSE PERSISTENCE BARCODES 53

    work page 1972

  25. [25]

    Khasawneh,Detecting bifurcations in dynam- ical systems with crocker plots , Chaos: An Interdisciplinary Journal of Nonlinear Science 32 (2022), no

    ˙Ismail G¨ uzel, Elizabeth Munch, and Firas A. Khasawneh,Detecting bifurcations in dynam- ical systems with crocker plots , Chaos: An Interdisciplinary Journal of Nonlinear Science 32 (2022), no. 9, 093111

    work page 2022

  26. [26]

    Ruth Stella Huerfano and Mikhail Khovanov, Categorification of some level two represen- tations of quantum sln, Journal of Knot Theory and Its Ramifications 15 (2006), 695–713

    work page 2006

  27. [27]

    Henry King, Kevin Knudson, and Neˇ za Mramor Kosta,Birth and death in discrete Morse theory, Journal of Symbolic Computation 78 (2017), 41–60

    work page 2017

  28. [28]

    1, 5:1–5:33

    Micha l Lipi´ nski, Konstantin Mischaikow, and Marian Mrozek,Morse predecomposition of an invariant set , Qualitative Theory of Dynamical Systems 24 (2025), no. 1, 5:1–5:33

    work page 2025

  29. [29]

    2, 139–184

    Micha l Lipi´ nski, Jacek Kubica, Marian Mrozek, and Thomas Wanner, Conley-Morse- Forman theory for generalized combinatorial multivector fields on finite topological spaces , Journal of Applied and Computational Topology 7 (2023), no. 2, 139–184

    work page 2023

  30. [30]

    2, Elsevier Science, 2002, ISSN: 1874-575X, pp

    Konstantin Mischaikow and Marian Mrozek, The Conley index , Handbook of Dynamical Systems (Bernold Fiedler, ed.), Handbook of Dynamical Systems, vol. 2, Elsevier Science, 2002, ISSN: 1874-575X, pp. 393–460

    work page 2002

  31. [31]

    6, 1585–1633

    Marian Mrozek, Conley–Morse–Forman theory for combinatorial multivector fields on Lef- schetz complexes, Foundations of Computational Mathematics17 (2017), no. 6, 1585–1633

    work page 2017

  32. [32]

    classical dynamics : recurrence , Communications in Nonlinear Science and Numerical Simulation 108 (2022), 1–30

    Marian Mrozek, Roman Srzednicki, Justin Thorpe, and Thomas Wanner, Combinatorial vs. classical dynamics : recurrence , Communications in Nonlinear Science and Numerical Simulation 108 (2022), 1–30

    work page 2022

  33. [33]

    Marian Mrozek and Thomas Wanner, Creating semiflows on simplicial complexes from combinatorial vector fields, Journal of Differential Equations 304 (2021), 375–434

    work page 2021

  34. [34]

    Marian Mrozek and Thomas Wanner, Connection matrices in combinatorial topological dynamics, 1 ed., SpringerBriefs in Mathematics, Springer Cham, July 2025

    work page 2025

  35. [35]

    Daniel Simson and Andrzej Skowro´ nski,Elements of the representation theory of associa- tive algebras, London Mathematical Society Student Texts, Cambridge University Press, 2007

    work page 2007

  36. [36]

    Khasawneh, Using zigzag persistent homology to detect hopf bifurcations in dynamical systems , Algorithms 13 (2020), no

    Sarah Tymochko, Elizabeth Munch, and Firas A. Khasawneh, Using zigzag persistent homology to detect hopf bifurcations in dynamical systems , Algorithms 13 (2020), no. 11, 1–16

    work page 2020

  37. [37]

    4, 875–908

    Donald Woukeng, Damian Sadowski, Jakub Le´ skiewicz, Micha l Lipi´ nski, and Tomasz Kapela, Rigorous computation in dynamics based on topological methods for multivector fields, Journal of Applied and Computational Topology 8 (2024), no. 4, 875–908

    work page 2024

  38. [38]

    1, 1249–1259

    Lin Yan, Hanqi Guo, Thomas Peterka, Bei Wang, and Jiali Wang, Trophy: A topologically robust physics-informed tracking framework for tropical cyclones , IEEE Transactions on Visualization and Computer Graphics 30 (2024), no. 1, 1249–1259

    work page 2024

  39. [39]

    08, 3489–3506

    Lin Yan, Talha Bin Masood, Farhan Rasheed, Ingrid Hotz, and Bei Wang, Geometry- Aware Merge Tree Comparisons for Time-Varying Data With Interleaving Distances , IEEE Transactions on Visualization & Computer Graphics 29 (2023), no. 08, 3489–3506. 54 TAMAL K. DEY, MICHA L LIPI ´NSKI, MANUEL SORIANO-TRIGUEROS Appendix A. Notation and Symbols Category Notatio...

    work page 2023