1 citations · 1 across the 3 of their papers we have counts for
4 papers
Constructing Random Steiner Triple Systems: An Experimental Study
Daniel Heinlein, Patric R. J. Östergård
Several methods for generating random Steiner triple systems (STSs) have been proposed in the literature, such as Stinson's hill-climbing algorithm and Cameron's algorithm, but the…
Steiner Triple Systems of Order 21 with Subsystems
Daniel Heinlein, Patric R. J. Östergård
The smallest open case for classifying Steiner triple systems is order 21. A Steiner triple system of order 21, an STS(21), can have subsystems of orders 7 and 9, and it is known t…
Constructions of maximum few-distance sets in Euclidean spaces
Ferenc Szöllősi, Patric R. J. Östergård
A finite set of distinct vectors in the -dimensional Euclidean space is called an -distance set if the set of mutual distances between distinct e…
Enumeration of Seidel matrices
Ferenc Szöllősi, Patric R. J. Östergård
In this paper Seidel matrices are studied, and their spectrum and several related algebraic properties are determined for order . Based on this Seidel matrices with exact…