arXiv subjects

Jay H. Beder

Publications and source records attributed to Jay H. Beder.

4 recordsLinked to original sources

arXiv2015

A note on the minimum size of an orthogonal array

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.

math.ST↗

arXiv2015

Box-Hunter resolution in nonregular fractional factorial designs

In a 1961 paper, Box and Hunter defined the resolution of a regular fractional factorial design as a measure of the amount of aliasing in the fraction. They also indicated that the maximum resolution is equal to the minimum length of a defining word. The idea of a wordlength pattern has now been extended to nonregular designs by various authors, who show that the minimum generalized wordlength equals the maximum strength plus 1. Minimum generalized wordlength is often taken as the definition of resolution. However, Box and Hunter's original definition, which does not depend on wordlength, can be extended to nonregular designs if they are simple. The purpose of this paper is to prove that the maximum Box-Hunter resolution does equal the maximum strength plus 1, and therefore equals the minimum generalized wordlength. Other approaches to resolution are briefly discussed.

stat.ME↗

arXiv2012

Generalized wordlength patterns and strength

Xu and Wu (2001) defined the \emph{generalized wordlength pattern} $(A_1, ..., A_k)$ of an arbitrary fractional factorial design (or orthogonal array) on $k$ factors. They gave a coding-theoretic proof of the property that the design has strength $t$ if and only if $A_1 = ... = A_t = 0$. The quantities $A_i$ are defined in terms of characters of cyclic groups, and so one might seek a direct character-theoretic proof of this result. We give such a proof, in which the specific group structure (such as cyclicity) plays essentially no role. Nonabelian groups can be used if the counting function of the design satisfies one assumption, as illustrated by a couple of examples.

math.ST↗

arXiv2009

Invariance of generalized wordlength patterns

The generalized wordlength pattern (GWLP) introduced by Xu and Wu (2001) for an arbitrary fractional factorial design allows one to extend the use of the minimum aberration criterion to such designs. Ai and Zhang (2004) defined the $J$-characteristics of a design and showed that they uniquely determine the design. While both the GWLP and the $J$-characteristics require indexing the levels of each factor by a cyclic group, we see that the definitions carry over with appropriate changes if instead one uses an arbitrary abelian group. This means that the original definitions rest on an arbitrary choice of group structure. We show that the GWLP of a design is independent of this choice, but that the $J$-characteristics are not. We briefly discuss some implications of these results.

stat.ME↗