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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, October 27, 2009, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

Speaker: Torsten Mütze

The Search for Simple Symmetric Venn Diagrams

Venn diagrams are named after the British logician and philosopher John Venn (1834-1923) who introduced them as a tool in representing "propositions and reasonings". The Venn diagrams we usually encounter consist of exactly three circles and represent all 2^3=8 intersections of three sets. While it is straightforward to show that Venn diagrams can be drawn for any number n of sets (not using circles, though), the additional requirement that the resulting diagram has n-fold rotational symmetry (like the diagram consisting of three circles), makes the question of existence considerably more difficult. In this talk we discuss the breakthrough result of Griggs, Killian, Savage from 2004 who showed that there is a symmetric n-Venn diagram if and only if n is prime.

Talk mainly based on Jerrold Griggs, Charles E. Killian, and Carla D. Savage. Venn diagrams and symmetric chain decompositions in the Boolean lattice. Electron. J. Combin., 11:Research Paper 2, 30 pp. (electronic), 2004.

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

Previous talks by year:   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