Selecting Base Points for the Schreier-Sims Algorithm for Matrix Groups

@article{Murray1995SelectingBP,
  title={Selecting Base Points for the Schreier-Sims Algorithm for Matrix Groups},
  author={Scott H. Murray and E. A. O'Brien},
  journal={J. Symb. Comput.},
  year={1995},
  volume={19},
  pages={577-584}
}
We consider the application of the Schreier-Sims algorithm and its variations to matrix groups defined over finite fields. We propose a new algorithm for the selection of the base points and demonstrate that it both improves the performance of the algorithm for a large range of examples and significantly extends the range of application. In particular, the random Schreier-Sims algorithm, with this enhancement, performs extremely well for almost simple groups. 

From This Paper

Figures, tables, and topics from this paper.
12 Citations
18 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 18 references

On the maximal subgroups of the finite classical groups

  • M. Aschbacher
  • Invent. Math.,
  • 1984
Highly Influential
6 Excerpts

Primitivity testing for matrix groups

  • Holt, F Derek, +4 authors Sarah
  • J. Algebra
  • 1996

GAP – Groups, Algorithms and Programming. Lehrstuhl D für Mathematik, RWTH Aachen

  • Schönert, Martin
  • 1994

Structural computation in finite permutation groups

  • Bosma, Wieb, Cannon, John
  • CWI Quarterly,
  • 1992

The C MeatAxe

  • Ringe, Michael
  • Lehrstuhl D für Mathematik, RWTH Aachen
  • 1992

The Primitive Soluble Permutation Groups of Degree less than 256, Lecture Notes in Math., 1519

  • M. W. Short
  • 1992
1 Excerpt

Atlas of finite groups

  • J. H. Conway, R. T. Curtis, S. P. Norton, R. A. Parker, R. A. Wilson
  • 1985
2 Excerpts

Similar Papers

Loading similar papers…