More Torsion in the Homology of the Matching Complex

A matching on a set $X$ is a collection of pairwise disjoint subsets of $X$ of size two. Using computers, we analyze the integral homology of the matching complex $M_n$, which is the simplicial complex of matchings on the set $\{1, >..., n\}$. The main result is the detection of elements of order $p$ in the homology for $p \in \{5,7,11,13\}$. Specifically, we show that there are elements of order 5 in the homology of $M_n$ for $n \ge 18$ and for $n \in {14,16}$. The only previously known value was $n = 14$, and in this particular case we have a new computer-free proof. Moreover, we show that there are elements of order 7 in the homology of $M_n$ for all odd $n$ between 23 and 41 and for $n=30$. In addition, there are elements of order 11 in the homology of $M_{47}$ and elements of order 13 in the homology of $M_{62}$. Finally, we compute the ranks of the Sylow 3- and 5-subgroups of the torsion part of $H_d(M_n;Z)$ for $13 \le n \le 16$; a complete description of the homology already exists for $n \le 12$. To prove the results, we use a representation-theoretic approach, examining subcomplexes of the chain complex of $M_n$ obtained by letting certain groups act on the chain complex.Comment: 35 pages, 10 figure

Five-Torsion in the Homology of the Matching Complex on 14 Vertices

J. L. Andersen proved that there is 5-torsion in the bottom nonvanishing homology group of the simplicial complex of graphs of degree at most two on seven vertices. We use this result to demonstrate that there is 5-torsion also in the bottom nonvanishing homology group of the matching complex $M_{14}$ on 14 vertices. Combining our observation with results due to Bouc and to Shareshian and Wachs, we conclude that the case $n=14$ is exceptional; for all other $n$, the torsion subgroup of the bottom nonvanishing homology group has exponent three or is zero. The possibility remains that there is other torsion than 3-torsion in higher-degree homology groups of $M_n$ when $n \ge 13$ and $n \neq 14$.Comment: 11 page

Exact Sequences for the Homology of the Matching Complex

Building on work by Bouc and by Shareshian and Wachs, we provide a toolbox of long exact sequences for the reduced simplicial homology of the matching complex $M_n$, which is the simplicial complex of matchings in the complete graph $K_n$. Combining these sequences in different ways, we prove several results about the 3-torsion part of the homology of $M_n$. First, we demonstrate that there is nonvanishing 3-torsion in $H_d(M_n;Z)$ whenever \nu_n \le d \le (n-6}/2, where $\nu_n= \lceil (n-4)/3 \rceil$. By results due to Bouc and to Shareshian and Wachs, $H_{\nu_n}(M_n;Z)$ is a nontrivial elementary 3-group for almost all $n$ and the bottom nonvanishing homology group of $M_n$ for all $n \neq 2$. Second, we prove that $H_d(M_n;Z)$ is a nontrivial 3-group whenever $\nu_n \le d \le (2n-9)/5$. Third, for each $k \ge 0$, we show that there is a polynomial $f_k(r)$ of degree 3k such that the dimension of $H_{k-1+r}(M_{2k+1+3r};Z_3)$, viewed as a vector space over $Z_3$, is at most $f_k(r)$ for all $r \ge k+2$.Comment: 31 page

Complexes of not ii-connected graphs

Complexes of (not) connected graphs, hypergraphs and their homology appear in the construction of knot invariants given by V. Vassiliev. In this paper we study the complexes of not $i$-connected $k$-hypergraphs on $n$ vertices. We show that the complex of not $2$-connected graphs has the homotopy type of a wedge of $(n-2)!$ spheres of dimension $2n-5$. This answers one of the questions raised by Vassiliev in connection with knot invariants. For this case the $S_n$-action on the homology of the complex is also determined. For complexes of not $2$-connected $k$-hypergraphs we provide a formula for the generating function of the Euler characteristic, and we introduce certain lattices of graphs that encode their topology. We also present partial results for some other cases. In particular, we show that the complex of not $(n-2)$-connected graphs is Alexander dual to the complex of partial matchings of the complete graph. For not $(n-3)$-connected graphs we provide a formula for the generating function of the Euler characteristic