A computational framework for connection matrix theory
From MaRDI portal
Publication:2239809
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 5367214 (Why is no real title available?)
- scientific article; zbMATH DE number 3616736 (Why is no real title available?)
- scientific article; zbMATH DE number 1748069 (Why is no real title available?)
- scientific article; zbMATH DE number 841435 (Why is no real title available?)
- scientific article; zbMATH DE number 1390158 (Why is no real title available?)
- scientific article; zbMATH DE number 3367095 (Why is no real title available?)
- scientific article; zbMATH DE number 3102166 (Why is no real title available?)
- A Fixed Point Approach to Homological Perturbation Theory
- Acyclic partial matchings for multidimensional persistence: algorithm and combinatorial interpretation
- Algebraic Morse theory and homological perturbation theory
- Algebraic transition matrices in the Conley index theory
- Allowing cycles in discrete Morse theory
- An algorithmic approach to chain recurrence
- An algorithmic approach to lattices and order in dynamics
- COMPUTATION OF CONNECTION MATRICES USING THE SOFTWARE PACKAGE conley
- Categorification of persistent homology
- Combinatorial algebraic topology
- Computational topology. An introduction
- Computing multidimensional persistence
- Computing multiparameter persistent homology through a discrete Morse-based approach
- Connected Simple Systems and The Conley Index of Isolated Invariant Sets
- Connecting orbits in one-parameter families of flows
- Differentiable dynamical systems
- Discrete Morse theoretic algorithms for computing homology of complexes and maps
- Dynamical systems, shape theory and the Conley index
- Global Asymptotic Dynamics of Gradient-Like Bistable Equations
- Index Filtrations and the Homology Index Braid for Partially Ordered Morse Decompositions
- Lattice structures for attractors. I
- Lattice structures for attractors. II
- Leray Functor and Cohomological Conley Index for Discrete Dynamical Systems
- Lyapunov maps, simplicial complexes and the Stone functor
- Morse theory for filtrations and efficient computation of persistent homology
- Morse theory from an algebraic viewpoint
- Multidimensional persistence and noise
- On the global dynamics of attractors for scalar delay equations
- On the groups \(H(\Pi,n)\). I
- Persistence theory. From quiver representations to data analysis
- Simplical models for the global dynamics of attractors
- Stratifying multiparameter persistent homology
- The Connection Matrix Theory for Morse Decompositions
- The Connection Matrix in Morse-Smale Flows
- The Continuation Theory for Morse Decompositions and Connection Matrices
- Transition matrix theory
- Witten's complex and infinite dimensional Morse theory
Cited in
(9)- COMPUTATION OF CONNECTION MATRICES USING THE SOFTWARE PACKAGE conley
- Homology of configuration spaces of hard squares in a rectangle
- conley: Computing connection matrices in Maple
- Computing Connection Matrices via Persistence-Like Reductions
- Principal components along quiver representations
- Lattice structures for attractors. III
- scientific article; zbMATH DE number 4069362 (Why is no real title available?)
- A simple derivation of the interactor matrix and its applications
- Conley's spectral sequence via the sweeping algorithm
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)
