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

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, November 01, 2016, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Pedro Vieira

Eventowns for multiple intersections

A family A of subsets of an n-element set is called an eventown (resp. oddtown) if all its sets have even (resp. odd) size and all pairwise intersections have even size. Using tools from linear algebra, it was shown by Berlekamp and Graver that the maximum size of an eventown is 2^{n/2}. On the other hand (somewhat surprisingly), it turns out that oddtowns have size at most n. Over the last four decades, many extensions of this even/oddtown problem have been studied. In this talk we will discuss the extension of this problem to multiple intersections. Extending a result of Vu, we'll show that a k-wise eventown (i.e., intersections of k sets are even) has for k>=3 a unique extremal configuration. In addition, we'll show that a stability result holds for this problem, meaning that all "nearly extremal" families have a very specific structure. Joint work with Benny Sudakov.

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

Previous talks by year:   2024  2023  2022  2021  2020  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