Abstract
The topology of the matching complex for the 2×n grid graph is mysterious. We describe a discrete Morse matching for a family of independence complexes Ind(Δm n) that include these matching complexes. Using this matching, we determine the dimensions of the chain spaces for the resulting Morse complexes and derive bounds on the location of non-trivial homology groups for certain Ind(Δm n). Furthermore, we determine the Euler characteristic of Ind(Δm n) and prove that several homology groups of Ind(Δm n) are non-zero.
Original language | English |
---|---|
Article number | #P4.18 |
Journal | Electronic Journal of Combinatorics |
Volume | 24 |
Issue number | 4 |
DOIs | |
State | Published - Oct 20 2017 |
Bibliographical note
Publisher Copyright:© 2017, Australian National University. All rights reserved.
Keywords
- Grid graphs
- Homology
- Independence complexes
- Recursions
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
- Applied Mathematics