On the maximum number of constraints for s-symbol balanced arrays of strength t

DOI10.1080/03610928508829054zbMath0594.62088OpenAlexW2074005958MaRDI QIDQ3725385

Sumiyasu Yamamoto, Masahide Kuwada, Fuzhi Yuan

Publication date: 1985

Published in: Communications in Statistics - Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03610928508829054

zbMATH Keywords

upper boundsconstraintsbalanced fractional factorial designss- symbol balanced arrays of strength t

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Factorial statistical designs (62K15)

Related Items (5)

An extension method for balanced arrays ⋮ Bounds on the number of constraints for balanced arrays of strength t ⋮ On existence and construction of balanced arrays ⋮ Characterization of singular balanced fractional s^mfactorial designs derivable from balanced arrays with maximum number of constraints ⋮ On arrays with some combinatorial structure

Cites Work

• Balanced arrays of strength 4 and balanced fractional \(3^m\) factorial designs
• Characteristic polynomials of the information matrices of balanced fractional \(3^ m\) factorial designs of resolution V
• Contributions to the theory and construction of balanced arrays
• Note on balanced fractional \(2^m\) factorial designs of resolution \(2l+1\)
• Balanced arrays of strength 21 and balanced fractional \(2^m\) factorial designs
• A note on an upper bound for the constraints of balancedarrays with strength t
• On the Characteristic Roots of the Information Matrix of $2^m$ Balanced Factorial Designs of Resolution V, with Applications

This page was built for publication: On the maximum number of constraints for s-symbol balanced arrays of strength t