Spherical Cubes and Rounding in High Dimensions

What is the least surface area of a shape that tiles Ropfd under translations by Zopfd? Any such shape must have volume 1 and hence surface area at least that of the volume-1 ball, namely Omega(radicd). Our main result is a construction with surface area O(radicd), matching the lower bound up to a constant factor of 2radic2pi/eap3. The best previous tile known was only slightly better than the cube, having surface area on the order of d. We generalize this to give a construction that tiles Ropfd by translations of any full rank discrete lattice Lambda with surface area 2piparV-1parfb, where V is the matrix of basis vectors of Lambda, and par.parfb denotes the Frobenius norm. We show that our bounds are optimal within constant factors for rectangular lattices. Our proof is via a random tessellation process, following recent ideas of Raz in the discrete setting. Our construction gives an almost optimal noise-resistant rounding scheme to round points in Ropfd to rectangular lattice points.

[1]  Jaigyoung Choe,et al.  On the existence and regularity of fundamental domains with least boundary area , 1989 .

[2]  John M. Sullivan,et al.  Comparing the Weaire-phelan Equal-volume Foam To , 1996 .

[3]  Rob Kusner,et al.  Compering the Weaire-Phelan Equal-Volume Foam to Kelvin's Foam , 1997 .

[4]  Ryan O'Donnell,et al.  Understanding Parallel Repetition Requires Understanding Foams , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

[5]  N. Alon,et al.  ECONOMICAL TORIC SPINES VIA CHEEGER'S INEQUALITY , 2008, 0809.3169.

[6]  Anup Rao,et al.  Parallel repetition in projection games and a concentration bound , 2008, SIAM J. Comput..

[7]  William Thomson.  On the division of space with minimum partitional area , 1887 .

[8]  J. Møller,et al.  Random Johnson-Mehl tessellations , 1992, Advances in Applied Probability.

[9]  Sudipto Guha,et al.  Approximating a finite metric by a small number of tree metrics , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[10]  N. Rivier,et al.  Foams and emulsions , 1999 .

[11]  S. W. Thomson.  LXIII. On the division of space with minimum partitional area , 1887 .

[12]  U. Feige.  Error reduction by parallel repetition-the state of the art , 1995 .

[13]  Thomas Holenstein,et al.  Parallel repetition: simplifications and the no-signaling case , 2007, STOC '07.

[14]  L. Santaló.  Integral geometry and geometric probability , 1976 .

[15]  Ran Raz,et al.  A Counterexample to Strong Parallel Repetition , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[16]  D. L. Weaire.  The Kelvin problem : foam structures of minimal surface area , 1996 .

[17]  G. Butler,et al.  Simultaneous Packing and Covering in Euclidean Space , 1972 .