A majorization theorem for the C-matrices of binary designs

DOI10.1016/0378-3758(80)90003-8zbMath0441.62072OpenAlexW2050374035WikidataQ61856028 ScholiaQ61856028MaRDI QIDQ1143105

Henry P. Wynn, Alessandra Giovagnoli

Publication date: 1980

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0378-3758(80)90003-8

zbMATH Keywords

incidence matrixBIBDmajorization theorembinary designC-matrices of binary designsGale-Ryser design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Statistical block designs (62K10) General block designs in finite geometry (51E05)

Related Items (2)

Group invariant orderings and experimental designs ⋮ Existence and constructions of connected block designs with given vectors of treatment replications and block sizes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theorem on flows in networks
• On the theory of connected designs: Characterization and optimality
• Optimality of certain asymmetrical experimental designs
• Combinatorial Properties of Matrices of Zeros and Ones
• A Note on Incomplete Block Designs
• On the Nonrandomized Optimality and Randomized Nonoptimality of Symmetrical Designs
• Optimality Criteria for Incomplete Block Designs
• On a Minimax Property of a Balanced Incomplete Block Design
• The efficiency factor of a class of incomplete block designs
• Bounds for the efficiency factor of block designs
• Optimal design of complex experiments with qualitative factors of influence
• Inequalities: theory of majorization and its applications

This page was built for publication: A majorization theorem for the C-matrices of binary designs