Tiling n-space by unit cubes and error-correcting codes,   Peter Horak,   University of Washington at Tacoma,  Wed, 27 October, 2010,   10:00 a.m. C-202


Tiling problems belong to the oldest problems in whole Mathematics. They attracted attention of many famous mathematicians. Even one of the Hilbert's problems is devoted to the topic. The interest in tilings by unit cubes originated with a conjecture raised by Minkowski in 1907. In this lecture we will discuss the conjecture, and other closely related problems, especially its relation to Lee error-correcting codes.