Construction of 2ᵐ - (m - k)_III designs with the maximum number of clear two-factor interactions

DOI10.1007/S10255-006-0354-ZzbMATH Open1106.62088OpenAlexW2048899395MaRDI QIDQ871675FDOQ871675

Authors: Gui-Jun Yang 

Publication date: 20 March 2007

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-006-0354-z

Recommendations

• An approach for constructing some \(2^{m- (m-k)}_{III}\) designs with the maximum number of clear two-factor interactions
• On \(2_{\mathrm{IV}}^{m-p}\) designs containing the maximum number of clear two-factor interactions
• A note on \(2_{\mathrm{IV}}^{m-p}\) designs with the maximum number of clear two-factor interactions
• A Note on the Lower Bounds on Maximum Number of Clear Two-Factor Interactions for (2^m−p_III) and (2^m−p_IV) Designs
• Bounds on the maximum number of clear two-factor interactions for 2m-pdesigns of resolution III and IV

zbMATH Keywords

resolutionminimum aberrationclear two-factor interactions

Mathematics Subject Classification ID

Optimal statistical designs (62K05) Factorial statistical designs (62K15)

Cites Work

• Title not available (Why is that?)
• Minimum Aberration 2 k-p Designs
• A Catalogue of Two-Level and Three-Level Fractional Factorial Designs with Small Runs
• \(2^{n-m}\) designs with resolution III or IV containing clear two-factor interactions
• Bounds on the maximum number of clear two-factor interactions for 2m-pdesigns of resolution III and IV
• Capacity considerations for two-level fractional factorial designs

Cited In (4)

• Grid representations for \(2^{m-(m-k)}_{\text{IV}}\) join designs containing maximum number of clear two-factor interactions
• An approach for constructing some \(2^{m- (m-k)}_{III}\) designs with the maximum number of clear two-factor interactions
• A note on \(2_{\mathrm{IV}}^{m-p}\) designs with the maximum number of clear two-factor interactions
• On \(2_{\mathrm{IV}}^{m-p}\) designs containing the maximum number of clear two-factor interactions

This page was built for publication: Construction of \(2^{m - (m - k)}_{\text{III}}\) designs with the maximum number of clear two-factor interactions

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