A series of search designs for \(2^ m\) factorial designs of resolution V which permit search of one or two unknown extra three-factor interactions
From MaRDI portal
Publication:1206646
DOI10.1007/BF00048681zbMath0781.62128MaRDI QIDQ1206646
Shinsei Tazawa, Teruhiro Shirakura
Publication date: 1 April 1993
Published in: Annals of the Institute of Statistical Mathematics (Search for Journal in Brave)
main effectsgeneral meantwo-factor interactionsminimum number of treatmentsbalanced arrays of strength 6isomorphic graphnonisomorphic weighted graphsnonnegligible three-factor interactions
Related Items (2)
Enumeration of unlabelled bicolored graphs by degree parities ⋮ Enumeration of connected graphs with cut vertices
Cites Work
- Main effect plus one or two plans for \(2^ m\) factorials
- Search designs for \(2^ m\) factorials derived from balanced arrays of strength \(2(\ell +1)\) and AD-optimal search designs
- Search designs for \(2^ m\) factorial experiments
- Main effect plan for \(2^n\) factorials which allow search and estimation of one unknown effect
- On main effect plus one plans for \(2^ m\) factorials
- On some new search designs for \(2^ m\) factorial experiments
- Balanced arrays of strength 21 and balanced fractional \(2^m\) factorial designs
- Some general existence conditions for balanced arrays of strength \(t\) and 2 symbols
- A bound connected with 26factorial search designs of resolution 3.1
- A necessary condition for the existence of main effect plus one plans for 2mfactorials
- Balanced 2mfactorial designs of resolution v which allow search and estimation of one extra unknown effect, 4 ≤ m ≤ 8
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A series of search designs for \(2^ m\) factorial designs of resolution V which permit search of one or two unknown extra three-factor interactions
