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

DOI10.1007/BF00048681MaRDI QIDQ1206646zbMATH OpenFDO

Authors Teruhiro Shirakura, Shinsei Tazawa

Publication date 1 April 1993

Published in Annals of the Institute of Statistical Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00048681

zbMATH Keywords

balanced arrays of strength 6general meanisomorphic graphmain effectsminimum number of treatmentsnonisomorphic weighted graphsnonnegligible three-factor interactionstwo-factor interactions

Mathematics Subject Classification ID

Applications of graph theory (05C90) Factorial statistical designs (62K15)

Recommendations

• scientific article; zbMATH DE number 4030758
• scientific article; zbMATH DE number 222432
• scientific article; zbMATH DE number 933187
• \(2^{n-m}\) designs with resolution III or IV containing clear two-factor interactions
• Search designs for 2^ m factorial experiments
• Search designs for searching for one among the two- and three-factor interaction effects in the general symmetric and asymmetric factorials

Cites work

• A bound connected with 2⁶factorial search designs of resolution 3.1
• A necessary condition for the existence of main effect plus one plans for 2^mfactorials
• Balanced 2^mfactorial designs of resolution v which allow search and estimation of one extra unknown effect, 4 ≤ m ≤ 8
• Balanced arrays of strength 21 and balanced fractional 2ᵐ factorial designs
• scientific article; zbMATH DE number 4068908 (Why is no real title available?)
• scientific article; zbMATH DE number 3612277 (Why is no real title available?)
• scientific article; zbMATH DE number 3637156 (Why is no real title available?)
• scientific article; zbMATH DE number 221922 (Why is no real title available?)
• Main effect plan for 2ⁿ factorials which allow search and estimation of one unknown effect
• Main effect plus one or two plans for \(2^ m\) factorials
• On main effect plus one plans for 2^ m factorials
• On some new search designs for \(2^ m\) factorial experiments
• Search designs for 2^ m factorial experiments
• Search designs for 2^ m factorials derived from balanced arrays of strength 2( +1) and AD-optimal search designs
• Some general existence conditions for balanced arrays of strength \(t\) and 2 symbols

Cited in

(10)

• Search designs for 2^ m factorials derived from balanced arrays of strength 2( +1) and AD-optimal search designs
• An infinite series of resolution III.2 designs for the \(2^ m\) factorial experiment
• Enumeration of unlabelled bicolored graphs by degree parities
• scientific article; zbMATH DE number 4030758 (Why is no real title available?)
• scientific article; zbMATH DE number 1304751 (Why is no real title available?)
• scientific article; zbMATH DE number 221922 (Why is no real title available?)
• scientific article; zbMATH DE number 933187 (Why is no real title available?)
• scientific article; zbMATH DE number 933188 (Why is no real title available?)
• scientific article; zbMATH DE number 222432 (Why is no real title available?)
• Enumeration of connected graphs with cut vertices

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1206646)