On the growth problem for skew and symmetric conference matrices

An algorithm for extending a k × k matrix with elements 0, ±1 to a skew and symmetric conference matrix of order n is described. By using this algorithm we show that the unique W(8, 7) has two pivot structures. We also prove that the unique W(10, 9) has three pivot patterns.