Below are links to some GAP programs I have constructed for various purposes. Those marked (*) use the GAP share package GRAPE, by L. H. Soicher. This requires the graph automorphism package nauty, and runs only on UNIX systems (including GNU/Linux!)
Of course, these programs are provided with no guarantee! In addition, they may be updated at any time. Current versions are 25/07/2003 unless otherwise noted.
Peter J. Cameron, Coherent configurations, association schemes, and permutation groups, pp. 55-71 in Groups, Combinatorics and Geometry (ed. A. A. Ivanov, M. W. Liebeck and J. Saxl), World Scientific, Singapore, 2003and see also the web page Classification of association schemes with small vertices by A. Hanaki and I. Miyamoto.
M. T. Jacobson and P. Matthews, Generating uniformly distributed random Latin squares, J. Combinatorial Design 4 (1996), 405-437and the analogous chain for Steiner triple systems. Some properties (transversals and orthogonal mates for Latin squares, parallel classes and resolutions for STS) are also calculated.
This page maintained by
Last modified 25 July 2003