It is well-known that all orthogonal arrays of the form OANY t 1Y 2Y t are decomposable into ! orthogonal arrays of strength t and index 1. While the same is not generally true when s 3, we will show that all simple orthogonal arrays of the form OANY t 1Y 3Y t are also decomposable into orthogonal a
On the maximal number of factors and the enumeration of 3-symbol orthogonal arrays of strength 3 and index 2
β Scribed by A. Hedayat; Esther Seiden; John Stufken
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 994 KB
- Volume
- 58
- Category
- Article
- ISSN
- 0378-3758
No coin nor oath required. For personal study only.
β¦ Synopsis
We show that an orthogonal array for three symbols, of strength 3 and of index 2 can accommodate no more than five factors. We also show that there are exactly four nonisomorphic arrays with five factors.
π SIMILAR VOLUMES
## Abstract Let__p__ > __q__ > 1 be two coprime integers. In this paper, we prove several results about subsets of the interval [0, 1) which does or does not contain all the fractional parts {__ΞΎ__ (__p__ /__q__)^__n__^ }, __n__ = 0, 1, 2, β¦, for certain nonβzero real number __ΞΎ__. We show, for ins
Let 9 denote the family of simple undirected graphs on u vertices having e edges ( ( u , el-graphs) and P(A, G ) be the chromatic polynomial of a graph G. For the given integers u, e, A, let f b , e, A) denote the greatest number of proper colorings in A or less colors that a (u, e)-graph G can have
The purpose of this paper is to investigate the effects of Cr203, Cu(OH) 2, ZnO or PbO on the hydration of C3A and characterization of its hydrates. C3A pastes adding the above compound were examined on the basis of the hydration products and their structure, compressive strength and rate of early h