The lattice of N-run orthogonal arrays

E. M. Rains, N. J A Sloane, John Stufken

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

If the number of runs in a (mixed-level) orthogonal array of strength 2 is specified, what numbers of levels and factors are possible? The collection of possible sets of parameters for orthogonal arrays with N runs has a natural lattice structure, induced by the "expansive replacement" construction method. In particular the dual atoms in this lattice are the most important parameter sets, since any other parameter set for an N-run orthogonal array can be constructed from them. To get a sense for the number of dual atoms, and to begin to understand the lattice as a function of N, we investigate the height and the size of the lattice. It is shown that the height is at most ⌊c(N-1)⌋, where c = 1.4039..., and that there is an infinite sequence of values of N for which this bound is attained. On the other hand, the number of nodes in the lattice is bounded above by a superpolynomial function of N (and superpolynomial growth does occur for certain sequences of values of N). Using a new construction based on "mixed spreads", all parameter sets with 64 runs are determined. Four of these 64-run orthogonal arrays appear to be new.

Original languageEnglish (US)
Pages (from-to)477-500
Number of pages24
JournalJournal of Statistical Planning and Inference
Volume102
Issue number2
DOIs
StatePublished - Apr 1 2002
Externally publishedYes

Fingerprint

Orthogonal Array
Atoms
Lattice Structure
Replacement
Orthogonal array
Vertex of a graph

Keywords

  • Asymmetrical orthogonal array
  • Expansive replacement method
  • Geometric orthogonal array
  • Linear orthogonal array
  • Linear programming bound
  • Mixed orthogonal array
  • Mixed spread
  • Tight array

ASJC Scopus subject areas

  • Statistics, Probability and Uncertainty
  • Applied Mathematics
  • Statistics and Probability

Cite this

The lattice of N-run orthogonal arrays. / Rains, E. M.; Sloane, N. J A; Stufken, John.

In: Journal of Statistical Planning and Inference, Vol. 102, No. 2, 01.04.2002, p. 477-500.

Research output: Contribution to journalArticle

Rains, E. M. ; Sloane, N. J A ; Stufken, John. / The lattice of N-run orthogonal arrays. In: Journal of Statistical Planning and Inference. 2002 ; Vol. 102, No. 2. pp. 477-500.
@article{dc8e62e42e884abebda31bc375a5127e,
title = "The lattice of N-run orthogonal arrays",
abstract = "If the number of runs in a (mixed-level) orthogonal array of strength 2 is specified, what numbers of levels and factors are possible? The collection of possible sets of parameters for orthogonal arrays with N runs has a natural lattice structure, induced by the {"}expansive replacement{"} construction method. In particular the dual atoms in this lattice are the most important parameter sets, since any other parameter set for an N-run orthogonal array can be constructed from them. To get a sense for the number of dual atoms, and to begin to understand the lattice as a function of N, we investigate the height and the size of the lattice. It is shown that the height is at most ⌊c(N-1)⌋, where c = 1.4039..., and that there is an infinite sequence of values of N for which this bound is attained. On the other hand, the number of nodes in the lattice is bounded above by a superpolynomial function of N (and superpolynomial growth does occur for certain sequences of values of N). Using a new construction based on {"}mixed spreads{"}, all parameter sets with 64 runs are determined. Four of these 64-run orthogonal arrays appear to be new.",
keywords = "Asymmetrical orthogonal array, Expansive replacement method, Geometric orthogonal array, Linear orthogonal array, Linear programming bound, Mixed orthogonal array, Mixed spread, Tight array",
author = "Rains, {E. M.} and Sloane, {N. J A} and John Stufken",
year = "2002",
month = "4",
day = "1",
doi = "10.1016/S0378-3758(01)00119-7",
language = "English (US)",
volume = "102",
pages = "477--500",
journal = "Journal of Statistical Planning and Inference",
issn = "0378-3758",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - The lattice of N-run orthogonal arrays

AU - Rains, E. M.

AU - Sloane, N. J A

AU - Stufken, John

PY - 2002/4/1

Y1 - 2002/4/1

N2 - If the number of runs in a (mixed-level) orthogonal array of strength 2 is specified, what numbers of levels and factors are possible? The collection of possible sets of parameters for orthogonal arrays with N runs has a natural lattice structure, induced by the "expansive replacement" construction method. In particular the dual atoms in this lattice are the most important parameter sets, since any other parameter set for an N-run orthogonal array can be constructed from them. To get a sense for the number of dual atoms, and to begin to understand the lattice as a function of N, we investigate the height and the size of the lattice. It is shown that the height is at most ⌊c(N-1)⌋, where c = 1.4039..., and that there is an infinite sequence of values of N for which this bound is attained. On the other hand, the number of nodes in the lattice is bounded above by a superpolynomial function of N (and superpolynomial growth does occur for certain sequences of values of N). Using a new construction based on "mixed spreads", all parameter sets with 64 runs are determined. Four of these 64-run orthogonal arrays appear to be new.

AB - If the number of runs in a (mixed-level) orthogonal array of strength 2 is specified, what numbers of levels and factors are possible? The collection of possible sets of parameters for orthogonal arrays with N runs has a natural lattice structure, induced by the "expansive replacement" construction method. In particular the dual atoms in this lattice are the most important parameter sets, since any other parameter set for an N-run orthogonal array can be constructed from them. To get a sense for the number of dual atoms, and to begin to understand the lattice as a function of N, we investigate the height and the size of the lattice. It is shown that the height is at most ⌊c(N-1)⌋, where c = 1.4039..., and that there is an infinite sequence of values of N for which this bound is attained. On the other hand, the number of nodes in the lattice is bounded above by a superpolynomial function of N (and superpolynomial growth does occur for certain sequences of values of N). Using a new construction based on "mixed spreads", all parameter sets with 64 runs are determined. Four of these 64-run orthogonal arrays appear to be new.

KW - Asymmetrical orthogonal array

KW - Expansive replacement method

KW - Geometric orthogonal array

KW - Linear orthogonal array

KW - Linear programming bound

KW - Mixed orthogonal array

KW - Mixed spread

KW - Tight array

UR - http://www.scopus.com/inward/record.url?scp=0036531861&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036531861&partnerID=8YFLogxK

U2 - 10.1016/S0378-3758(01)00119-7

DO - 10.1016/S0378-3758(01)00119-7

M3 - Article

VL - 102

SP - 477

EP - 500

JO - Journal of Statistical Planning and Inference

JF - Journal of Statistical Planning and Inference

SN - 0378-3758

IS - 2

ER -