Malcolm Greig

Learn More
A range of methods is presented for the recursive construction of sets of orthogonal balanced incomplete block designs. To enable these methods, some new types of designs are de1ned. Some examples of these are given, and pairs of orthogonal BIBDs constructed for k =3; =2, for all but 12 values of v where v ≡ 0; 1 (mod 3) with v¿ 6. c © 2002 Elsevier Science(More)
de Launey and Seberry have looked at the existence of Generalized Bhaskar Rao designs with block size 4 signed over elementary Abelian groups and shown that the necessary conditions for the existence of a (v, 4, λ; EA(g)) GBRD are sufficient for λ > g with 70 possible exceptions. This article extends that work by reducing those possible exceptions to just a(More)
This paper discusses the potential value of local, partnership-based employability training and job guarantee programmes, focusing on one example—the ‘Alloa Initiative’. The Initiative involved an employability training and job guarantee scheme developed in partnership with Tesco, a major retailer, in preparation for the opening of one of the company’s new(More)
The object of this paper is the construction of balanced incomplete block designs with k = 7. This paper continues the work begun by Hanani, who solved the construction problem for designs with a block size of 7, and with λ = 6, 7, 21 and 42. The construction problem is solved here for designs with λ > 2 except for v = 253, λ = 4, 5; also for λ = 2, the(More)