“…Throughout, we will assume that (X, {f 1 ,f 2 ,f 3 }) is an association scheme with parameters as in [4] such that all maximal cliques in f l = (X, f 1 ) have size s. We will call such maximal cliques lines, the elements of X points, and refer to x and y as adjacent if (x,y) e f 1 . Let A i be the adjacency matrix and M i be the intersection matrix for the relation f i ; so A i is the matrix with rows and columns indexed by elements of X with (x, y) entry equal to 1 if (x, y) e f i and 0 otherwise, and M i is the 4 x 4 matrix with (j, k) entry p k ji .…”