2000000 Steiner triple systems of order 19
Open Access
- 1 January 1985
- journal article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 44 (170) , 533-535
- https://doi.org/10.1090/s0025-5718-1985-0777284-3
Abstract
Using a hill-climbing algorithm, we construct 2117600 Steiner triple systems of order 19. These are tested for isomorphism by means of invariants, and 2111276 are shown to be nonisomorphic.Keywords
This publication has 7 references indexed in Scilit:
- Hill-Climbing Algerithms for the Construction of Combinatorial DesignsPublished by Elsevier ,1985
- Steiner triple systems of order 19 constructed from the Steiner triple system of order 9Proceedings of the Royal Society of Edinburgh: Section A Mathematics, 1983
- Steiner triple systems with rotational automorphismsDiscrete Mathematics, 1981
- Non-Isomorphic Reverse Steiner Triple Systems of Order 19Published by Elsevier ,1980
- Algebraic Speculations About Steiner SystemsPublished by Elsevier ,1980
- Nonisomorphic Steiner triple systemsMathematische Zeitschrift, 1974
- Sur les syst mes cycliques de triples de Steiner diff rents pourN premier (ou puissance de nombre premier) de la forme 6n+1Commentarii Mathematici Helvetici, 1930