Alternation

Alternation is a procedure by which half of the vertices of a polytope are removed, creating a new one. It applies to any polytope whose vertex adjacency graph is bipartite.

To alternate a polytope, one first 2-colors its vertices, and removes all of the vertices of a certain color, say black. The facets of the polytope are alternated so that their vertices coincide with the vertices of the other color, say white. The gaps created by the black vertices are finally filled by the vertex figures of the original polytope at these vertices.

If this process creates any degenerate facets, such as digons, these are often though not always removed. For instance, the alternation of a cube can either be seen as the tetrahedron or as a tetrahedron with extra digons at each edge.

Generally, any given polytope with an alternation has in fact two different alternations, resulting from both choices of vertices to remove. In the case where the polytope is uniform, though, both alternations result in congruent polytopes, and thus alternation can be regarded as giving a unique result.

Though having faces with an even amount of sides is a necessary condition for a polytope to be alternatable, this turns out not to be sufficient in the general case.

Examples
The following are examples of polytopes resulting from alternation.


 * The tetrahedron is the alternation of the cube.
 * For every n, the alternation of the 2n-gonal prism results in an n-gonal antiprism.