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

Date and Time: Tuesday, March 21, 2017, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Torsten Mütze (TU Berlin)

Trimming and gluing Gray codes

We consider the algorithmic problem of generating each subset of $[n]:=\{1,2,...,n\}$ whose size is in some interval $[a,b]$, $0\leq a\leq b\leq n$, exactly once (cyclically) by repeatedly adding or removing a single element, or by exchanging a single element. For $a=0$ and $b=n$ this is the classical problem of generating all $2^n$ subsets of $[n]$ by element additions/removals, and for $a=b$ this is the classical problem of generating all $\binom{n}{a}$ subsets of $[n]$ by element exchanges. In graph theoretical terms, we ask for the existence of (almost) Hamilton cycles in the subgraph of the $n$-dimensional cube $Q_n$ induced by all levels $[a,b]$. We prove the existence of such cycles for a large range of values $n$, $a$, and $b$, and provide corresponding optimal generation algorithms, improving upon and generalizing several previous results. This is joint work with Petr Gregor (Charles University).

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