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, May 30, 2017, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Vytautas Gruslys (University of Cambridge)
Any Tetris tile is a connected subset of $\mathbb{Z}^2$ of size $4$. More generally, we define an $n$-dimensional shape to be any (non-empty) finite subset of $\mathbb{Z}^n$. Does a given shape $T \subset \mathbb{Z}^n$ tile the $n$-dimensional space, meaning that $\mathbb{Z}^n$ can be partitioned into copies of $T$? Of course, some shapes tile $\mathbb{Z}^n$ and some do not. Moreover, some shapes that do not tile $\mathbb{Z}^n$ do tile $\mathbb{Z}^{n+1}$. Chalcraft conjectured that every shape in $\mathbb{Z}^n$ tiles $\mathbb{Z}^d$ for some $d \ge n$. We prove this conjecture and examine related questions regarding posets and the hypercube graph $Q_n$. This talk is based on joint work with Leader, Tan and Tomon.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2025 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