A computational framework for connection matrix theory
From MaRDI portal
Publication:2239809
DOI10.1007/S41468-021-00073-3zbMATH Open1487.37018arXiv1810.04552OpenAlexW2896542238MaRDI QIDQ2239809FDOQ2239809
Authors: Shaun Harker, Kelly Spendlove, K. Mischaikow 
Publication date: 5 November 2021
Published in: Journal of Applied and Computational Topology (Search for Journal in Brave)
Abstract: The connection matrix is a powerful algebraic topological tool from Conley index theory that captures relationships between isolated invariant sets. Conley index theory is a topological generalization of Morse theory in which the connection matrix subsumes the role of the Morse boundary operator. Over the last few decades, the ideas of Conley have been cast into a purely computational form. In this paper we introduce a computational, categorical framework for the connection matrix theory. This contribution transforms the computational Conley theory into a computational homological theory for dynamical systems. More specifically, within this paper we have two goals: 1) We cast the connection matrix theory into appropriate categorical, homotopy-theoretic language. We identify objects of the appropriate categories which correspond to connection matrices and may be computed within the computational Conley theory paradigm by using the technique of reductions. 2) We describe an algorithm for this computation based on algebraic-discrete Morse theory.
Full work available at URL: https://arxiv.org/abs/1810.04552
Recommendations
persistent homologycomputational topologydiscrete Morse theoryConley indexcomputational dynamicsconnection matrix
Persistent homology and applications, topological data analysis (55N31) Stability of topological dynamical systems (37B25) Index theory for dynamical systems, Morse-Conley indices (37B30) Topological data analysis (62R40)
Cites Work
- Computational topology. An introduction
- Morse theory from an algebraic viewpoint
- Witten's complex and infinite dimensional Morse theory
- An algorithmic approach to chain recurrence
- Connected Simple Systems and The Conley Index of Isolated Invariant Sets
- Title not available (Why is that?)
- Dynamical systems, shape theory and the Conley index
- Differentiable dynamical systems
- Categorification of persistent homology
- Lattice structures for attractors. I
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combinatorial algebraic topology
- Leray Functor and Cohomological Conley Index for Discrete Dynamical Systems
- On the groups \(H(\Pi,n)\). I
- Discrete Morse theoretic algorithms for computing homology of complexes and maps
- Title not available (Why is that?)
- Morse theory for filtrations and efficient computation of persistent homology
- Title not available (Why is that?)
- The Connection Matrix Theory for Morse Decompositions
- A Fixed Point Approach to Homological Perturbation Theory
- Multidimensional persistence and noise
- Computing multidimensional persistence
- The Connection Matrix in Morse-Smale Flows
- Lyapunov maps, simplicial complexes and the Stone functor
- Lattice structures for attractors. II
- Index Filtrations and the Homology Index Braid for Partially Ordered Morse Decompositions
- The Continuation Theory for Morse Decompositions and Connection Matrices
- Title not available (Why is that?)
- Connecting orbits in one-parameter families of flows
- On the global dynamics of attractors for scalar delay equations
- Algebraic transition matrices in the Conley index theory
- Global Asymptotic Dynamics of Gradient-Like Bistable Equations
- Transition matrix theory
- Algebraic Morse theory and homological perturbation theory
- Simplical models for the global dynamics of attractors
- Acyclic partial matchings for multidimensional persistence: algorithm and combinatorial interpretation
- Computing multiparameter persistent homology through a discrete Morse-based approach
- Stratifying multiparameter persistent homology
- Persistence theory. From quiver representations to data analysis
- An algorithmic approach to lattices and order in dynamics
- Allowing cycles in discrete Morse theory
- COMPUTATION OF CONNECTION MATRICES USING THE SOFTWARE PACKAGE conley
Cited In (9)
- Computing Connection Matrices via Persistence-Like Reductions
- Principal components along quiver representations
- Conley's spectral sequence via the sweeping algorithm
- A simple derivation of the interactor matrix and its applications
- Title not available (Why is that?)
- COMPUTATION OF CONNECTION MATRICES USING THE SOFTWARE PACKAGE conley
- Lattice structures for attractors. III
- conley: Computing connection matrices in Maple
- Homology of configuration spaces of hard squares in a rectangle
Uses Software
This page was built for publication: A computational framework for connection matrix theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2239809)
