**Peter Mani** (a photograph by Emo Welzl)

## Simple polytopes, puzzles

Micha A. Perles conjectured in the ’70s that the graph of a simple -polytope determines the entire combinatorial structure of the polytope. This conjecture was proved in 1987 by Blind and Mani and shortly afterwards I gave a simple proof which I like very much to present.

Let and be two simple d-dimensional polytopes. Let be a bijection from the vertices of to the vertices of which maps edges to edges. In other words, is an isomorphism between the graph of to the graph of . Does extend uniquely to a combinatorial isomorphism between and ? The answer is ‘yes’ but the argument is not so easy. There are also several related open problems.

**Eric Friedman**

A quick reminder about simple polytopes. A -polytope is simple if every vertex of is contained in edges. (Equivalently, if the dual polytope is simplicial.) Thus the graph of a simple -polytope is a -regular graph. The crucial property of simple polytopes that we use is that for every vertex of and every collection of edges of containing there is a unique -face of P which contains and these edges.

Among the famous simple polytopes are the cubes and simplices (in any dimension), polygons in the plane, and the dodecahedron in dimension 3 (but not the icosahedron or octahedron).

More background on polytopes can be found at the end of the post. (It is taken from this post presenting five open problems regarding polytopes.).

## Good orderings, unique sink acyclic orientations, and shelling.

Consider a total ordering of the vertices of a simple -polytope . A vertex is a local maximum if for every neighbor of , . Of course, the maximum vertex in with respect to the ordering is a local maximum. An ordering of the vertices of is called **good**, if for every face of every local maximum in is the global maximum in .

( Just to make it clear: a vertex in is a local maximum in , if for every neighbor of in , . The global maximum in is the maximum vertex of with respect to .)

There are several variations of this notion. Instead of talking about the entire ordering we can talk just about the orientation it induces on edges of the graph. We orient an edge from to if . This is an acyclic orientation of the graph and being good or bad depends only on the orientation. Good orientations are called “unique-sink acyclic orientations”. Also, as we will mention later, good orderings of the vertices of a simple polytope are closely connected to shelling order on the facets of the dual polytope.

## The proof: part I

Let be the graph of a simple -polytope .

### The crucial claim

Given an ordering of the vertices of the polytope we define the degree of a vertex , denoted by as the number of neighbors of which are smaller than with respect to the ordering. Let be the number of vertices of degree . Consider the following expression:

.

Let be the number of nonempty faces of .

**Claim: ** 1)

2) Equality holds if and only if is a good ordering.

**Proof: **Let be an ordering of the vertices of . We will count pairs where is a face of and is a vertex in which is a **local maximum** with respect to .

The first thing to note is that if is a vertex of degree then it is a local maximum in precisely faces. Therefore the number of pairs is precisely .

On the other hand, every face of the polytope has a vertex which is a local maximum with respect to . This is the vertex of which is the **global maximum**! If is a good ordering then every face contributes a unique vertex which is a local maximum and therefore . If is not a good ordering then every face contributes at least one local maximum and at least one face contributes more than one! Therefore . **Sababa!**

### Telling the number of faces and the good orderings

Now we can tell the total number of faces of by looking at the graph . We compute the value for every ordering of the vertices of . The minimum value over all orderings is the value of – the number of non-empty faces of .

We can tell also the good orderings. We compute the quantity for every ordering of the vertices of the polytope and identify the minimum value . Now, must be the number of faces of the polytope . By the claim an ordering is a good ordering if and only if .

## The proof: part II

### Telling the faces

Let be a -dimensional face of and let be its graph. is itself a -dimensional polytope. What do we know about ? It is a k-regular graph. In fact it is an** induced **subgraph of . (Recall that is an induced subgraph of a graph if consists of a subset of the vertices of and **all **the edges of on these vertices.)

**Claim: **An induced connected k-regular subgraph H of G(P) is the graph of a face if and only if its vertices come first in some good ordering of .

**Proof:** There are two directions to prove. We start by showing that the graph of a -face is an induced connected -regular subgraph of and there is a good ordering that starts with the vertices of . Suppose that is a -face of . The graph of a face is always an induced subgraph of the graph of the polytope. Next, there is a linear functional on whose minimum on the polytope is attained precisely at . (This is essentially the definition of a face: a face is the intersection of the polytope with a supporting hyperplane, and we can take to be a linear functional that vanishes on and hence also on .) Now we can perturb a little so that it will attain different values on the vertices of , and such that all these values are still smaller than the values on all other vertices.

Now suppose that is an induced connected -regular graph and that is a good ordering such that the vertices of are smaller with respect to than all other vertices. Let be the largest vertex of w.r.t. . Now and therefore is a local maximum in the -face which is spanned by the edges of containing . Since is a good ordering, is a the global maximum vertex of . It follows that all the vertices of are vertices of . (Because the vertices of are precisely all the vertices that are smaller than with respect to the ordering.) Therefore , the graph of , is a -regular subgraph of . But note that the only -regular subgraph of a connected -regular graph is the graph itself! Therefore, the vertices of are the vertices of the face . **Sababa! **

## Further results

There are various other results about reconstructions of the entire combinatorial structure of a -polytope from partial information. My chapter on graphs and skeleta of polytopes in the “Handbook of discrete and computational geometry” contains several further such results. See also the new edition of Grunbaum’s classic book “Convex Polytopes“.

Let me mention two results: Hassler Whitney proved that the graph of a every 3-dimensional polytope determines its faces. The faces are simply the induced non-separating cycles. A theorem of Micha A. Perles asserts that the []-dimensional skeleton of a **simplicia**l -polytope determines the entire combinatorial structure.

## Friedman’s result

The algorithm to tell the polytope from a graph is simple but terrible. To start you have to consider all the orderings of the vertices of the polytope. All other theorems about reconstruction of the entire combinatorial structure of a polytope from partial information give simple polynomial algorithms.

Is there a polynomial time algorithm for telling the polytope from its graph? Eric Friedman proved a startling theorem asserting that there is a polynomial algorithm! (It deserves a whole separate post.)

## A dual form: puzzles.

Let be a pure -dimensional simplicial complex. The puzzle of , denoted by is the graph whose vertices are the facets of (a facet =a maximal face) and two facets are adjacent if their intersection is -dimensional. (The puzzle is precisely the same graph we associated to families of sets in the longish series of posts about Hirsch’s conjecture.)

Blind-Mani’s theorem stated in a dual form asserts that simplicial polytopes are determined by their puzzles and this is the way Blind and Mani stated it. We can talk also about puzzles where the pieces are themselves complicated polytopes which come with instructions how to glue two pieces locally, and ask if there is a unique global solution. (If the pieces are simplices, then all ways to glue them along facets are the same.) This was studied by Michael Joswig.

The first part of the proof described above asserts that for shellable simplicial complexes, the shelling orders, the total number of faces, and (by a slight extension of the proof) the f-vector are determined by the puzzle. In fact, the proof gives the following claim.

**Claim: **Let and be two pure -dimensional simplicial complexes. Suppose that and that is shellable. Then for every .

It is not always true that for shellable complexes the entire complex is detemined by the puzzle. Here are two 2-dimensional shellable complexes with the same puzzle. (A reminder of the notion of shellability is given below.)

## Problems:

### Spherical puzzles

**Conjecture 1**: A spherical puzzle always has a unique solution!

(By a spherical puzzle we mean a puzzle of a triangulation of a -dimensional sphere.)

**Conjecture 2:** The puzzle of a -dimensional Cohen-Macaulay simplicial complex determines the -vector of .

**Conjecture 3:**Let and be two pure -dimensional simplicial complexes. Suppose that and that is Cohen-Macaulay. Then for every .

The Cohen-Macaulay property can be regarded as an algebraic generalization of “shellability” (just like vanishing homology is an algebraic generalization of “collapsibility”). Triangulations of spheres are Cohen-Macaulay simplicial complexes.

### Characterizing the facets.

**Conjecture 4: **Let be the graph of a simple 4-dimensional polytope. Then a 3-regular induced subgraph of is the graph of a facet if and only if it is planar and non-separating**.**

An even stronger conjecture proposed by Perles (where is not assumed to be planar) was refuted by Christian Haase and Gunter M. Ziegler. Here is a modelby Nikolaus Witte of their example.

**Conjecture 5**: Let be the graph of a 4-dimensional spherical puzzle. Then a 3-regular induced subgraph of corresponds to the link of a vertex if and only if it is planar and non-separating.

We can also ask similar questions for puzzles of simplicial manifolds. Puzzles of general triangulated closed surfaces do not determine the triangulations; note that the puzzle of the 6-vertex triangulation of the real projective plane (which is the Peterson graph) has more automorphisms than the entire triangulation has!

And here is a conjecture (that we will not explain here) which is a little analogous to the conjecture that the f-vectors of Cohen-Macaulay complexes are determined by the puzzles.

### Kazhdan-Lusztig polynomials.

**Conjecture (Lusztig)**: For intervals of the Bruhat order of Coxeter groups the Kazhdan-Lusztig polynomial can be read from the Bruhat interval. (In other words, two isomorphic intervals have the same Kazhdan-Lusztig polynomials.)

## Reminder: shellability

We say that a -dimensional pure polyhedral complex is shellable if its maximal faces (facets) can be ordered by a sequence such that for every , , the intersection of with the union of is homeomorphic to a -dimensional ball or sphere. This condition implies that the entire complex is homeomorphic to a sphere or a ball. (We mentioned shellability here and here.)

For simplicial complexes, shellability is especially simple and becomes a purely combinatorial condition. The intersection of with the previous facets should be a (nonempty) union of some (or all) of its own facets. In a shelling sequence of facets, adding to the simplicial complex generated by has a very simple form. We add to a subset and all sets that contain which are contained in . If we say that adding is a shelling step of type .

If is a simplicial polytope then a shelling order on the facets of amounts to good ordering on the vertices of the dual polytope. The type of a facet in the shelling is the degree of the corresponding vertex in the good ordering.

The fact that the boundary complex every -polytope is shellable was assumed in 19th century proofs of Euler’s theorem in high dimension but it was first proved by Bruggesser and Mani in 1970. Peter Mani once told me that he found a crucial ingredient of the proof in a dream.

## Reminder: background

A **convex polytope** is the convex hull of a finite set of points in an Euclidean space. A proper **face**of a polytope P is the intersection of P with a supporting hyperplane. The empty face and P itself are regarded as trivial faces. The convex hull of a set of points which affinely span a d-dimensional space is a d-dimensional polytope or briefly a d-polytope. Faces of polytopes are themselves polytopes, a k-face is a short way to say k-dimensional face. 0-faces are called **vertices**, 1-faces are called **edges **and (d-1)-faces of a d-polytope are called **facets**. The set of faces of a polytope is a POSET (=partially ordered set) which is a “lattice”, “atomic”, and “graded”. For a polytope P denotes the number of k-faces of P. The ** f-vector **of P is the vector . Two d-polytopes P and Q are combinatorially equivalent if there is a bijection between the faces of P and the faces of Q which preserves the order relation.

The simplest d-polytope is the **simplex**: the convex hull of d+1 affinely independent points. The face lattice (=POSET of faces) of a simplex is just the Boolean lattice. A d-polytope is **simplicial **if all its proper faces are simplicies. A polytope is **simple **if its dual is simplicial or, equivalently, if every vertex is included in precisely d edges. A d-polytope is k-simplicial if all its k-faces are simplices. (Here d>k.) The d-cube is the convex hull of all vextors of length d with entries +1/-1.

The five open questions in this post belong to the combinatorial theory of polytopes that deal with the set of faces of polytopes. (There are also interesting metrical and arithmetic questions about polytopes.)

If P is a convex polytope which contains the origin in its interior, the **polar dual **of P is the set of all points y so that for every . There is a 1-1 **order reversing **bijection between the faces of P and the faces of its polar.

A polytope P is **centrally symmetric** if whenever x belongs to P so is -x.

Let me also mention that Friedman’s polynomial algorithm uses an earlier result by Joswig, Kaibel, and Korner who provided a “polynomial certificate” for the problem. Joswig, Kaibel, and Korner introduced a pair of combinatorial optimization problems which is used in Friedman’s proof.

The p-polytope proof can be considered different: A reduction of A to A’ is simply the reduction of G(p)=p :=: G(Q)=Q to G(x1,x2,x3,…)=x1,x2,x3,… and therefore n-1 in complexity and n-1=x for n=x+1 which means that the polytope is not determined if it determines not the figure with vertices 1 in addition. But this is a contradiction for P(X)=X and P(X)=X+1 for complexity n of P(X)=X or X+1 and invaluable for proof.

Pingback: Is Backgammon in P? | Combinatorics and more

Pingback: Remote Blogging: Efficiency of the Simplex Method: Quo vadis Hirsch conjecture? | Combinatorics and more

Pingback: Updates and plans III. | Combinatorics and more

Pingback: The beginnings of Shellability - Quantum Calculus