Vole

Vole organises lengthy explorations: Backtrack search in permutation groups with graphs

0.5.3

21 December 2021

Mun See Chang
Email: msc2@st-andrews.ac.uk
Address:
School of Computer Science, University of St Andrews, St Andrews, Fife, KY16 9SX, Scotland

Wilf A. Wilson
Email: gap@wilf-wilson.net
Homepage: https://wilf.me
Address:
School of Computer Science, University of St Andrews, St Andrews, Fife, KY16 9SX, Scotland

Abstract

Vole is a GAP package that implements graph backtracking, which can be used to solve many problems in finite permutation groups, such as subgroup intersections, normalisers, set stabilisers, and canonical images of groups.

Acknowledgements

The authors would like to thank the Royal Society (grant codes RGF\EA\181005 and URF\R\180015) for their financial support at the time that Vole was created.

1 Introduction to Vole

1.1 High level overview of Vole and this manual

1.2 Vole's relation to GAP and its other packages

1.3 Work in progress

1.4 Performance

2 Setting up Vole

2.1 Dependencies

2.2 Installing Vole

2.3 Loading Vole

2.4 Running Vole's test suite

2.5 Compiling the documentation for Vole

3 Tutorial