Conference matrices and related objects

This webpage supplements the paper ``On the coexistence of conference matrices and near resolvable 2-(2k+1,k,k-1) designs'' by Malcolm Greig, Harri Haanpää, and Petteri Kaski (Journal of Combinatorial Theory, Series A 113 (2006), 703-711).

The links in the table below lead to ASCII listings of the conference matrices, near resolvable designs, doubly regular tournaments, and strongly regular graphs reported in the paper.

k 1 2 3 4 5 6 7 8 9 10 11 12 13 14
Conference matrices of order 2k+2 1 1 1 1 1 1 1 1 2 0 9 4 41 6
Near resolvable 2-(2k+1,k,k-1) designs 1 1 1 1 1 1 1 1 2 0 19 8 374 21
Doubly regular tournaments of order 2k+1 1 1 1 2 2 37 722
Conference graphs of order 2k+1 1 1 1 1 0 15 41