2-level fractional factorial designs which are the union of non trivial regular designs
Abstract
Every fraction is a union of points, which are trivial regular fractions. To characterize non trivial decomposition, we derive a condition for the inclusion of a regular fraction as follows. Let F = Σα bα Xα be the indicator polynomial of a generic fraction, see Fontana et al, JSPI 2000, 149-172. Regular fractions are characterized by R = 1l Σα ∈ L eα Xα, where α eα is an group homeomorphism from L ⊂ Z2d into \-1,+1\. The regular R is a subset of the fraction F if FR = R, which in turn is equivalent to Σt F(t)R(t) = Σt R(t). If H = \α1 >... αk\ is a generating set of L, and R = 12k(1 + e1Xα1) ... (1 + ekXαk), ej = 1, j=1 ... k, the inclusion condition in term of the bα's is % equationb0 + e1 bα1 + >... + e1 ... ek bα1 + ... + αk = 1. *equation % The last part of the paper will discuss some examples to investigate the practical applicability of the previous condition (*). This paper is an offspring of the Alcotra 158 EU research contract on the planning of sequential designs for sample surveys in tourism statistics.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.