A majorization theorem for the C-matrices of binary designs
type: Item
instance of: scholarly article
title: A majorization theorem for the C-matrices of binary designs
zbMATH Open document ID: 0441.62072
DOI: 10.1016/0378-3758(80)90003-8
author: Alessandra Giovagnoli
author: Henry P. Wynn
published in: Journal of Statistical Planning and Inference
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 62K10
Mathematics Subject Classification ID: 05B05
Mathematics Subject Classification ID: 51E05
zbMATH DE Number: 3688532
zbMATH Keywords: majorization theorem
zbMATH Keywords: C-matrices of binary designs
zbMATH Keywords: Gale-Ryser design
zbMATH Keywords: binary design
zbMATH Keywords: BIBD
zbMATH Keywords: incidence matrix
Wikidata QID: Q61856028
MaRDI profile type: Publication
full work available at URL: 0378-3758(80)90003-8
OpenAlex ID: W2050374035
cites work: Optimality of certain asymmetrical experimental designs
cites work: The efficiency factor of a class of incomplete block designs
cites work: On the theory of connected designs: Characterization and optimality
cites work: A theorem on flows in networks
cites work: On the Nonrandomized Optimality and Randomized Nonoptimality of Symmetrical Designs
cites work: Q4072671
cites work: A Note on Incomplete Block Designs
cites work: Optimal design of complex experiments with qualitative factors of influence
cites work: Bounds for the efficiency factor of block designs
cites work: Inequalities: theory of majorization and its applications
cites work: On a Minimax Property of a Balanced Incomplete Block Design
cites work: Q5556876
cites work: Q3264546
cites work: Combinatorial Properties of Matrices of Zeros and Ones
cites work: Q3851094
cites work: Optimality Criteria for Incomplete Block Designs
cites work: Q3288481
description: scientific article; zbMATH DE number 3688532