phyllis@utcsrgv.UUCP (Phyllis Eve Bregman) (03/28/84)
[****] UofT Department of Computer Science Seminar Schedule for the week of March 26th, 1984 Friday, March 30th, 2:00 P.M., GB415: Professor A. Lehman, Department of Computer Science, University of Toronto: "The width-length inequality and degenerate projective planes". ABSTRACT: The width-length inequality is defined for arbitrary non-negative weights. It is shown that the inequality holds if and only if it holds for weights restricted to 0 and 1 plus possibly **one** instance of another (specified) integer weight. This integer weight is needed solely to exclude degenerate projective planes. The proof combines counting and linear algebra. The inequality is equivalent to an abstract max-flow min-cut theorem and to a framework for switch-resister network inequalities. There is also an independent but analogous theorem for designs. -- Phyllis Eve Bregman CSRG, Univ. of Toronto {decvax,linus,ihnp4,uw-beaver,allegra,utzoo}!utcsrgv!phyllis CSNET: phyllis@toronto (416) 978 6985