A note on the minimum size of an orthogonal array

DOI10.1080/03610926.2015.1071391zbMATH Open1368.62226arXiv1508.06558OpenAlexW2963562773MaRDI QIDQ4976247FDOQ4976247

Authors: Jay H. Beder, Margaret Ann McComack

Publication date: 27 July 2017

Published in: Communications in Statistics: Theory and Methods (Search for Journal in Brave)

Abstract: It is an elementary fact that the size of an orthogonal array of strength t on k factors must be a multiple of a certain number, say L_t, that depends on the orders of the factors. Thus L_t is a lower bound on the size of arrays of strength t on those factors, and is no larger than L_k, the size of the complete factorial design. We investigate the relationship between the numbers L_t, and two questions in particular: For what t is L_t < L_k? And when L_t = L_k, is the complete factorial design the only array of that size and strength t? Arrays are assumed to be mixed-level. We refer to an array of size less than L_k as a proper fraction. Guided by our main result, we construct a variety of mixed-level proper fractions of strength k-1 that also satisfy a certain group-theoretic condition.

Full work available at URL: https://arxiv.org/abs/1508.06558

Recommendations

zbMATH Keywords

factorial design orthogonal array conjugacy strength multiset mixed-level array

Mathematics Subject Classification ID

Factorial statistical designs (62K15) Orthogonal arrays, Latin squares, Room squares (05B15)

Cites Work

Cited In (3)

This page was built for publication: A note on the minimum size of an orthogonal array

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4976247)