Computing Resolutions Over Finite p-Groups

Johannes Grabmeier () and Larry A. Lambe ()
Additional contact information
Johannes Grabmeier: IBM Deutschland Informationssysteme GmbH
Larry A. Lambe: Centre for Innovative Computation University of Wales

A chapter in Algebraic Combinatorics and Applications, 2001, pp 157-195 from Springer

Abstract: Abstract A uniform and constructive approach for the computation of resolutions and for (co)homology computations for any finite 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.

Keywords: Free Resolution; Minimal Resolution; Elementary Abelian Group; Chain Homotopy; Computing Resolution (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-59448-9_12

Ordering information: This item can be ordered from
http://www.springer.com/9783642594489

DOI: 10.1007/978-3-642-59448-9_12

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().