Skip to main content

Timeline for (co)homology of cyclic groups

Current License: CC BY-SA 2.5

6 events
when toggle format what by license comment
Aug 24, 2010 at 9:16 vote accept louis de Thanhoffer de Völcsey
Aug 20, 2010 at 4:01 comment added Ralph (continuation) The vast cohomology computations of Carlson and Green-King (all 2-groups of order at most 128) rely on the computation of projective resolutions. In this point of view the Benson-Carlson construction is an effective way to compute a projective resolution of minimal complexity: Just compute a projective resolution up to the highest degree of the parameters and apply the construction.
Aug 20, 2010 at 4:00 comment added Ralph @Mariano: 1. The cohomology of a cyclic group is known anyway. 2. In general, to apply the cited construction, you primarily need (information about) parameters. That's no big deal: For example, you can pick them from Chern classes of a faithful unitary representation. In particular no cohomology compuations are needed to obtain their degrees.
Aug 20, 2010 at 0:27 comment added Mariano Suárez-Álvarez For this you have to know the cohomology, so it is not that useful in order to compute the cohomology :)
Aug 20, 2010 at 0:24 history edited Ralph CC BY-SA 2.5
added 151 characters in body; added 16 characters in body
Aug 20, 2010 at 0:11 history answered Ralph CC BY-SA 2.5