Row-column factorial designs with multiple levels

01/15/2021
by   Fahim Rahim, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/14/2022

Ryser's Theorem for Symmetric ρ-latin Squares

Let L be an n× n array whose top left r× r subarray is filled with k dif...
research
08/01/2023

Construction of 2fi-optimal row-column designs

Row-column factorial designs that provide unconfounded estimation of all...
research
01/16/2023

Ae^2I: A Double Autoencoder for Imputation of Missing Values

The most common strategy of imputing missing values in a table is to stu...
research
06/14/2023

Increasing subsequences, matrix loci, and Viennot shadows

Let 𝐱_n × n be an n × n matrix of variables and let 𝔽[𝐱_n × n] be the po...
research
03/11/2016

Matrix factoring by fraction-free reduction

We consider exact matrix decomposition by Gauss-Bareiss reduction. We in...
research
02/03/2020

Optimizing Query Predicates with Disjunctions for Column Stores

Since its inception, database research has given limited attention to op...
research
08/19/2020

Uniform semi-Latin squares and their pairwise-variance aberrations

For integers n>2 and k>0, an (n× n)/k semi-Latin square is an n× n array...

Please sign up or login with your details

Forgot password? Click here to reset