Optimal tiling of the Euclidean space using symmetric bodies
share
What is the least surface area of a symmetric body B whose ℤ^n translations tile ℝ^n? Since any such body must have volume 1, the isoperimetric inequality implies that its surface area must be at least Ω(√(n)). Remarkably, Kindler et al. showed that for general bodies B this is tight, i.e. that there is a tiling body of ℝ^n whose surface area is O(√(n)). In theoretical computer science, the tiling problem is intimately to the study of parallel repetition theorems (which are an important component in PCPs), and more specifically in the question of whether a "strong version" of the parallel repetition theorem holds. Raz showed, using the odd cycle game, that strong parallel repetition fails in general, and subsequently these ideas were used in order to construct non-trivial tilings of ℝ^n. In this paper, motivated by the study of a symmetric parallel repetition, we consider the symmetric variant of the tiling problem in ℝ^n. We show that any symmetric body that tiles ℝ^n must have surface area at least Ω(n/√(log n)), and that this bound is tight, i.e. that there is a symmetric tiling body of ℝ^n with surface area O(n/√(log n)). We also give matching bounds for the value of the symmetric parallel repetition of Raz's odd cycle game. Our result suggests that while strong parallel repetition fails in general, there may be important special cases where it still applies.
READ FULL TEXT
