BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:The Specification of Robust Binary Block Designs Against the Loss 
 of Whole Blocks - Godolphin\, J (Surrey)
DTSTART:20110902T083000Z
DTEND:20110902T090000Z
UID:TALK32621@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:A new criterion is suggested for measuring the robustness of a
  binary block design D against the loss of whole blocks\, which is based o
 n the concept of rectangle concurrencies.\n\nThis criterion is superior to
  the notion of minimal concurrence that has been employed previously and i
 t enables improved conditions for classifying the robustness status of D t
 o be derived.\n\nIt is shown that several classes of binary block designs\
 , with the positive feature of possessing either partial balance or near b
 alance\, are maximally robust\; thus expanding a classic result in the lit
 erature\, known as Ghosh's theorem\, that confines this status to balanced
  designs.\n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR