Permutation Groups following GroupsCore API
-
Updated
Dec 21, 2025 - Julia
Permutation Groups following GroupsCore API
Basic group theory algorithms for permutation groups, such as the creation of a stabilizer chain.
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
Implementation of Schreier-Sims representation of finite groups
Add a description, image, and links to the schreier-sims topic page so that developers can more easily learn about it.
To associate your repository with the schreier-sims topic, visit your repo's landing page and select "manage topics."