Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Tuesday, September 30, 2014, 12:15 pm

**Duration**: 30 minutes

**Location**: CAB G51

**Speaker**: Pedro Vieira

A classic theorem in combinatorial design theory is Fisher's inequality, which states that a family $F$ of subsets of $\{1,2,...,n\}$ with all pairwise intersections of size $\lambda$ can have at most $n$ non-empty sets. One may weaken the condition by requiring that for every set in $F$, all but at most $k$ of its pairwise intersections have size $\lambda$. We call such families $(k,\lambda)$-Fisher. Vu was the first to study the maximum size of such families, proving that for $k = 1$ the largest family has $2n−2$ sets, and characterizing when equality is attained. In this talk we present a refined version of these results, showing how the size of the maximum family depends on the parameter $\lambda$. In particular we show that for small $\lambda$ one essentially recovers Fisher's bound. We also solve the next open case of $k = 2$ and obtain the first non-trivial upper bound for general $k$.

Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)

Previous talks by year: 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M | admin login