skip to content
 

The Specification of Robust Binary Block Designs Against the Loss of Whole Blocks

Presented by: 
J Godolphin [Surrey]
Date: 
Friday 2nd September 2011 - 09:30 to 10:00
Venue: 
INI Seminar Room 1
Session Title: 
Factorial Designs and Blocking
Session Chair: 
Peter Goos
Abstract: 
A new criterion is suggested for measuring the robustness of a binary block design D against the loss of whole blocks, which is based on the concept of rectangle concurrencies.

This criterion is superior to the notion of minimal concurrence that has been employed previously and it enables improved conditions for classifying the robustness status of D to be derived.

It is shown that several classes of binary block designs, with the positive feature of possessing either partial balance or near balance, are maximally robust; thus expanding a classic result in the literature, known as Ghosh's theorem, that confines this status to balanced designs.

The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
Presentation Material: 
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons