Schreier–Sims algorithm: Difference between revisions

Revision as of 20:48, 20 October 2011

Revision as of 07:52, 20 April 2013

Line 1:

The '''Schreier–Sims algorithm''' is an [[algorithm]] in [[computational group theory]] named after mathematicians [[Otto Schreier]] and [[Charles Sims (mathematician)|Charles Sims]]. Once performed, it allows a linear time computation of the [[Order (group theory)|order]] of a finite group, group membership test (is a given permutation contained in a group?), and many other tasks. The algorithm was introduced by Sims in 1970, based on [[Schreier's subgroup lemma]]. The timing was subsequently improved by [[Donald Knuth]] in 1991. Later, an even faster [[Randomized algorithm|randomized]] version of the algorithm was developed.

== Background and timing ==

The algorithm is an efficient method of computing a [[base_base (group_theorygroup theory)|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 system]]s typically rely on the Schreier–Sims algorithm for efficient calculations in groups.

The running time of Schreier–Sims varies on the implementation. Let <math> G \leq S_n </math> be given by <math>t</math> [[Generating set of a group|generators]]. For the [[deterministic]] version of the algorithm, possible running times are:

Line 21:

* Knuth, Donald E. Efficient representation of perm groups. Combinatorica 11 (1991), no. 1, 33–43.

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

* Sims, Charles C. Computational methods in the study of permutation groups, in Computational Problems in Abstract Algebra, pp. &nbsp;169–183, Pergamon, Oxford, 1970.

{{DEFAULTSORT:Schreier-Sims algorithm}}

[[Category:Computational group theory]]

[[Category:Permutation groups]]