The Steiner Triple Systems of order 19, STS(19), were classified by Petteri Kaski and Patric Östergård in 2004 [1]; there are 11,084,874,829 such systems. In 2009, Kaski, Östergård, Olli Pottonen and Lasse Kiviluoto developed a compression algorithm in order to store the data and make it available [2]. Now it is available on this site.
For more information about the classification and compression algorithms, see the papers in bibliography below. If you find this data useful for your research, please cite our paper [2] in your relevant publications.
This page is maintained by Olli Pottonen.
In version 1.0 of the software, random sampling used a really poor random number generation method. This is fixed in version 1.1.
Here are random samples of distinct STS's, compressed just as the main data set.
Below is all the data. Please note that each file is 400 to 450 megabytes (except the last one which is bit smaller), and the total amount of data is about 39 gigabytes. Download will take time.
Is trivial that STS(3) is unique. It is also easy to derive the unique of STS(7). The STS(9), STS(13) and STS(15) are more complicated. Regardless even the STS(15) were classified manually [3, 4], which was quite an achievement. Of course later the result has been verified with digital computers several times, first time already in 1955 [5].
These systems are in the files below. The format is different; the (de)compression software is customized for v=19, and for smaller order efficient compression is non-issue. The files are in ASCII, one system on each line. The point set is {a, b, c, … o} (for v=15; for smaller v an obvious subset). The first three characters are the first block, next three characters the second block etc.