Mixed orthogonal arrays, $(u,m,{\bf e},s)$-nets, and $(u,{\bf e},s)$-sequences
Combinatorics
2015-07-01 v1 Number Theory
Abstract
We study the classes of -nets and -sequences, which are generalizations of -nets and -sequences, respectively. We show equivalence results that link the existence of -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 -nets and -sequences, which generalize in particular a result of Martin and Stinson.
Cite
@article{arxiv.1506.09069,
title = {Mixed orthogonal arrays, $(u,m,{\bf e},s)$-nets, and $(u,{\bf e},s)$-sequences},
author = {Peter Kritzer and Harald Niederreiter},
journal= {arXiv preprint arXiv:1506.09069},
year = {2015}
}