Title: Computational Group Theory (tutorial)
Speaker: Alexander Hulpke, CSU
Abstract: These lectures are intended to give an overview of Concepts, Ideas, Tools, and Main results in Computational Group Theory (CGT), aimed at researchers who have just a basic idea of the concept of groups (knowing what a homomorphism is will be enough) but do not necessarily aim to specialize in the area. Focussing on the case of permutation groups and matrix groups, I will describe the what and why of the problems CGT considers, the assumptions that are made on input, the fundamental data structures that are used (and how they are constructed), and some ways how these tools can be used in solving problems that are outside the scope of the basic algorithms.
Part I: Types for inputting algebra, acting on finite sets.
Part II: Acting on linear sets.
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
If you have additional questions, feel free to reach out to a maintainer / contributor on the contact page.