In geometry, an enneahedron (or nonahedron) is a polyhedron with nine faces. There are 2606 types of convex enneahedron, each having a different pattern of vertex, edge, and face connections.[1] None of them are regular.
Examples
editThe most familiar enneahedra are the octagonal pyramid and the heptagonal prism. The heptagonal prism is a uniform polyhedron, with two regular heptagon faces and seven square faces. The octagonal pyramid has eight isosceles triangular faces around a regular octagonal base. Two more enneahedra are also found among the Johnson solids: the elongated square pyramid and the elongated triangular bipyramid. The three-dimensional associahedron, with six pentagonal faces and three quadrilateral faces, is an enneahedron. Five Johnson solids have enneahedral duals: the triangular cupola, gyroelongated square pyramid, self-dual elongated square pyramid, triaugmented triangular prism (whose dual is the associahedron), and tridiminished icosahedron. Another enneahedron is the diminished trapezohedron with a square base, and 4 kite and 4 triangle faces.
 Heptagonal prism |
 Elongated square pyramid |
 Elongated triangular bipyramid |
 Dual of triangular cupola |
 Dual of gyroelongated square pyramid |
 Dual of tridiminished icosahedron |
 Square diminished trapezohedron |
 Truncated triangular bipyramid, near-miss Johnson solid, and associahedron. |
 Polyhedron with the skeleton of Herschel graph |
The Herschel graph represents the vertices and edges of the Herschel enneahedron above, with all of its faces quadrilaterals. It is the simplest polyhedron without a Hamiltonian cycle,[2] the only convex enneahedron in which all faces have the same number of edges,[3] and one of only three bipartite convex enneahedra.[4]
The smallest pair of isospectral polyhedral graphs are enneahedra with eight vertices each.[5]
Space-filling enneahedra
edit
Slicing a rhombic dodecahedron in half through the long diagonals of four of its faces results in a self-dual enneahedron, the square diminished trapezohedron, with one large square face, four rhombus faces, and four isosceles triangle faces. Like the rhombic dodecahedron itself, this shape can be used to tessellate three-dimensional space.[6] An elongated form of this shape that still tiles space can be seen atop the rear side towers of the 12th-century Romanesque Basilica of Our Lady (Maastricht). The towers themselves, with their four pentagonal sides, four roof facets, and square base, form another space-filling enneahedron.
More generally, Goldberg (1982) found at least 40 topologically distinct space-filling enneahedra.[7]
Topologically distinct enneahedra
editThere are 2606 topologically distinct convex enneahedra, excluding mirror images. These can be divided into subsets of 8, 74, 296, 633, 768, 558, 219, 50, with 7 to 14 vertices respectively.[8] A table of these numbers, together with a detailed description of the nine-vertex enneahedra, was first published in the 1870s by Thomas Kirkman.[9]
References
edit- ^ Steven Dutch: How Many Polyhedra are There? Archived 2010-06-07 at the Wayback Machine
- ^ Barnette, David; Jucovič, Ernest (1970), "Hamiltonian circuits on 3-polytopes", Journal of Combinatorial Theory, 9 (1): 54–59, doi:10.1016/S0021-9800(70)80054-0
- ^ By the handshaking lemma, a face-regular polyhedron with an odd number of faces must have faces with an even number of edges, which for convex polyhedra can only be quadrilaterals. An enumeration of the dual graphs of quadrilateral-faced polyhedra is given by Broersma, H. J.; Duijvestijn, A. J. W.; Göbel, F. (1993), "Generating all 3-connected 4-regular planar graphs from the octahedron graph", Journal of Graph Theory, 17 (5): 613–620, doi:10.1002/jgt.3190170508, MR 1242180. Table 1, p. 619, shows that there is only one with nine faces.
- ^ Dillencourt, Michael B. (1996), "Polyhedra of small order and their Hamiltonian properties", Journal of Combinatorial Theory, Series B, 66 (1): 87–122, doi:10.1006/jctb.1996.0008, MR 1368518; see Table IX, p. 102.
- ^ Hosoya, Haruo; Nagashima, Umpei; Hyugaji, Sachiko (1994), "Topological twin graphs. Smallest pair of isospectral polyhedral graphs with eight vertices", Journal of Chemical Information and Modeling, 34 (2): 428–431, doi:10.1021/ci00018a033.
- ^ Critchlow, Keith (1970), Order in space: a design source book, Viking Press, p. 54.
- ^ Goldberg, Michael (1982), "On the space-filling enneahedra", Geometriae Dedicata, 12 (3): 297–306, doi:10.1007/BF00147314, S2CID 120914105.
- ^ Counting polyhedra
- ^ Biggs, N.L. (1981), "T.P. Kirkman, mathematician", The Bulletin of the London Mathematical Society, 13 (2): 97–120, doi:10.1112/blms/13.2.97, MR 0608093.
External links
edit- Enumeration of Polyhedra by Steven Dutch
- Weisstein, Eric W., "Nonahedron", MathWorld