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, October 08, 2019, 12:15 pm

**Duration**: 30 minutes

**Location**: OAT S15/S16/S17

**Speaker**: István Tomon

The Boolean lattice 2^[n] is the family of subsets of [n]={1,...,n} ordered by inclusion, and a chain in 2^[n] is a family {A_1,...,A_k} such that A_j contains A_i for i < j. By the well known theorem of Sperner (1928), the minimum number of chains 2^[n] can be partitioned into is equal to the number of subsets of [n] of size n/2. However, not much is known about the chain partitions achieving this minimum. Addressing a conjecture of Furedi (1985), we prove that there exists such a chain partition where the sizes of any two chains are within a constant factor, in particular, each chain has size roughly n^1/2. I will talk about how such uniform chain partitions can be used to solve certain extremal and partitioning problems in the Boolean lattice.

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

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