The elementary-33 and cyclic-order conjecture for DnD_n homology

Let DnD_n be the graph considered in the paper, let M(Dn)M(D_n) be its matching complex, and let ν2n\nu_{2n} denote the relevant homology dimension. The preceding theorem shows that H~ν2n(M(Dn))0\widetilde H_{\nu_{2n}}(M(D_n))\neq 0 for n3n\geq 3.

The DnD_n conjecture. There exists an integer n08n_0\geq 8 such that, if nn0n\geq n_0, then H~ν2n(M(Dn))\widetilde H_{\nu_{2n}}(M(D_n)) is an elementary 33-group. Moreover, if nn0n\geq n_0 and n2(mod3)n\equiv 2\pmod 3, then

H~ν2n(M(Dn))Z3.\widetilde H_{\nu_{2n}}(M(D_n))\cong\mathbb Z_3.

This conjecture is suggested by the computational data and the torsion results for chessboard complexes; it predicts both eventual elementary 33-torsion and, in one congruence class, a single cyclic summand.

Sources & referencesView supporting material

Primary source

John Shareshian and Michelle L. Wachs, “Torsion in the Matching Complex and Chessboard Complex”, arXiv:math/0409054 (2004).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.