Homology algorithm based on acyclic subspace

DOI10.1016/j.camwa.2007.08.044zbMath1142.15300OpenAlexW2094407865WikidataQ112163850 ScholiaQ112163850MaRDI QIDQ945134

Natalia Ẓelazna, Paweł Pilarczyk, Marian Mrozek

Publication date: 11 September 2008

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2007.08.044

zbMATH Keywords

cubical homologycubical sethomology algorithmacyclic subspaceSmith diagonalization

Mathematics Subject Classification ID

Linear transformations, semilinear transformations (15A04)

Related Items

CW Complexes for Complex Algebraic Surfaces ⋮ Čech type approach to computing homology of maps ⋮ Discrete Morse theoretic algorithms for computing homology of complexes and maps ⋮ Coreduction homology algorithm for inclusions and persistent homology ⋮ Coreduction homology algorithm for regular CW-complexes ⋮ Computing multiparameter persistent homology through a discrete Morse-based approach ⋮ A novel technique for cohomology computations in engineering practice ⋮ On 2-dimensional simple sets in \(n\)-dimensional cubic grids ⋮ Computation of cubical homology, cohomology, and (co)homological operations via chain contraction ⋮ Coreduction homology algorithm ⋮ Decomposing Cavities in Digital Volumes into Products of Cycles ⋮ Computing Homology: A Global Reduction Approach

Uses Software

• GAIO
• Homology
• CAPD
• Chom

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Morphological characterization of the diblock copolymer problem with topological computation
• Index pairs algorithms
• Coreduction homology algorithm
• Homology computation by reduction of chain complexes
• On bounding the Betti numbers and computing the Euler characteristic of semi-algebraic sets
• Computational homology
• Computing persistent homology
• Topological persistence and simplification
• Computer assisted method for proving existence of periodic orbits
• Graph approach to the computation of the homology of continuous maps
• Homology Computations via Acyclic Subspace
• Coordinate-free Coverage in Sensor Networks with Controlled Boundaries via Homology
• Chaos in the Lorenz equations: a computer-assisted proof
• A combinatorial procedure for finding isolating neighbourhoods and index pairs
• Chaos in the Lorenz equations: A computer assisted proof. Part II: Details
• A Rigorous Numerical Method for the Global Analysis of Infinite-Dimensional Discrete Dynamical Systems
• Free Energy of a Nonuniform System. I. Interfacial Free Energy
• Rigorous Computations of Homoclinic Tangencies

This page was built for publication: Homology algorithm based on acyclic subspace