Alternation

Alternation (also known as alternated faceting) is a procedure by which half of some elements (such as vertices, edges, etc.) of a polytope are removed, thus creating a new one. The process of vertex alternation is closely related to snubbing. It applies to any polytope whose vertex adjacency graph is bipartite.

To alternate a polytope, one first 2-colors the chosen elements, and removes all of those of a certain color, say black. The facets of the polytope then either are alternations of the former facets in turn or are so called sefas (sectioning facets underneath the being removed element of the original polytope). In case of vertex alternations those would just be the according vertex figures.

If this process creates any degenerate facets, such as digons, these usually are removed. For instance, the alternation of a cube is considered to be the tetrahedron, but well could be treated as a tetrahedron with extra digons at each edge.

Generally, any given polytope with an alternation of some of its elements has in fact two different alternations, resulting from either color choice of elements to remove. For instance, a rhombic dodecahedron can either be vertex alternated into a cube or into an octahedron. In the case where the polytope is uniform, however, both vertex alternations result either in congruent polytopes or in an eanantiomorph pair (eg. snub cube). Thus, in this special case, alternation can be regarded as giving a unique result.

Relation to snubbing
Snubbing however adds to the process of mere vertex alternation usually also the secondary process of edge resizement back to all unit edges. It is this secondary process, which might or might not be applicable. The mere alternation however always is - at least locally, cf. the theorem below. In its oldest use of the word, snubbing was applied to omnitruncates only, but later became applied more generally.

Though having faces with an even amount of sides is a necessary condition for a polytope to be globally alternatable, this turns out not to be sufficient in the general case. Nevertheless, all convex polyhedra with finitely many elements whose faces have an even amount of sides can be alternated.

Examples
The following are examples of polytopes resulting from alternation.


 * The vertex alternation of the hexagon results in the triangle.
 * The alternation of one of the 2 edge types of an octagon results in a rectangle.
 * The vertex alternation of the cube results in the tetrahedron.
 * The alternation of the great rhombicuboctahedron results in a (non-uniform) snub cube.
 * For every n, the vertex alternation of the 2n-gonal prism results in a (non-uniform) n-gonal antiprism.
 * For every n, the alternation of the lacing edges of a 2n-gonal prism results in a (non-uniform) n-gonal prism.
 * The alternation of the triangles of a small rhombicoboctahedron result in a (non-uniform) truncated tetrahedron.
 * For every n, the alternation of the n-hypercube results in the n-demihypercube.

Which polytopes are alternatable?
A polytope is vertex alternatable iff its vertex adjacency graph is bipartite. Particularly, each one of its faces must have an even amount of sides. It might be tempting to declare that conversely, every polytope whose faces all have an even amount of sides is alternatable, but this turns out not to be the case. A simple counterexample is the petrial tetrahedron, whose faces are all skew quadrilaterals, but whose vertex adjacency graph is that of the tetrahedron, and therefore is not bipartite.

There are also convex counterexamples with infinitely many faces and/or vertices. For instance, if an infinite amount of triangular prisms are joined by their triangles, the resulting apeirohedron will not be vertex alternatable, even though all of its faces will be squares.

Nevertheless, the following result can be established for convex polyhedra.

$$ $$