Schreier-Sims algorithm

From Wikipedia, the free encyclopedia

The Schreier-Sims algorithm is an efficient method of computing a base and strong generating set (BSGS) of a permutation group. In particular, an SGS determines the order of a group and makes it easy to test membership in the group. Since the SGS is critical for many algorithms in computational group theory, computer algebra systems typically rely on the Schreier-Sims algorithm for efficient calculations in groups.

The running time of Schreier-Sims varies on the implementation. Let be given by t generators. For the deterministic version of the algorithm, possible running times are:

• O(n²log³ | G | + tnlog | G | ) requiring memory O(n²log | G | + tn)
• O(n³log³ | G | + tn²log | G | ) requiring memory O(nlog² | G | + tn)

The use of Schreier vectors can have a significant influence on the performance of implementations of the Schreier-Sims algorithm.

For Monte Carlo variations of the Schreier-Sims algorithm, we have the following estimated complexity:

O(nlognlog⁴ | G | + tnlog | G | ) requiring memory O(nlog | G | + tn)

In computer algebra systems, an optimized Monte Carlo algorithm is typically used.

See also Schreier's subgroup lemma.

[edit] References

• Seress, A. Permutation Group Algorithms. Cambridge U Press, 2002.