Halving
Halving is an operation on regular polyhedra with square faces.
Geometric description[edit  edit source]
Starting with a polytope π, to halve it we can first construct π . π starts with the same vertices as π and we add edges to it connecting vertices that are opposite each other in π. That is two vertices incident on the same face, that are not connected by an edge in π, are connected by an edge in π . Then we add faces to π . For each vertex x of π we add a face to π made from the vertices that were adjacent to x in π and the edges that connect them.
π is then either a polyhedron or a compound of two identical polyhedra. The halving is an arbitrary connected component of π .
Definition[edit  edit source]
Distinguished generators[edit  edit source]
Let π be a polyhedron of SchlΓ€fli type {4,q}, with distinguished generators . Then the halving of π, denoted , is the polyhedron given by the distinguished generators .
Examples[edit  edit source]

The halved mucube is a regular polyhedron which can be constructed by halving the mucube. The image shows a section of the halved mucube overlain on the original mucube.
Properties[edit  edit source]
 Halving maintains regularity, meaning that the halving of a polytope is always regular.
 The faces of a halved polytope are equivalent to the vertex figure of the original polytope.
 For an abstract polytope {4,q∣h} then its halving is {q,q}_{{h}◊{}}. Analogously, for a realized polytope, π, the Petrial of its halving is the blend of the dyad with the hole of πΞ΄ .
Relationship to alternation[edit  edit source]
Halving is very closely related to alternation. Both can be seen as a generalization of the same simple concept. Any to any polytope with a bipartite skeleton can be alternated, while any regular polyhedron with square faces can be halved. If alternation is taken to replace digons with edges then the two produce the same results on the intersection of their domain.
Can be halved  Can be alternated  

Cube  Yes  Yes 
Triangular duocomb  Yes  No 
Hexagonal prism  No  Yes 
Tesseract  No  Yes 
Tetrahedron  No  No 
Unlike alternation, halving is deterministic on its domain, meaning there is exactly 1 halving for every regular polyhedron with square faces.
Generalized halving[edit  edit source]
There also exists a generalized halving operation defined on polyhedra with gonal faces rather than on square faces.^{[1]} The halving of a regular polyhedron is defined using distinguished generators as . With this notation, the normal halving operation , and unlike the normal halving halving is not always selfdual  instead it is related by . Generalized halving is also closely related to the generalized skewing operation .
Generalized halving operations define further relationships between regular polyhedra. For example, applying to the muoctahedron gives the square tiling.
References[edit  edit source]
 β McMullen, Peter; Schulte, Egon (December 2002). Abstract Regular Polytopes. Cambridge University Press. ISBN 0521814960.
Bibliography[edit  edit source]
 McMullen, Peter; Schulte, Egon (1997). "Regular Polytopes in Ordinary Space" (PDF). Discrete Computational Geometry (47): 449β478. doi:10.1007/PL00009304.