The Schreier–Sims Algorithm is a Fundamental Method in Computational Group Theory. It is used to Find the Order of a Finite Permutation Group and Provides a Structured Way to test for Membership Within that Group
A Magma package to recognise finitely generated discrete subgroups of SL(2, R) and PSL(2, R)
Functions to calculate the breadth of a nilpotent Lie algebra
A graph isomorphism program that checks the isomorphism of two graphs and calculates their automorphism group.
GAP code to perform experiments in nilpotent groups
GAP package to compute canonical conjugate respresentatives in nilpotent groups
Add a description, image, and links to the computational-group-theory topic page so that developers can more easily learn about it.
To associate your repository with the computational-group-theory topic, visit your repo's landing page and select "manage topics."