On the construction of general purpose programs for studying finite groups

Abstract

During the past decade efficient algorithms for many basic group theoretic constructions have been developed. These include centralizers, normalizers, conjugacy classes, subgroup lattices and character tables. In order to effectively utilize such programs it is necessary to allow the user to program his own constructions in terms of some basic set of… (More)
DOI: 10.1145/800204.806263

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics