Wythoff construction and -embedding

Michel Deza
ENS/CNRS, Paris and ISM, Tokyo

Serguei Shpectorov
Bowling Green State University

Mathieu Dutour-Sikiric
Hebrew University, Jerusalem

p.1/47

I. Wythoff kaleidoscope construction

W.A. Wythoff (1918) and H.S.M. Coxeter (1935)

p.2/47

Polytopes and their faces

A polytope of dimension is dened as the convex hull of a nite set of points in . A valid inequality on a polytope is an inequality of the on with linear. A face of is the set of form on . points satisfying to
  

A face of dimension , , , vertex, edge, ridge and facet.

    

is called, respectively,

  

p.3/47

Face-lattice
There is a natural inclusion relation between faces, which dene a structure of partially ordered set on the set of faces. This dene a lattice structure, i.e. every face is uniquely dened by the set of vertices, contained in it, or by the set of facets, in which it is contained. Given two faces of dimension and , there are exactly two faces of dimension , such . that This is a particular case of the Eulerian property satised by the lattice:
  

Nr. faces of even dimension=Nr. faces of odd dimension

p.4/47

Skeleton of polytope
The skeleton is dened as the graph formed by vertices, with two vertices adjacent if they form an edge. The dual skeleton is dened as the graph formed by facets with two facets adjacent if their intersection is a ridge. In the case of -dimensional polytopes, the skeleton is a planar graph and the dual skeleton is its dual, as a plane graph. Steinitzs theorem: a graph is the skeleton of a -polytope if and only if it is planar and -connected.

p.5/47

Complexes
We will consider mainly polytopes, but the Wythoff construction depends only on combinatorial information. Also not all properties of face-lattice of polytopes are necessary. The construction will apply to complexes: which are partially ordered sets, which have a dimension function associated to its elements. This concerns, in particular, the tilings of Euclidean -space.

p.6/47

Wythoff construction

Take a

-dimensional complex

A ag is a sequence

of faces with

The type of a ag is the sequence



.


Given a non-empty subset of , the , whose Wythoff construction is a complex vertex-set is the set of ags with xed type .
  

The other faces of are expressed in terms of ags of the original complex .

p.7/47

Formalism of faces of Withofan



Set subsets for all

on

and x an . For two , we say that blocks (from ) if, and , there is an with or . This denes a binary relation (i.e. on subsets of ), denoted by .

 

 

Write

, if

and

, and write

if

and


Clearly, is reexive and transitive, i.e. an equivalence. is equivalence class containing .



Minimal elements of equivalence classes are types of ; vertices correspond to type , edges to faces of "next closest" type with , etc.

p.8/47

Example: the case

0,1

, vertices

One type of vertices for

(i.e. type

 

).

 

p.9/47

Example: the case

0,2

, edges

Two types of edges for

and

 

 

p.10/47

Example: the case

, faces

2 0

Two types of faces for

and

 

p.11/47

-dimensional complexes
-dimensional Eulerian complexes are identied with plane graphs. If

is a plane graph set

 


plane graph original map truncated truncated

 

 

 

 

truncated

 

p.12/47

Wythoff on the cube

 

Cube(

)=

p.13/47

Wythoff on the cube



Cube(

)=

p.13/47

Wythoff on the cube



Cube(

)=

 

p.13/47

Wythoff on the cube



Cube(

)=

 

p.13/47

Cube(
 

 

)=

Wythoff on the cube

p.13/47

Wythoff on the cube



Cube(

)=

 

 

p.13/47

Properties of Wythoff construction

If

is a

-dimensional complex, then: . (dual complex).



is median complex.

, where

admits at most different

Wythoff constructions.

if

is self-dual, then it admits at most different Wythoff constructions.



is called order complex. Its skeleton is bipartite and the vertices are full ags. Edges are full ags minus some face. . Flags with faces correspond to faces of dim.
  

p.14/47

II. -embedding

p.15/47

Hypercube and Half-cube

The Hamming distance between two points is = (where denotes : ), i.e. the size of symmetric difference of and .

  

  

The hypercube is the graph with vertex-set and with two vertices adjacent if . The distance is the path-distance on .

The half-cube

is the graph with vertex-set



is even

 

and with two vertices adjacent if . The distance is twice the path-distance on

 

p.16/47

Scale embedding into hypercubes

A scale embedding of a graph into hypercube , such that a vertex mapping

is

 

with

being the path-distance between

and .

An isometric embedding of a graph , such that a mapping

into a graph

Scale embedding is hypercube embedding, scale embedding is half-cube embedding.

is

p.17/47

Examples of half-cube embeddings

34
45

14

3458
4590 34 3489 15 1560 45 34 3489 1267 12 2378 23 1560 15

1458 2367 23 2378 3478 1456

1267 3478 1256 1456 2378 14 1458 2367 12

34 3458 1267

1256

2378 4590

1267

23
23 12

12

Dodecahedron embeds into

Rhombicuboctahedron embeds into (moreover, into : add to vertex-addresses)

 

p.18/47

Johnson and -embedding

the Johnson graph subsets of size of adjacent if .

is the graph formed by all with two subsets and



 

embeds in

, which embeds in

A metric is -embeddable if it embeds isometrically into the metric space for some dimension .

A graph is -embeddable if and only if it is scale embeddable (Assouad-Deza). The scale is or even.

p.19/47

Further examples
145 146 2379 27 3679 67 0 14 1245 46 3467 367 1468 1458 279 259 125 2 2579 467 4

25 1259 7

snub Cube embeds into , but not in any Johnson graph

twisted Rhombicuboctahedron is not -gonal

p.20/47

Hypermetric inequality

If and inequality is

, then the hypermetric

If a metric admits a scale embedding, then the hypermetric inequality is always satised (Deza).

If

, then

is triangular inequality

 

 

 

 

If -gonal inequality.

, then

 

 

 

 

 

 

is called the

p.21/47

Embedding of graphs
The problem of testing scale embedding for general metric spaces is NP-hard (Karzanov). Theorem(Jukovic-Avis): a graph embeds into and only if: is bipartite and satises the -gonal inequality.

if

In particular, testing embedding of a graph polynomial.

into

is

The problem of testing scale embedding of graphs into is also polynomial problem (Deza-Shpectorov).

p.22/47

III. -embedding

of Wythoff construction

p.23/47

Regular (convex) polytopes

A regular polytope is a polytope, whose symmetry group acts transitively on its set of ags. The list consists of: regular polytope group regular polygon Icosahedron and Dodecahedron -cell and -cell -cell (hypercube) and (cross-polytope) (simplex) =

There are regular tilings of Euclidean plane:

, and an innity of regular tilings

of hyperbolic plane.

Here

is shortened notation for





and

p.24/47

2-dim. regular tilings and honeycombs

Columns and rows indicate vertex gures and facets, resp. Blue are elliptic (spheric), red are parabolic (Euclidean). 2 2 3 4 5 6 7 m

3 23


4 24


5 25 Ico 45 55 65 75 m5

6 26

7 27 37 47 57 67 77 m7

m 2m 3m 4m 5m 6m 7m mm

22 32 42 52 62 72 m2

Do 63 73 m3

54 64 74 m4

46 56 66 76 m6

p.25/47

All above tilings embed, since it holds:

Hyperbolic tiling

(i.e.

) embeds (for is even or and





into

if

is odd and into

if

. embed

Euclidean (parabolic, i.e. and into embeds into and for

, resp. Spheric (elliptic, i.e. ) for any , spheric embeds into even and odd, respectively.

, , , ; Icosahedron and Dodecahedron embed into , respectively. and embed into and , respectively.

 

p.26/47

3-dim. regular tilings and honeycombs

Do


Ico 600-

63

36 336

24435* 353 120443* 534 535

 

344 436*

Ico Do

536 444* 363

36 63 633* 634*

635*

636*

All emb. ones with

are, besides , or


and ,


: all

bipartite ones (i.e. with cell hyperbolic tilings with



):

and

 

. Last 11 embed into

p.27/47

4-dim. regular tilings and honeycombs

24

120-

600

24600120

 

5333

5334

5335


Tilings 4335 and (non-compact) 4343 of hyperbolic -space . embed into

p.28/47

5-dim. regular tilings and honeycombs

33343

33433 34333 43343* , and



34334 embed into , , ) , respectively.

Four innite series , and (with scale



for

Existence of Hadamard matrices and nite projective planes have equivalents in terms of variety of embed. of and .

 

p.29/47

Archimedean polytopes
An Archimedean -polytope is a -polytope, whose symmetry group acts transitively on its set of vertices -polytopes. and whose facets are Archimedean

They are classied in dimension (Kepler: (regular)+ + + ) and (Conway and Guy).

If is a regular polytope, then polytope.

is an Archimedean

We also will consider Wythofans

, where

is an in-

nite regular polytope, i.e. a regular tiling of Euclidean plane, -space, etc.

p.30/47

Embeddable Arch. Wythofans for

Embeddable Wythofan n

embedding

Tetrahedron Cube

4 6 8 12 20

Icosahedron

 

Dodecahedron tr Cuboctahedron

48 120 24

tr Icosidodecahedron

 

Rhombicosidodecahedron

60

(tr Tetrahedron)

!

 

Rhombicuboctahedron

 

 

 

 

 

Octahedron

p.31/47

Embeddable Wythofan (tr Icosahedron) (tr Cube) (Cuboctahedron) tr Octahedron

embedding

 

32 14 32 14 32

 

   

 

(tr Dodecahedron)

   

(Icosidodecahedron)

 

24

Remaining semi-regular polyhedra: snub Cube, snub Dodecahedron, -prisms and -antiprisms for any They embed into for , resp.

Moreover, for even

-prism embeds into

-antiprism embeds into

and

p.32/47

Embeddable Wythofan

 

8 5

1152

192

384

120

10

64

30

16

Embeddable Arch. Wythofans for

14400

 
p.33/47



 

 

embedding

First general results

We say that a complex embeds into (and denote it by ) if its skeleton embeds into hypercube .

1 Trivial: graph

is the hypercube

. embeds in

with scale

2 Easy: if

, then

is

 

 

3 Theorem: is with two antipodal vertices removed. It embeds into . It is the zonotopal Voronoi polytope of the root lattice . Moreover, the tiling embeds into .

 

p.34/47

Embedding of Arch. order complexes

4 Theorem:

embeds into

 

It is the zonotopal Voronoi polytope (called permutahedron) of the dual root lattice .

Moreover,

embeds into

5 Theorem: embeds into . It is a zonotope, but not the Voronoi polytope of a lattice.

 

6 Computations: embeddings of the skeletons, of into and of into , were found by computer.

 

 

 

  

So (since

embeds into

), all Arch. order

 

 

complexes embed into an

(moreover, are zonotopes).

p.35/47

Other Wythoff Arch. embeddings

7 Theorem: It is a zonotope, but for of a lattice.

embeds into . it is not a Voronoi polytope

 

8 Theorem: is an -graph for all . But for , it does not embed into a , i.e. embeds with some even scale . into an

 

Conjecture: If is the skeleton of the Wythofan or of its dual, where is a regular polytope, and embeds into a , then belongs to either above Tables for dimension , , or to one of above innite series.

p.36/47

IV. Some extensions of Wythoff construction and embedding

p.37/47

Cayley graph construction

If a group is generated by ,. . . , , then its Cayley graph is the graph with vertex-set and edge-set

for

and

is vertex-transitive; its path-distance is length of

If is a regular -polytope, then its symmetry group is a Coxeter group with canonical generators ,. . . , and its order complex is:

 

 

Problem: Do embeds into an (moreover, a zonotope) for any nite Coxeter group ? We got "yes" for , , , , , (regular polytopes). The problem is open for , , , .

 

p.38/47

Embeddings for tilings

has the natural -metric

. by

is embeddable into

-dimensional hypercube
        

Any graph (possibly, innite), which embeds into . embeddable into

, is

The hypermetric (including -gonal) inequality is again a necessary condition. For skeletons of innite tilings, we consider (up to a , . scale) embedding into

There are 3 regular and 8 Archimedean (i.e. semi-regular) tilings of Euclidean plane.

p.39/47

= =


=
  

Three regular plane tilings

=
! #" $ % $ ( ) & '



=
   

p.40/47

Eight Archimedean plane tilings

dual

 

 




 

= dual

 

 

p.41/47

      

Eight Archimedean plane tilings

=
                   

p.41/47

Mosaics

and

embed into

p.42/47

  

Other semi-regular plane tilings:

Emb. Wythofans of reg. plane tilings

see scale
        

  

 

    

                           

   

 

 

   

embedding of
        

Wythofan


    

 

  

       

and

 

         

embedding

into .
p.43/47

Wythofans of reg. -space tilings

Wythofan
   

Nr. 1 2 16 9
1

embbedding?


 

 

=zeolit Linde
#

 

 

 

 

=zeolit
& % $

"

 

 

 

8 7 18 23

non 5-gonal non 5-gonal non 5-gonal non 5-gonal

(

=boride
 

"

"

'

3 42

)0

 

 

 

 

There are 28 vertex-transitive tilings of -space by regular and semi-regular polyhedra (Andreini, Johnson, Grunbaum, DezaShtogrin).

 

!

!

p.44/47

Exp.: not 5-gonal

Nr. 7 (of 28), tiled 1:4 by

and tr.

; boride

p.45/47

Exp.: not 5-gonal

Nr. 18 (of 28), tiled 2:1:2 by

and

p.46/47

 

 

   
$ $

    
$ $

    
$



Some Wyth. of reg. -space tilings,

Remind that
 $

 !
 

   %
$

=tr

=tr

Wythofan

  

Conjecture (holds for and

 

  $



 

 

):


 

 


,
% 

, tr


tiles

, tr

' (% ' %(

embeds into
 "

' %(

embed into .


embbedding?

non 5-gonal

non 5-gonal

non 5-gonal

non 5-gonal

.
 

p.47/47