Three recursive constructions for Howell designs are described, and it is shown that all Howell designs H(s, 2n) exist, with s odd, n ⩽ s ⩽ 2n − 1, (s, ...

Three recursive constructions for Howell designs are described, and it is shown that all Howell designs H(s, 2n) exist, with s odd, n <s 6 2n - 1, (s, 2n) # (3, ...

Semantic Scholar extracted view of "The Existence of Howell Designs of Odd Side" by Douglas R Stinson.

A Howell design of side s and order 2n, or more briefly, an H(s, 2n), is an s × s array in which each cell either is empty or contains an unordered pair of ...

Although much progress has been made in the construction of Howell designs, the existence question has not been settled. The purpose of this note is to ...

Informatibn on *-designs for s odd can be found in. [27]. Many of the recursive constructions also use Howell designs in standard form. Suppose H is an H*(s, 2n ...

Some Howell designs of prime side. This paper deals with the existence question for types of Howell Designs of odd side. One of the difficulties that must be ...

A Howell design of side s and order Zn, or more. briefly an H(s, 2n), is an s x s array in which each cell is either empty or else contains an unordered ...

This article investigates the spectrum of generalized Howell design GHD(n+1,3n). We show that there exists a GHD(n +1,3n) for any positive integer n > 6 with at ...

Jan 19, 2021 · A Howell design of side s and order 2n, or more briefly an H(s,2n), is an (s×s)- array in which each cell is either empty or contains an ...