- sgs :: (Ord a, Show a) => [Permutation a] -> [Permutation a]
- isMember :: (Ord t, Show t) => [Permutation t] -> Permutation t -> Bool
- elts :: (Ord t, Show t) => [Permutation t] -> [Permutation t]
- order :: (Ord t, Show t) => [Permutation t] -> Integer

# Documentation

sgs :: (Ord a, Show a) => [Permutation a] -> [Permutation a]Source

Given generators for a permutation group, return a strong generating set. The result is calculated using Schreier-Sims algorithm, and is relative to the base implied by the Ord instance

isMember :: (Ord t, Show t) => [Permutation t] -> Permutation t -> BoolSource

Given generators for a group, determine whether a permutation is a member of the group, using Schreier-Sims algorithm

elts :: (Ord t, Show t) => [Permutation t] -> [Permutation t]Source

Given generators for a group, return a (sorted) list of all elements of the group, using Schreier-Sims algorithm