| 作成者 |
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 号 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| Crossref DOI |
|
| 関連DOI |
|
|
|
| 関連URI |
|
|
|
| 関連情報 |
|
|
|
| 概要 |
Balanced arrays of strength $ t $ in $ N $ assemblies with $ m $ constraints and $ s $ symbols are useful in the construction of fractional factorial designs and to various combinatorial areas of desi...gn of experiments. To construct such arrays with the maximum possible number, $ m $, of constraints is a very important problem both in the statistical design of experiments and combinatorial mathematics. In this note, balanced arrays satisfying a bound $ m leqq N $ are completely characterized.続きを見る
|