Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



Steiner triple systems of order $19$ with nontrivial automorphism group

Authors: Charles J. Colbourn, Spyros S. Magliveras and D. R. Stinson
Journal: Math. Comp. 59 (1992), 283-295
MSC: Primary 05B07; Secondary 20B25
MathSciNet review: 1134722
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: There are 172,248 Steiner triple systems of order 19 having a nontrivial automorphism group. Computational methods suitable for generating these designs are developed. The use of tactical configurations in conjunction with orderly algorithms underlies practical techniques for the generation of the designs, and the subexponential time isomorphism technique for triple systems is improved in practice to test isomorphisms of the designs. The automorphism group of each of the triple systems is computed, and a summary presented of the number of systems with each possible type of automorphism.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 05B07, 20B25

Retrieve articles in all journals with MSC: 05B07, 20B25

Additional Information

Article copyright: © Copyright 1992 American Mathematical Society