Topology of matching complexes of complete graphs via discrete Morse theory

Bouc (1992) first studied the topological properties of M-n, the matching complex of the complete graph of order n, in connection with Brown complexes and Quillen complexes. Bjo<spacing diaeresis>rner et al. (1994) showed that M(n )is homotopically (v(n) - 1)-connected, where v(n) = & LeftFloor;n+1 /3 & RightFloor; - 1, and conjectured that this connectivity bound is sharp. Shareshian and Wachs (2007) settled the conjecture by inductively showing that the v(n) -dimensional homology group of M(n )is nontrivial, with Bouc's calculation of H1(M-7 ) serving as the pivotal base step. In general, the topology of M(n )is not very well-understood, even for a small n. In the present article, we look into the topology of M-n , and M(7 )in particular, in the light of discrete Morse theory as developed by Forman (1998). We first construct a gradient vector field on M-n (for n >= 5) that doesn't admit any critical simplices of dimension up to v(n) - 1, except one unavoidable 0-simplex, which also leads to the aforementioned (v(n) - 1)-connectedness of M(n )in a purely combinatorial way. However, for an efficient homology computation by discrete Morse theoretic techniques, we are required to work with a gradient vector field that admits a low number of critical simplices, and also allows an efficient enumeration of gradient paths. An optimal gradient vector field is one with the least number of critical simplices, but the problem of finding an optimal gradient vector field, in general, is an NP-hard problem (even for 2-dimensional complexes). We improve the gradient vector field constructed on M(7 )in particular to a much more efficient (near-optimal) one, and then with the help of this improved gradient vector field, compute the homology groups of M(7 )in an efficient and algorithmic manner. We also augment this near-optimal gradient vector field to one that we conjecture to be optimal.