Advertisement

Computer Calculations and Completion Tests

  • Jon F. Carlson
  • Lisa Townsley
  • Luis Valeri-Elizondo
  • Mucheng Zhang
Part of the Algebras and Applications book series (AA, volume 3)

Abstract

Now that we have an understanding of group cohomology and the relationships among groups and subgroups, we want to implement our knowledge so as to compute the cohomology rings. In the appendix we present the results of computer calculations of the mod-2 cohomology rings of all of the groups whose orders divide 64. Each computation is a theorem. The proof of that theorem requires several stages. First, it should be checked that the algorithms that were implemented in the computer programs are correct and yield the results that are asserted. Second, we must verify that the algorithms are properly implemented. Third, since only a finite portion of the cohomology ring is actually calculated, it is necessary to show that we have computed enough to get all of the generators and relations. Finally, there is the question of whether the computer has computed accurately. The aim of this chapter is to provide a framework in which these stages can be successfully completed.

Keywords

Finite Group Maximal Subgroup Spectral Sequence Computer Calculation Computer Algebra System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 2003

Authors and Affiliations

  • Jon F. Carlson
    • 1
  • Lisa Townsley
    • 2
  • Luis Valeri-Elizondo
    • 3
  • Mucheng Zhang
    • 1
  1. 1.University of GeorgiaAthensUSA
  2. 2.Benedictine UniversityLisleUSA
  3. 3.Instituto de MatematicasUNAMMoreliaUSA

Personalised recommendations