×

Homology of certain sets of 2-subgroups of symmetric groups. (Homologie de certains ensembles de 2-sous-groupes des groupes symétriques.) (French) Zbl 0786.55005

In his paper [Adv. Math. 28, 101-128 (1978; Zbl 0388.55007)], D. Quillen showed that the set of non-trivial \(p\)-subgroups of a finite group, \(s_ p(G)\), has the same homotopy type as the set of non-trivial elementary abelian \(p\)-subgroups. In this paper the author initiates a study of the group \(d_ 2(n)\) of non-trivial elmentary abelian 2- subgroups of the symmetric group \(S_ n\), and relates it to \(s_ 2(S_ n)\). Much of the remainder of the paper is devoted to homology calculations. For example it is found that certain of these groups are cyclic of order 3. The article concludes with the observation that although it is difficult to compute the homology of \(d_ 2(n)\) exactly, it is easy to find its Lefschetz module.
Reviewer: S.Jekel (Boston)

MSC:

55P10 Homotopy equivalences in algebraic topology
20J99 Connections of group theory with homological algebra and category theory

Citations:

Zbl 0388.55007
Full Text: DOI

References:

[1] Bouc, S., Homologie de certains ensembles ordonnés, C.R. Acad. Sci. Paris Sér. I, \(299, n^o 2 (1984)\) · Zbl 0566.20035
[2] Bouc, S., Exponentielle et modules de Steinberg, J. Algebra, 150, 118-157 (1992) · Zbl 0759.19001
[3] James, G. D., The representation theory of the symmetric groups, (Lecture Notes in Mathematics, Vol. 682 (1978), Springer-Verlag: Springer-Verlag Berlin/New York) · Zbl 0393.20009
[4] Quillen, D., Homotopy properties of the poset of non-trivial \(p\)-subgroups, Adv. in. Math., \(28, n^o 2, 101-128 (1978)\) · Zbl 0388.55007
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.