No abstract

The q k (full) factorial design with replication λ is the multi-set consisting of λ occurrences of each element of each q-ary vector of length k; we denote this by λ×[q] k . An m×n row-column factorial design q k of strength t is an arrangement of the elements of λ × [q] k into an m × n array (which we say is of type I k (m, n, q, t)) such that for each row (column), the set of vectors therein are the rows of an orthogonal array of size k, degree n (respectively, m), q levels and strength t. Such arrays are used in experimental design. In this context, for a row-column factorial design of strength t, all subsets of interactions of size at most t can be estimated without confounding by the row and column blocking factors.In this manuscript we study row-column factorial designs with strength t ≥ 2. Our results for strength t = 2 are as follows. For any prime power q and assuming 2 ≤ M ≤ N , we show that there exists an array of type I k (q M , q N , q, 2) if and only if k ≤ M + N , k ≤ (q M − 1)/(q − 1) and (k, M, q) = (3, 2, 2). We find necessary and sufficient conditions for the existence of I k (4m, n, 2, 2) whenever m is odd, assuming the existence of a Hadamard matrix of order 4m. For t = 3 we focus on the binary case. Assuming M ≤ N , there exists an array of type I k (2 M , 2 N , 2, 3) if and only if M ≥ 5, k ≤ M + N and k ≤ 2 M −1 . Most of our constructions use linear algebra, often in application to existing orthogonal arrays and Hadamard matrices.

An m × n row-column factorial design is an arrangement of the elements of a factorial design into a rectangular array. Such an array is used in experimental design, where the rows and columns can act as blocking factors. If for each row/column and vector position, each element has the same regularity, then all main effects can be estimated without confounding by the row and column blocking factors.Formally, for any integer q, let [q] = {0, 1, . . . , q − 1}. The q k (full) factorial design with replication α is the multi-set consisting of α occurrences of each element of [q] k ; we denote this by α × [q] k . A regular m × n row-column factorial design is an arrangement of the the elements of α × [q] k into an m × n array (which we say is of type I k (m, n; q)) such that for each row (column) and fixed vector position i ∈ [q], each element of [q] occurs n/q times (respectively, m/q times). Let m ≤ n. We show that an array of type I k (m, n; q) exists if and only if (a) q|m and q|n; (b) q k |mn; (c) (k, q, m, n) = (2, 6, 6, 6) and (d) if (k, q, m) = (2, 2, 2) then 4 divides n. This extends the work of Godolphin (2019), who showed the above is true for the case q = 2 when m and n are powers of 2.In the case k = 2, the above implies necessary and sufficient conditions for the existence of a pair of mutually orthogonal frequency rectangles (or F -rectangles) whenever each symbol occurs the same number of times in a given row or column.

No abstract