×
Houghton, C. H.

The first cohomology of a group with permutation module coefficients. (English) Zbl 0377.20044

Arch. Math. 31, 254-258 (1978).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0377.20044

Cited in 2 Reviews
Cited in 23 Documents

MSC:

20J05 Homological methods in group theory
20K15 Torsion-free groups, finite rank
20E25 Local properties of groups
20F99 Special aspects of infinite or finite groups
Cite Review PDF
Full Text: DOI

References:

[1] D. E.Cohen, Groups of cohomological dimension one. LNM245, Berlin 1972. · Zbl 0231.20018
[2] C. H. Houghton, Ends of groups and the associated first cohomology groups. J. London Math. Soc. (2),6, 81-92 (1972). · Zbl 0249.20016 · doi:10.1112/jlms/s2-6.1.81
[3] C. H. Houghton, Ends of locally compact groups and their coset spaces. J. Aust. Math. Soc.17, 274-284 (1974). · Zbl 0289.22005 · doi:10.1017/S1446788700017055
[4] C. H. Houghton, Group pairs associated with a class of coverings. Arch. Math.30, 275-278 (1978). · Zbl 0364.20041 · doi:10.1007/BF01226053
[5] A.Mohammadi Hassanabadi, Automorphisms of permutational wreath products. To appear in J. Aust. Math. Soc. · Zbl 0395.20015
[6] P. Scott, Ends of pairs of groups. J. Pure and Applied Algebra11 179-198 (1977). · Zbl 0368.20021 · doi:10.1016/0022-4049(77)90051-2
[7] E. Specker, Die erste Cohomologiegruppe von ?berlagerungen und Homotopie-Eigenschaften dreidimensionaler Mannigfaltigkeiten. Comment. Math. Helv.23, 303-333 (1949). · Zbl 0036.12803 · doi:10.1007/BF02565606
[8] J. Wiegold, Transitive groups with fixed-point-free permutations II. Arch. Math.29, 571-573 (1977). · Zbl 0382.20029 · doi:10.1007/BF01220455
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.