On the maximal number of factors and the enumeration of 3-symbol orthogonal arrays of strength 3 and index 2
type: Item
instance of: scholarly article
title: On the maximal number of factors and the enumeration of 3-symbol orthogonal arrays of strength 3 and index 2
zbMATH Open document ID: 0897.05013
DOI: 10.1016/S0378-3758(96)00059-6
author: A. S. Hedayat
author: Esther Seiden
author: John Stufken
published in: Journal of Statistical Planning and Inference
publication date: 1998-10-05T00:00:00Z
review text: An \(s\)-symbol orthogonal array of strength \(t,\) index \(\lambda\) and \(k\) factors is a \((k,\lambda s^t)\)-matrix with entries from an \(s\)-element set such that any \(t\) rows contain each \(t\)-tuple of entries exactly \(\lambda\) times. Denote this structure by \(\text{OA}_{\lambda}(t,k,s)\). The paper presents purely combinatorial proofs of the following facts: (1) There are exactly four essentially different \(\text{OA}_2(3,5,3)\). (2) There is no \(\text{OA}_2(3,6,3)\). (3) There is exactly one \(\text{OA}_3(2,5,2)\) without a repeated column.
Mathematics Subject Classification ID: 05B15
Mathematics Subject Classification ID: 62K15
zbMATH DE Number: 1040400
zbMATH Keywords: orthogonal arrays
zbMATH Keywords: fractional factorial designs
reviewed by: Jürgen Bierbrauer
MaRDI profile type: Publication
cites work: Orthogonal Arrays of Strength two and three
cites work: A linear programming bound for orthogonal arrays with mixed levels
cites work: Q5787292
full work available at URL: s0378-3758(96)00059-6
OpenAlex ID: W2072238406
description: scientific article; zbMATH DE number 1040400