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, June 09, 2015, 12:15 pm

**Duration**: 30 minutes

**Location**: CAB G51

**Speaker**: Jan Hazla

I will present a solution to the following problem:

Let S := {0, 1, 2}^n and let A be a subset of S such that |A| / |S| = mu. Sample a random vector X = (X_1, ..., X_n) uniformly from S. Sample another random vector Y = (Y_1, ..., Y_n) such that for each coordinate i independently Y_i is uniform in { X_i, X_i+1 (mod 3) }.

Show that Pr[ X in A and Y in A] >= f(mu) > 0, i.e., a lower bound that is independent of n.

I will explain the context of the problem and outline techniques needed to solve it.

Joint work with Thomas Holenstein and Elchanan Mossel.

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