The complex of words and Nakaoka stability (Q2570218): Difference between revisions

The author gives a simple proof of Nakaoka stability, which states \[ H_m(\Sigma_{n-1},Z)=H_m(\Sigma_n,Z), \] for \(n/2>m\) where \(\Sigma_n\) is the symmetric group of \(n\) symbols. This is done by showing that the complex of injective words \(C_*(m)\) has non-trivial homology only in degree \(m\) and using a hyperhomology spectral sequence argument arising from the natural action of \(\Sigma_m\) on \(C_*(m)\) via its action on the alphabet. The author also studies more general complexes of words to apply it to the complex of words consisting of vectors in general position over a finite field.