A polycube is a solid figure formed by joining one or more equal cubes face to face. Polycubes are the three-dimensional analogues of the planar polyominoes. The Soma cube, the Bedlam cube, the Diabolical cube, the Slothouber–Graatsma puzzle, and the Conway puzzle are examples of packing problems based on polycubes.
Like polyominoes, polycubes can be enumerated in two ways, depending on whether chiral pairs of polycubes are counted as one polycube or two. For example, 6 tetracubes have mirror symmetry and one is chiral, giving a count of 7 or 8 tetracubes respectively. Unlike polyominoes, polycubes are usually counted with mirror pairs distinguished, because one cannot turn a polycube over to reflect it as one can a polyomino. In particular, the Soma cube uses both forms of the chiral tetracube.
Polycubes are classified according to how many cubical cells they have:
|n||Name of n-polycube||Number of one-sided n-polycubes
(reflections counted as distinct)
(sequence A000162 in the OEIS)
|Number of free n-polycubes|
(reflections counted together)
(sequence A038119 in the OEIS)
Symmetries of polycubes
As with polyominoes, polycubes may be classified according to how many symmetries they have. Polycube symmetries (conjugacy classes of subgroups of the achiral octahedral group) were first enumerated by W. F. Lunnon in 1972. Most polycubes are asymmetric, but many have more complex symmetry groups, all the way up to the full symmetry group of the cube with 48 elements. Numerous other symmetries are possible; for example, there are seven possible forms of 8-fold symmetry 
Properties of pentacubes
Twelve pentacubes are flat and correspond to the pentominoes. Of the remaining 17, five have mirror symmetry, and the other 12 form six chiral pairs.
The bounding boxes of the pentacubes have sizes 5x1x1, 4x2x1, 3x3x1, 3x2x1, 4x2x2, 3x2x2, and 2x2x2.
A polycube may have up to 24 orientations in the cubic lattice, or 48 if reflection is allowed. Of the pentacubes, two flats (5-1-1 and the cross) have mirror symmetry in all three axes; these have only three orientations. Ten have one mirror symmetry; these have 12 orientations. Each of the remaining 17 pentacubes has 24 orientations.
Octacubes and hypercube unfoldings
The tesseract (four-dimensional hypercube) has eight cubes as its facets, and just as the cube can be unfolded into a hexomino, the tesseract can be unfolded into an octacube. One unfolding, in particular, mimics the well-known unfolding of a cube into a Latin cross: it consists of four cubes stacked one on top of each other, with another four cubes attached to the exposed square faces of the second-from-top cube of the stack, to form a three-dimensional double cross shape. Salvador Dalí used this shape in his 1954 painting Crucifixion (Corpus Hypercubus) and it is described in Robert A. Heinlein's 1940 short story "And He Built a Crooked House". In honor of Dalí, this octacube has been called the Dalí cross. It can tile space.
Although the cubes of a polycube are required to be connected square-to-square, the squares of its boundary are not required to be connected edge-to-edge. For instance, the 26-cube formed by making a 3×3×3 grid of cubes and then removing the center cube is a valid polycube, in which the boundary of the interior void is not connected to the exterior boundary. It is also not required that the boundary of a polycube form a manifold. For instance, one of the pentacubes has two cubes that meet edge-to-edge, so that the edge between them is the side of four boundary squares.
If a polycube has the additional property that its complement (the set of integer cubes that do not belong to the polycube) is connected by paths of cubes meeting square-to-square, then the boundary squares of the polycube are necessarily also connected by paths of squares meeting edge-to-edge. That is, in this case the boundary forms a polyominoid.
|Unsolved problem in mathematics:|
Can every polycube with a connected boundary be unfolded to a polyomino? If so, can every such polycube be unfolded to a polyomino that tiles the plane?(more unsolved problems in mathematics)
Every k-cube with k < 7 as well as the Dalí cross (with k = 8) can be unfolded to a polyomino that tiles the plane. It is an open problem whether every polycube with a connected boundary can be unfolded to a polyomino, or whether this can always be done with the additional condition that the polyomino tiles the plane.
The structure of a polycube can be visualized by means of a "dual graph" that has a vertex for each cube and an edge for each two cubes that share a square. This is different from the similarly-named notions of a dual polyhedron, and of the dual graph of a surface-embedded graph.
Dual graphs have also been used to define and study special subclasses of the polycubes, such as the ones whose dual graph is a tree.
- Weisstein, Eric W. "Polycube." From MathWorld
- Lunnon, W. F. (1972). "Symmetry of Cubical and General Polyominoes". In Read, Ronald C. Graph Theory and Computing. New York: Academic Press. pp. 101–108. ISBN 978-1-48325-512-5.
- Polycubes, at The Poly Pages
- Kevin Gong's enumeration of polycubes
- "Enumeration of Specific Classes of Polycubes", Jean-Marc Champarnaud et al, Université de Rouen, France PDF
- "Dirichlet convolution and enumeration of pyramid polycubes", C. Carré, N. Debroux, M. Deneufchâtel, J. Dubernard, C. Hillairet, J. Luque, O. Mallet; November 19, 2013 PDF
- Aarts, Ronald M. "Pentacube." From MathWorld
- Kemp, Martin (1 January 1998), "Dali's dimensions", Nature, 391 (27), Bibcode:1998Natur.391...27K, doi:10.1038/34063
- Fowler, David (2010), "Mathematics in Science Fiction: Mathematics as Science Fiction", World Literature Today, 84 (3): 48–52, JSTOR 27871086,
Robert Heinlein's "And He Built a Crooked House," published in 1940, and Martin Gardner's "The No-Sided Professor," published in 1946, are among the first in science fiction to introduce readers to the Moebius band, the Klein bottle, and the hypercube (tesseract)..
- Diaz, Giovanna; O'Rourke, Joseph, Hypercube unfoldings that tile and , arXiv: , Bibcode:2015arXiv151202086D.
- Langerman, Stefan; Winslow, Andrew (2016), "Polycube unfoldings satisfying Conway's criterion" (PDF), 19th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG^3 2016).
- Turney, Peter (1984), "Unfolding the tesseract", Journal of Recreational Mathematics, 17 (1): 1–16, MR 0765344.
- Bagchi, Amitabha; Bhargava, Ankur; Chaudhary, Amitabh; Eppstein, David; Scheideler, Christian (2006), "The effect of faults on network expansion", Theory of Computing Systems, 39 (6): 903–928, arXiv: , doi:10.1007/s00224-006-1349-0, MR 2279081. See in particular Lemma 3.9, p. 924, which states a generalization of this boundary connectivity property to higher-dimensional polycubes.
- Barequet, Ronnie; Barequet, Gill; Rote, Günter (2010), "Formulae and growth rates of high-dimensional polycubes", Combinatorica, 30 (3): 257–275, doi:10.1007/s00493-010-2448-8, MR 2728490.
- Aloupis, Greg; Bose, Prosenjit K.; Collette, Sébastien; Demaine, Erik D.; Demaine, Martin L.; Douïeb, Karim; Dujmović, Vida; Iacono, John; Langerman, Stefan; Morin, Pat (2011), "Common unfoldings of polyominoes and polycubes", Computational geometry, graphs and applications, Lecture Notes in Comput. Sci., 7033, Springer, Heidelberg, pp. 44–54, doi:10.1007/978-3-642-24983-9_5, MR 2927309.