Hypercube embedding of Wythoffians

The Wythoff construction takes a d-dimensional polytope P, a subset S of {0, ..., d} and returns another d-dimensional polytope P(S). If P is a regular polytope, then P(S) is vertex-transitive. This construction builds a large part of the Archimedean polytopes and tilings in dimension 3 and 4. We want to determine, which of those Wythoffians P(S) with regular P have their skeleton or dual skeleton isometrically embeddable into the hypercubes H m and half-cubes 1/2 H m . We find six infinite series, which, we conjecture, cover all cases for dimension d > 5 and some sporadic cases in dimension 3 and 4 (see Tables 1 and 2). Three out of those six infinite series are explained by a general result about the embedding of Wythoff construction for Coxeter groups. In the last section, we consider the Euclidean case; also, zonotopality of embeddable P(S) are addressed throughout the text.

[1]  Frank Vallentin.  Optimal distortion embeddings of distance regular graphs into Euclidean spaces , 2008, J. Comb. Theory, Ser. B.

[2]  R. Stanley.  What Is Enumerative Combinatorics , 1986 .

[3]  R. Graham,et al.  On isometric embeddings of graphs , 1985 .

[4]  David Eppstein.  Cubic Partial Cubes from Simplicial Arrangements , 2006, Electron. J. Comb..

[5]  Sergey V. Shpectorov,et al.  On Scale Embeddings of Graphs into Hypercubes , 1993, Eur. J. Comb..

[6]  P. Assouad,et al.  Espaces Métriques Plongeables Dans Un Hypercube: Aspects Combinatoires , 1980 .

[7]  Graham A. Niblo,et al.  Coxeter Groups act on CAT(0) cube complexes , 2003 .

[8]  J. Humphreys.  Reflection groups and coxeter groups , 1990 .

[9]  Michel Deza,et al.  Geometry of cuts and metrics , 2009, Algorithms and combinatorics.

[10]  P. McMullen,et al.  Abstract Regular Polytopes , 2003, Geometric Regular Polytopes.

[11]  Zvi Har'el.  Uniform solution for uniform polyhedra , 1993 .

[12]  Michel Deza,et al.  Zigzag structure of complexes , 2004 .

[13]  George Maxwell.  Wythoff's construction for Coxeter groups , 1989 .

[14]  H. Coxeter.  Wythoff's Construction for Uniform Polytopes , 1935 .

[15]  Jiri Patera,et al.  Voronoi Domains and Dual Cells in the Generalized Kaleidoscope with Applications to Root and Weight Lattices , 1995, Canadian Journal of Mathematics.

[16]  M. Deza,et al.  Recognition of thel1-Graphs with ComplexityO(nm), orFootball in a Hypercube , 1996, Eur. J. Comb..

[17]  Rudolf Scharlau,et al.  Geometrical Realizations of Shadow Geometries , 1990 .