A matching on a set is a collection of pairwise disjoint subsets of of size two. Using computers, we analyze the integral homology of the matching complex , which is the simplicial complex of matchings on the set ${1,
…, n}p$ in the homology for . Specifically, we show that there are elements of order 5 in the homology of for and for $n \in {14,16}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 for all odd between 23 and 41 and for . In addition, there are elements of order 11 in the homology of and elements of order 13 in the homology of . Finally, we compute the ranks of the Sylow 3- and 5-subgroups of the torsion part of for ; a complete description of the homology already exists for . To prove the results, we use a representation-theoretic approach, examining subcomplexes of the chain complex of obtained by letting certain groups act on the chain complex.

生成讲解博客的中文版本

生成AI智能校验的中文版本