Computer Science – Discrete Mathematics
Scientific paper
2005-04-21
Comptes Rendus Mathematique, Acad. Sci. Paris, Ser. I 340 (2005), pp. 867-872
Computer Science
Discrete Mathematics
Scientific paper
We extend the combinatorial Morse complex construction to the arbitrary free chain complexes, and give a short, self-contained, and elementary proof of the quasi-isomorphism between the original chain complex and its Morse complex. Even stronger, the main result states that, if $C_*$ is a free chain complex, and $\cm$ an acyclic matching, then $C_*=C_*^\cm\oplus T_*$, where $C_*^\cm$ is the Morse complex generated by the critical elements, and $T_*$ is an acyclic complex.
No associations
LandOfFree
Discrete Morse Theory for free chain complexes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Discrete Morse Theory for free chain complexes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Discrete Morse Theory for free chain complexes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-315126