Mixed orthogonal arrays, (u,m, e,s)-nets, and (u, e,s)-sequences

Abstract

We study the classes of (u,m, e,s)-nets and (u, e,s)-sequences, which are generalizations of (u,m,s)-nets and (u,s)-sequences, respectively. We show equivalence results that link the existence of (u,m, e,s)-nets and so-called mixed (ordered) orthogonal arrays, thereby generalizing earlier results by Lawrence, and Mullen and Schmid. We use this combinatorial equivalence principle to obtain new results on the possible parameter configurations of (u,m, e,s)-nets and (u, e,s)-sequences, which generalize in particular a result of Martin and Stinson.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…