Permutation groups and integer linear algebra for enumeration of orthogonal arrays
In this article, the author uses symmetry and integer linear algebra to produce a new framework for enumerating and constructing mixed orthogonal arrays. While these methods are applicable to a wide variety of OA's, the authors focus their attention on OA's of strength 3. All orthogonal arrays of strength 3 with run size at most 64 are constructed in [\textit{A. E. Brouwer} et al., J. Stat. Plann. Inference 136, No. 9, 3268--3280 (2006; Zbl 1097.62067)]. In this paper, those results are extended to run sizes of at most 100. Specifically, the author finds several new non-isomorphic OA's of strength 3 and run size 96.
- Algebraic methods for construction of mixed orthogonal arrays
- Classification of orthogonal arrays by integer programming
- Some new constructions of strength 3 mixed orthogonal arrays
- On construction of some new symmetric and asymmetric orthogonal arrays
- Construction and nonparametric testing of orthogonal arrays through algebraic strata and inequivalent permutation matrices
- Classification of orthogonal arrays by integer programming
- The LP relaxation orthogonal array polytope and its permutation symmetries
- Construction and nonparametric testing of orthogonal arrays through algebraic strata and inequivalent permutation matrices
- scientific article; zbMATH DE number 5163456 (Why is no real title available?)
- Integer programming for classifying orthogonal arrays
- The linear programming relaxation permutation symmetry group of an orthogonal array defining integer linear program
This page was built for publication: Permutation groups and integer linear algebra for enumeration of orthogonal arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2923099)
