Abstract
In this chapter we introduce the notion of the complexity of a module and explore some related ideas. Complexity was first defined by Jon Alperin in the late 1970’s and it helped to motivate much of the development of the homological properties of modules. In fact, the complexity of a finitely generated kG-module M is a rather crude invariant, in that it only measures the polynomial rate of growth of a minimal projective resolution of the module. The original theorem of Alperin and Evens which extended Quillen’s Dimension Theorem to modules, was proved only in terms of complexity. Later it was extended to support varieties as well. The theorem computes the complexity of a kG-module M as the maximum of the complexities of the restrictions of M to the elementary abelian subgroups of the group G.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Carlson, J.F., Townsley, L., Valeri-Elizondo, L., Zhang, M. (2003). Complexity and Multiple Complexes. In: Cohomology Rings of Finite Groups. Algebras and Applications, vol 3. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-0215-7_10
Download citation
DOI: https://doi.org/10.1007/978-94-017-0215-7_10
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-6385-4
Online ISBN: 978-94-017-0215-7
eBook Packages: Springer Book Archive