## Computing Resolutions over Finite p-Groups (2000)

Citations: | 2 - 0 self |

### BibTeX

@MISC{Grabmeier00computingresolutions,

author = {Johannes Grabmeier and Larry A. Lambe},

title = {Computing Resolutions over Finite p-Groups},

year = {2000}

}

### OpenURL

### Abstract

. A uniform and constructive approach for the computation of resolutions and for (co)homology computations for any nite p-group is detailed. The resolutions we construct ([32]) are, as vector spaces, as small as the minimal resolution of IFp over the elementary abelian p-group of the same order as the group under study. Our implementations are based on the development of sophisticated algebraic data structures. Applications to calculating functional cocycles are given and the possibility of constructing interesting codes using such methods is presented. 1 Introduction In this paper, we present a uniform constructive approach to calculating relatively small resolutions over nite p-groups. The algorithm we use comes from [32, 8.1.8 and the penultimate paragraph of 9.4]. There has been a massive amount of work done on the structure of p-groups since the beginning of group theory. A good introduction is [22]. We combine mathematical and computer methods to construct the uniform resolut...