Computing resolutions over finite p-groups
A constructive approach for the computation of resolutions and for cohomology and homology computations for any finite \(p\)-group is presented here. The resolutions are constructed as vector spaces over \(\mathbb{F}_p\) (the field with \(p\) elements) and are as small as the minimal resolution of \(\mathbb{F}_p\) over an elementary Abelian \(p\)-group of the same order as the group \(G\) under study. The used algorithm is of a recursive nature and can be applied naturally to \(p\)-groups \(G\) given as a polynomial perturbation of the elementary Abelian group. The implementations are based on the development of algebraic data structures. Applications to calculating functional cocycles are given. For the entire collection see [Zbl 0961.00017].
- The homological reduction method for computing cocyclic Hadamard matrices
- Finite group characters on free resolutions
- Computing group resolutions.
- scientific article; zbMATH DE number 4129096 (Why is no real title available?)
- Periodic resolutions for certain finite groups.
- scientific article; zbMATH DE number 1061541 (Why is no real title available?)
- Cohomologies of finite abelian groups
- On a simple method of determining the homology and the cohomology of finitely presented groups.
- An algebraic study of the Klein bottle
- Computing group cohomology rings from the Lyndon-Hochschild-Serre spectral sequence.
- Resolutions for unit groups of orders
- Homological models for semidirect products of finitely generated Abelian groups.
- Perturbation theory and free resolutions for nilpotent groups of class 2
This page was built for publication: Computing resolutions over finite \(p\)-groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2724748)