Structure on the top homology and related algorithms

DOI10.1016/J.TOPOL.2020.107397MaRDI QIDQ2219282zbMATH OpenOpenAlexFDO

Authors Nissim Ranade, Chandrika Sadanand, Dennis Sullivan

Publication date 19 January 2021

Published in Topology and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1203.5288

zbMATH Keywords

decomposition of finite simplicial complexes

Mathematics Subject Classification ID

Discrete Morse theory and related ideas in manifold topology (57Q70)

Abstract: We explore the special structure of the top-dimensional homology of any compact triangulable space $X$ of dimension $d$. Since there are no $(d+1)$-dimensional cells, the top homology equals the top cycles and is thus a free abelian group. There is no obvious basis, but we show that there is a canonical embedding of the top homology into a canonical free abelian group which has a natural basis up to signs. This embedding structure is an invariant of $X$ up to homeomorphism. This circumstance gives the top homology the structure of an (orientable) matroid, where cycles in the sense of matroids correspond to the cycles in the sense of homology. This adds a novel topological invariant to the topological literature. We apply this matroid structure on the top homology to give a polynomial-time algorithm for the construction of a basis of the top homology (over $mathbbZ$ coefficients).

Review text

The authors study the top homology of a finite simplicial complex $X$ of dimension $d$. To this end they consider a filtration $X=X_d\supseteq X_{d-1}\supseteq\cdots$, where $X_{k-1}$ collects those $(k-1)$-cells of $X_k$ which are contained in more than two $k$-cells. The connected components of $X_k\setminus X_{k-1}$ are called the \textit{$k$-strata} of $X$. It is shown that the long exact homology sequences of the pairs $(X_k,X_{k-1})$ provide a chain complex whose top homology agrees with the top simplicial homology of $X$. Moreover, it turns out that the set of $k$-strata with chosen orientations has the structure of an oriented matroid. This is then used to give an algorithm for computing the top simplicial homology of $X$.

Recommendations

• scientific article; zbMATH DE number 440064
• Algorithms in algebraic topology and homological algebra: the problem of complexity
• Computations of relative topological coHochschild homology
• scientific article; zbMATH DE number 5206858
• Algebraic topology. A structural introduction
• Simplicial and operad methods in algebraic topology
• scientific article; zbMATH DE number 1904840
• Topological methods in algebraic geometry
• scientific article; zbMATH DE number 3225125
• An application of computer algebra to algebraic topology

Cites work

• Combinatorial geometries, convex polyhedra, and Schubert cells
• Combinatorial homotopy. II
• Efficient algorithms for computing a minimal homology basis
• Greedy optimal homotopy and homology generators
• Homology computations via acyclic subspace
• scientific article; zbMATH DE number 4102053 (Why is no real title available?)
• scientific article; zbMATH DE number 3736614 (Why is no real title available?)
• scientific article; zbMATH DE number 5047784 (Why is no real title available?)
• scientific article; zbMATH DE number 3276402 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Maximal Flow Through a Network
• Measuring and computing natural generators for homology groups
• New Finite Pivoting Rules for the Simplex Method
• On simply connected, 4-dimensional polyhedra
• On the Abstract Properties of Linear Dependence
• Orientability of matroids
• Oriented matroids
• Oriented Matroids

Cited in

(6)

• Efficient construction of 2-chains representing a basis of \(H_{2}(\overline {\Omega }, \partial {\Omega }; \mathbb {Z})\)
• Algorithmic canonical stratifications of simplicial complexes
• Tri-partitions and bases of an ordered complex
• Phylogenetic analysis and homology
• Annotating simplices with a homology basis and its applications
• Filtered simplicial homology, graph dissimilarity and überhomology

This page was built for publication: Structure on the top homology and related algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2219282)