Spherical cubes

Foam problems are about how to best partition space into bubbles of minimal surface area. We investigate the case where one unit-volume bubble is required to tile d-dimensional space in a periodic fashion according to the standard, cubical lattice. While a cube requires surface area 2d, we construct such a bubble having surface area very close to that of a sphere; that is, proportional to √d (the minimum possible even without the constraint of being periodic). Our method for constructing this "spherical cube" is inspired by foundational questions in the theory of computation related to the concept of hardness amplification. Our methods give new algorithms for "coordinated discretization" of high-dimensional data points, which have near-optimal noise resistance. We also provide the most efficient known cubical foam in three dimensions.

[1]  Thomas Holenstein.  Parallel Repetition: Simplification and the No-Signaling Case , 2009, Theory Comput..

[2]  J. Kasper,et al.  COMPLEX ALLOY STRUCTURES REGARDED AS SPHERE PACKINGS. I. DEFINITIONS AND BASIC PRINCIPLES , 1958 .

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

[4]  James R. Lee,et al.  Extending Lipschitz functions via random metric partitions , 2005 .

[5]  Aristides A. G. Requicha,et al.  Mathematical Foundations of Constructive Solid Geometry: General Topology of Closed Regular Sets , 1978 .

[6]  Guy Kindler,et al.  Spherical Cubes and Rounding in High Dimensions , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[7]  Philip Ball.  Science in culture: Beijing bubbles , 2007, Nature.

[8]  E. Bierstone,et al.  Semianalytic and subanalytic sets , 1988 .

[9]  Assaf Naor,et al.  Rigorous location of phase transitions in hard optimization problems , 2005, Nature.

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

[11]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

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

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

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

[15]  Sanjeev Arora,et al.  Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.

[16]  Ran Raz,et al.  A Counterexample to Strong Parallel Repetition , 2008, FOCS.

[17]  Ran Raz.  A Parallel Repetition Theorem , 1998, SIAM J. Comput..

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

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

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

[21]  T. Hales.  The Kepler conjecture , 1998, math/9811078.

[22]  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).

[23]  R. Landel,et al.  Mechanical Properties of Polymers and Composites , 1993 .

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

[25]  W N Arnold,et al.  Permeability of the Cell Envelope and Osmotic Behavior in Saccharomyces cerevisiae , 1977, Journal of bacteriology.

[26]  D. Weaire,et al.  A counter-example to Kelvin's conjecture on minimal surfaces , 1994 .

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

[28]  Thomas C. Hales,et al.  The Honeycomb Conjecture , 1999, Discret. Comput. Geom..

[29]  Kenneth A. Brakke,et al.  The Surface Evolver , 1992, Exp. Math..

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