Cube (original) (raw)

Solid with six equal square faces

Cube
Type Hanner polytope,orthogonal polyhedron,parallelohedron,Platonic solid,plesiohedron,regular polyhedron,zonohedron
Faces 6 square
Edges 12
Vertices 8
Euler char. 2
Vertex configuration 8 × ( 4 3 ) {\displaystyle 8\times (4^{3})} {\displaystyle 8\times (4^{3})}
Schläfli symbol { 4 , 3 } {\displaystyle \{4,3\}} {\displaystyle \{4,3\}}
Symmetry group octahedral symmetry O h {\displaystyle \mathrm {O} _{\mathrm {h} }} {\displaystyle \mathrm {O} _{\mathrm {h} }}
Volume side3
Dihedral angle (degrees) 90°
Dual polyhedron regular octahedron
Properties convex,edge-transitive,face-transitive,non-composite,orthogonal faces,Rupert property: can pass through a hole with its copy,vertex-transitive

A cube is a three-dimensional solid object in geometry. A cube has eight vertices and twelve straight edges of the same length, so that these edges form six square faces of the same size. It is an example of a polyhedron.

The cube is found in many popular cultures, including toys and games, the arts, optical illusions, and architectural buildings. Cubes can be found in crystal structures, science, and technological devices. It is also found in ancient texts, such as Plato's work Timaeus, which described a set of solids now called Platonic solids, associating a cube with the classical element of earth. A cube with unit length is the canonical unit of volume in three-dimensional space, relative to which other solid objects are measured.

The cube relates to the construction of many polyhedra, such as truncation and attaching to other polyhedra. It also represents geometrical shapes. The cube can be attached to its faces with its copy to fill a space without leaving a gap, which forms a honeycomb.

The cube can be represented in many ways. One example is by drawing a graph, a structure in graph theory consisting of a set of vertices that are connected with an edge. This graph also represents the family of a cuboid, a polyhedron with six quadrilateral faces, which includes the cube as its special case. The cube and its graph are a three-dimensional hypercube, a family of polytopes that also includes the two-dimensional square and four-dimensional tesseract.

Cube modeled in 3D, where one can click and drag to rotate

3D model of a cube

A cube is a polyhedron with eight vertices and twelve equal-length edges, forming six squares as its faces. A cube is a special case of a rectangular cuboid, which has six rectangular faces, each of which has a pair of opposite equal-length and parallel edges.[1] Both polyhedra have the same dihedral angle, the angle between two adjacent faces at a common edge, a right angle or 90°, obtained from the interior angle (an angle formed between two adjacent sides at a common point of a polygon within) of a square.[2][3] More generally, the cube and the rectangular cuboid are special cases of a cuboid, a polyhedron with six quadrilaterals (four-sided polygons).[4] As for all convex polyhedra, the cube has Euler characteristic of 2, according to the formula V − E + F = 2 {\displaystyle V-E+F=2} {\displaystyle V-E+F=2}; the three letters denote respectively the number of vertices, edges, and faces.[5]

All three square faces surrounding a vertex are orthogonal to each other, meaning the planes are perpendicular, forming a right angle between two adjacent squares. Hence, the cube is classified as an orthogonal polyhedron.[6] The cube is a special case of other cuboids. These include a parallelepiped, a polyhedron with six parallelograms faces, because its pairs of opposite faces are congruent;[7] a rhombohedron, as a special case of a parallelepiped with six rhombi faces, because the interior angle of all of the faces is right;[8] and a trigonal trapezohedron, a polyhedron with congruent quadrilateral faces, since its square faces are the special cases of rhombi.[9]

The cube is a non-composite or an elementary polyhedron. That is, no plane intersecting its surface only along edges, thereby cutting into two or more convex, regular-faced polyhedra.[10]

A space diagonal AC' and a face diagonal AC

A face diagonal is denoted as A C {\displaystyle AC} {\displaystyle AC} and a space diagonal is A C ′ {\displaystyle AC'} {\displaystyle AC'}

Given a cube with edge length a {\displaystyle a} {\displaystyle a}, the face diagonal of the cube is the diagonal of a square a 2 {\displaystyle a{\sqrt {2}}} {\displaystyle a{\sqrt {2}}}, and the space diagonal of the cube is a line connecting two vertices that are not in the same face, formulated as a 3 {\displaystyle a{\sqrt {3}}} {\displaystyle a{\sqrt {3}}}. Both formulas can be determined by using the Pythagorean theorem. The surface area of a cube A {\displaystyle A} {\displaystyle A} is six times the area of a square:[11] A = 6 a 2 . {\displaystyle A=6a^{2}.} {\displaystyle A=6a^{2}.}The volume of a rectangular cuboid is the product of its length, width, and height. Because all the edges of a cube are equal in length, the formula for the volume of a cube is the third power of its side length.[11] This leads to the use of the term cube as a verb, to mean raising any number to the third power:[4] V = a 3 . {\displaystyle V=a^{3}.} {\displaystyle V=a^{3}.}

The cube has three types of closed geodesics, or paths on a cube's surface that are locally straight. In other words, they avoid the vertices, follow line segments across the faces that they cross, and form complementary angles on the two incident faces of each edge that they cross. One type lies in a plane parallel to any face of the cube, forming a square congruent to a face, four times the length of each edge. Another type lies in a plane perpendicular to the long diagonal, forming a regular hexagon; its length is 3 2 {\displaystyle 3{\sqrt {2}}} {\displaystyle 3{\sqrt {2}}} times that of an edge. The third type is a non-planar hexagon.[12]

Insphere, midsphere, circumsphere

[edit]

An insphere of a cube r i {\displaystyle r_{i}} {\displaystyle r_{i}} is a sphere tangent to the faces of a cube at their centroids. Its midsphere r m {\displaystyle r_{m}} {\displaystyle r_{m}} is a sphere tangent to the edges of a cube. Its circumsphere r c {\displaystyle r_{c}} {\displaystyle r_{c}} is a sphere tangent to the vertices of a cube. With edge length a {\displaystyle a} {\displaystyle a}, they are respectively:[13] r i = 1 2 a = 0.5 a , r m = 2 2 a ≈ 0.707 a , r c = 3 2 a ≈ 0.866 a . {\displaystyle r_{i}={\frac {1}{2}}a=0.5a,\qquad r_{m}={\frac {\sqrt {2}}{2}}a\approx 0.707a,\qquad r_{c}={\frac {\sqrt {3}}{2}}a\approx 0.866a.} {\displaystyle r_{i}={\frac {1}{2}}a=0.5a,\qquad r_{m}={\frac {\sqrt {2}}{2}}a\approx 0.707a,\qquad r_{c}={\frac {\sqrt {3}}{2}}a\approx 0.866a.}

Cube with a hole through which an equal cube can pass

Prince Rupert's cube

A unit cube is a cube with 1 unit in length along each edge. It follows that each face is a unit square and that the entire figure has a volume of 1 cubic unit.[14][15] Prince Rupert of the Rhine, known for Prince Rupert's drop, wagered whether a cube could be passed through a hole made in another cube of the same size. The story recounted in 1693 by English mathematician John Wallis answered that it is possible, although there were some errors in Wallis's presentation. Roughly a century later, Dutch mathematician Pieter Nieuwland provided a better solution that the edges of a cube passing through the unit cube's hole could be as large as approximately 1.06 units in length.[16][17] One way to obtain this result is by using the Pythagorean theorem or the formula for Euclidean distance in three-dimensional space.[18]

An ancient problem of doubling the cube requires the construction of a cube with a volume twice the original by using only a compass and straightedge. This was concluded by French mathematician Pierre Wantzel in 1837, proving that it is impossible to implement since a cube with twice the volume of the original—the cube root of 2, 2 3 {\displaystyle {\sqrt[{3}]{2}}} {\displaystyle {\sqrt[{3}]{2}}}—is not constructible.[19] However, this problem was solved with folding an origami paper by Messer (1986).[20]

Cube, the dual of a regular octahedron

The dual polyhedron of a cube is the regular octahedron. Both have octahedral symmetry.

The cube has octahedral symmetry O h {\displaystyle \mathrm {O} _{\mathrm {h} }} {\displaystyle \mathrm {O} _{\mathrm {h} }} of order 48. In other words, the cube has 48 isometries (including identity), each of which transforms the cube to itself. These transformations include nine reflection symmetries (where two halves cut by a plane are identical): three cut the cube at the midpoints of its edges, and six cut diagonally. The cube also has thirteen axes of rotational symmetry (whereby rotation around the axis results in an identical appearance): three axes pass through the centroids of opposite faces, six through the midpoints of opposite edges, and four through opposite vertices; these axes are respectively four-fold rotational symmetry (0°, 90°, 180°, and 270°), two-fold rotational symmetry (0° and 180°), and three-fold rotational symmetry (0°, 120°, and 240°).[21][22][23][24]

The dual polyhedron can be obtained from each of the polyhedra's vertices tangent to a plane by a process known as polar reciprocation.[25] One property of dual polyhedra is that the polyhedron and its dual share their three-dimensional symmetry point group. In this case, the dual polyhedron of a cube is the regular octahedron, and both of these polyhedra have the same octahedral symmetry.[26]

The cube is face-transitive, meaning its two square faces are alike and can be mapped by rotation and reflection.[27] It is vertex-transitive, meaning all of its vertices are equivalent and can be mapped isometrically under its symmetry.[28] It is also edge-transitive, meaning the same kind of faces surround each of its vertices in the same or reverse order, and each pair of adjacent faces has the same dihedral angle. Therefore, the cube is a regular polyhedron.[29] Each vertex is surrounded by three squares, so the cube is 4.4.4 {\displaystyle 4.4.4} {\displaystyle 4.4.4} by vertex configuration or { 4 , 3 } {\displaystyle \{4,3\}} {\displaystyle \{4,3\}} by Schläfli symbol.[30]

[edit]

Cubes have appeared in many roles in popular culture. It is the most common form of dice.[27] Puzzle toys such as pieces of a Soma cube,[31] Rubik's Cube, and Skewb are built of cubes.[32] Minecraft is an example of a sandbox video game of cubic blocks.[33] The outdoor sculpture Alamo (1967) is a cube that spins around its vertical axis.[34] Optical illusions such as the impossible cube and Necker cube have been explored by artists such as M. C. Escher.[35] The cube was applied in Alberti's treatise on Renaissance architecture, De re aedificatoria (1450).[36] Cube houses in the Netherlands are a set of cubical houses whose hexagonal space diagonals become the main floor.[37]

In nature and science

[edit]

Crystal structure in cubic shape

Simple cubic crystal structure

Table salt with cubic-shaped crystal

Cubane in ball-and-stick model

Cubes are also found in various fields of natural science and technology. It is applied to the unit cell of a crystal known as a cubic crystal system.[38] Table salt is an example of a mineral with a commonly cubic shape.[39] Other examples are pyrite (although there are many variations)[40] and uranium cubic-shaped in nuclear program.[41] The radiolarian Lithocubus geometricus, discovered by Ernst Haeckel, has a cubic shape.[42] Cubane is a synthetic hydrocarbon consisting of eight carbon atoms arranged at the corners of a cube, with one hydrogen atom attached to each carbon atom.[43]

A historical attempt to unify three physics ideas of relativity, gravitation, and quantum mechanics used the framework of a cube known as a cGh cube.[44]

A series of two Norwegian CubeSats

A cube's rotoflector, a corner reflector, redirects two rays back to theier source

Technological cubes include the spacecraft device CubeSat,[45] thermal radiation demonstration device Leslie cube,[46] and web server machine Cobalt Qube.[47] Cubical grids are usual in three-dimensional Cartesian coordinate systems.[48] In computer graphics, an algorithm divides the input volume into a discrete set of cubes known as the unit on isosurface,[49] and the faces of a cube can be used for mapping a shape.[50] In various areas of engineering, including traffic signs and radar, the corner of a cube is useful as a retroreflector, called a corner reflector, which redirects any ray or wave back to its source.[51]

Sketch of trees on cube's face by Johannes Kepler

Sketch of a cube by Johannes Kepler

Solar system, modeled with five Platonic solids by Johannes Kepler

The Platonic solids are five polyhedra known since antiquity. The set is named for Plato, who attributed these solids to nature in his dialogue Timaeus. One of them, the cube, represented the classical element of earth because of the building blocks of Earth's foundation.[52] Euclid's Elements defined the Platonic solids, including the cube, and showed how to find the ratio of the circumscribed sphere's diameter to the edge length.[53]

Following Plato's use of the regular polyhedra as symbols of nature, Johannes Kepler in his Harmonices Mundi sketched each of the Platonic solids; he decorated the cube's side with a tree.[54] In his Mysterium Cosmographicum, Kepler proposed the structure of Solar system and the relationships between its extraterrestrial planets with the set of Platonic solids, inscribed and circumscribed by spherical orbs. Each solid encased in a sphere, within one another, would produce six layers, corresponding to the six known planets. Mercury, Venus, Earth, Mars, Jupiter, and Saturn. From innermost to outermost, these solids were arranged from octahedron, followed by the icosahedron, dodecahedron, tetrahedron, and eventually the cube.[55]

Cube' eleven different nets

The eleven nets of a cube

The cube has eleven different nets, which consist of an arrangement of edge-joined squares. These squares can be folded along the edges and connected to those polygons, which eventually become the faces of a cube.[56][57]

In analytic geometry, a cube may be constructed using the Cartesian coordinate systems. For a cube centered at the origin, with edges parallel to the axes and with an edge length of 2, the Cartesian coordinates of the vertices are ( ± 1 , ± 1 , ± 1 ) {\displaystyle (\pm 1,\pm 1,\pm 1)} {\displaystyle (\pm 1,\pm 1,\pm 1)}.[58] Its interior consists of all points ( x 0 , x 1 , x 2 ) {\displaystyle (x_{0},x_{1},x_{2})} {\displaystyle (x_{0},x_{1},x_{2})} with − 1 < x i < 1 {\displaystyle -1<x_{i}<1} {\displaystyle -1<x_{i}<1} for all i {\displaystyle i} {\displaystyle i}. A cube's surface with center ( x 0 , y 0 , z 0 ) {\displaystyle (x_{0},y_{0},z_{0})} {\displaystyle (x_{0},y_{0},z_{0})} and edge length of 2 a {\displaystyle 2a} {\displaystyle 2a} is the locus of all points ( x , y , z ) {\displaystyle (x,y,z)} {\displaystyle (x,y,z)} such that max { | x − x 0 | , | y − y 0 | , | z − z 0 | } = a . {\displaystyle \max\{|x-x_{0}|,|y-y_{0}|,|z-z_{0}|\}=a.} {\displaystyle \max\{|x-x_{0}|,|y-y_{0}|,|z-z_{0}|\}=a.}

The cube is a Hanner polytope, because it can be constructed by using the Cartesian product of three line segments. Its dual polyhedron, the regular octahedron, is constructed by the direct sum of three line segments.[59]

Cube projected in a plane as a graph

The graph of a cube

The cube can be drawn into a graph, a structure in graph theory consisting of a set of vertices that are connected with an edge. It is attainable according to Steinitz's theorem, which states that a graph can be represented as the vertex-edge graph of a polyhedron, as long as it possesses the following two properties. These are planarity (the edges of a graph are connected to every vertex without crossing other edges), and 3-connected (whenever a graph with more than three vertices, and two of the vertices are removed, the edges remain connected).[60][61] The skeleton of a cube, represented as the graph, is called the cubical graph, a Platonic graph. It has the same number of vertices and edges as the cube, twelve vertices and eight edges.[62] The cubical graph is also classified as a prism graph, resembling the skeleton of a cuboid.[63]

The cubical graph is a special case of hypercube graph or n {\displaystyle n} {\displaystyle n}-cube—denoted as Q n {\displaystyle Q_{n}} {\displaystyle Q_{n}}—because it can be constructed by using the Cartesian product of graphs: two graphs connecting the pair of vertices with an edge to form a new graph.[64] In the case of the cubical graph, it is the product of Q 2 ◻ Q 1 {\displaystyle Q_{2}\mathbin {\Box } Q_{1}} {\displaystyle Q_{2}\mathbin {\Box } Q_{1}}, where ◻ {\displaystyle \mathbin {\Box } } {\displaystyle \mathbin {\Box } } denotes the Cartesian product of graphs. In other words, the cubical graph is constructed by connecting each vertex of two squares with an edge. Notationally, the cubical graph is Q 3 {\displaystyle Q_{3}} {\displaystyle Q_{3}}.[65] Like any hypercube graph, it has a cycle which visits every vertex exactly once,[66] and it is also an example of a unit distance graph.[67]

The cubical graph is bipartite, meaning every independent set of four vertices can be disjoint and the edges connected in those sets.[68] However, every vertex in one set cannot connect all vertices in the second, so this bipartite graph is not complete.[69] It is an example of both a crown graph and a bipartite Kneser graph.[70][68]

In orthogonal projection

[edit]

An object illuminated by parallel rays of light casts a shadow on a plane perpendicular to those rays, called an orthogonal projection. A polyhedron is considered equiprojective if, for some position of the light, its orthogonal projection is a regular polygon. The cube is equiprojective because, if the light is parallel to one of the four lines joining a vertex to the opposite vertex, its projection is a regular hexagon.[71]

As a configuration matrix

[edit]

The cube can be represented as a configuration matrix, a matrix in which the rows and columns correspond to the elements of a polyhedron as the vertices, edges, and faces. The diagonal of a matrix denotes the number of each element that appears in a polyhedron, whereas the non-diagonal of a matrix denotes the number of the column's elements that occur in or at the row's element. The cube's eight vertices, twelve edges, and six faces are denoted by each element in a matrix's diagonal (8, 12, and 6). The first column of the middle row indicates that there are two vertices on each edge, denoted as 2; the middle column of the first row indicates that three edges meet at each vertex, denoted as 3. The configuration matrix of a cube is:[72] [ 8 3 3 2 12 2 4 4 6 ] {\displaystyle {\begin{bmatrix}{\begin{matrix}8&3&3\\2&12&2\\4&4&6\end{matrix}}\end{bmatrix}}} {\displaystyle {\begin{bmatrix}{\begin{matrix}8&3&3\\2&12&2\\4&4&6\end{matrix}}\end{bmatrix}}}

Construction of polyhedra

[edit]

Many polyhedra can be constructed based on a cube. Examples include:

The cube can be constructed with six square pyramids, tiling space by attaching their apices. In some cases, this produces the rhombic dodecahedron circumscribing a cube.[85][86]

A pentacube

Dali cross, animated as one of tesseract's nets

Two examples of polycubes are a polycube with five cubes attached face-to-face and Dalí cross. The latter is one of 261 nets of a tesseract.

A polycube is a solid figure formed by joining one or more equal cubes face-to-face. Polycubes are the three-dimensional analogues of two-dimensional polyominoes.[87]

When four cubes are stacked vertically, and four others are attached to the second-from-top cube of the stack, the resulting polycube is the Dalí cross, named after Spanish surrealist artist Salvador Dalí, whose painting Corpus Hypercubus (1954) contains a tesseract unfolding into a six-armed cross; a similar construction is central to Robert A. Heinlein's short story "And He Built a Crooked House" (1940).[88][89] The Dalí cross can be folded in a fourth dimension to enclose a tesseract.[90] A cube is a three-dimensional instance of a hypercube (also known as a 3-cube); the two-dimensional hypercube (2-cube) is a square, and the four-dimensional hypercube (4-cube) is a tesseract.[91]

Cubic honeycomb is an example of honeycomb in Euclidean three-dimensional space

A cube can achieve a honeycomb by filling together with its copy in three-dimensional space without leaving a gap. Cubes are space-fillings, where the phrase "space-filling" can be understood as a generalized tessellation.[92] The cube is a plesiohedron, a special kind of space-filling polyhedron that can be defined as the Voronoi cell of a symmetric Delone set.[93] The plesiohedra include the parallelohedra, which can be translated without rotating to fill a space in which each face of any of its copies is attached to a like face of another copy. There are five kinds of parallelohedra, one of which is the parallelepiped.[94] Every three-dimensional parallelohedron is a zonohedron, a centrally symmetric polyhedron whose faces are centrally symmetric polygons.[95]

An example of a honeycomb with a cubic type only, called a cell, is a cubic honeycomb that consists of four cubes around its edges in Euclidean three-dimensional space.[96][97] More examples in three-dimensional non-Euclidean space are the honeycomb with three cubes around its edges in a three-dimensional sphere and the honeycomb with five cubes around its edges in hyperbolic space.[97]

Any parallelepiped, including a cube, can achieve a honeycomb if its Dehn invariant is zero.[98] The Dehn invariant's inception dates back to Hilbert's third problem, whether every two equal-volume polyhedra can always be dissected into polyhedral pieces and reassembled into each other. If yes, then the volume of any polyhedron could be defined axiomatically as the volume of an equivalent cube into which it could be reassembled. This problem was solved by Max Dehn, inventing his invariant, answering that not all polyhedra can be reassembled into a cube.[99] It showed that two equal volume polyhedra should have the same Dehn invariant, except for the two tetrahedra whose Dehn invariants were different.[100]

The polyhedral compounds, in which the cubes share the same centre, are uniform polyhedron compounds, meaning they are polyhedral compounds whose constituents are identical—although possibly enantiomorphous—uniform polyhedra, in an arrangement that is also uniform. Respectively, the list of compounds enumerated by Skilling (1976) in the seventh to ninth uniform compounds for the compound of six cubes with rotational freedom, three cubes, and five cubes.[101] Two compounds, consisting of two and three cubes were found in Escher's wood engraving print Stars and Max Brückner's book Vielecke und Vielflache.[102]

Cube in spherical geometry

Spherical cube

A torus as a three-dimensional cube modeled

The spherical cube represents the spherical polyhedron, which can be modeled with the arcs of great circles, creating bounds as the edges of a spherical square.[103]Hence, the spherical cube consists of six spherical squares with 120° interior angles on each vertex. It has vector equilibrium, meaning that the distance from the centroid and each vertex is the same as the distance from that to each edge.[104][105] Its dual is the spherical octahedron.[103]

The topological object three-dimensional torus is a topological space defined to be homeomorphic to the Cartesian product of three circles. It can be represented as a three-dimensional model of the cube shape.[106]

A cube can have fractal shapes, which retain the pattern shape recursively regardless of the magnification. The Menger sponge is an example of a fractal-shaped cube, analogous to the two-dimensional version, the Sierpiński carpet.[107] Other varieties are the Jerusalem cube and Mosely snowflake.[108][109]

  1. ^ Dupuis, Nathan Fellowes (1893). Elements of Synthetic Solid Geometry. Macmillan. p. 68.
  2. ^ Johnson, Norman W. (1966). "Convex Polyhedra with Regular Faces". Canadian Journal of Mathematics. 18: 169–200. doi:10.4153/cjm-1966-021-8. MR 0185507. S2CID 122006114. Zbl 0132.14603. See table II, line 3.
  3. ^ Bird, John (2020). Science and Mathematics for Engineering (6th ed.). Routledge. pp. 143–144. ISBN 9780429261701.
  4. ^ a b Mills, Steve; Kolf, Hillary (1999). Maths Dictionary. Heinemann. p. 16. ISBN 9780435024741.
  5. ^ Richeson, D. S. (2008). Euler's Gem: The Polyhedron Formula and the Birth of Topology. Princeton University Press. pp. 1–2. ISBN 9780691126777.
  6. ^ Jessen, Børge (1967). "Orthogonal Icosahedra". Nordisk Matematisk Tidskrift. 15 (2): 90–96. JSTOR 24524998. MR 0226494.
  7. ^ Calter, Paul; Calter, Michael (2011). Technical Mathematics. John Wiley & Sons. p. 197. ISBN 9780470534922.
  8. ^ Hoffmann (2020), p. 83.
  9. ^ Chilton, B. L.; Coxeter, H. S. M. (1963). "Polar Zonohedra". The American Mathematical Monthly. 70 (9): 946–951. doi:10.1080/00029890.1963.11992147. JSTOR 2313051. MR 0157282.
  10. ^ a b Timofeenko, A. V. (2010). "Junction of Non-composite Polyhedra" (PDF). St. Petersburg Mathematical Journal. 21 (3): 483–512. doi:10.1090/S1061-0022-10-01105-2.
  11. ^ a b Khattar, Dinesh (2008). Guide to Objective Arithmetic (2nd ed.). Pearson Education. p. 377. ISBN 9788131716823.
  12. ^ Fuchs, Dmitry; Fuchs, Ekaterina (2007). "Closed Geodesics on Regular Polyhedra" (PDF). Moscow Mathematical Journal. 7 (2): 265–279. See Figure 11, p. 273, for showing three types of cube's geodesics.
  13. ^ Coxeter (1973) Table I(i), pp. 292–293. See the columns labeled 0 R / ℓ {\displaystyle {}_{0}\!\mathrm {R} /\ell } {\displaystyle {}_{0}\!\mathrm {R} /\ell }, 1 R / ℓ {\displaystyle {}_{1}\!\mathrm {R} /\ell } {\displaystyle {}_{1}\!\mathrm {R} /\ell }, and 2 R / ℓ {\displaystyle {}_{2}\!\mathrm {R} /\ell } {\displaystyle {}_{2}\!\mathrm {R} /\ell }, Coxeter's notation for the circumradius, midradius, and inradius, respectively, also noting that Coxeter uses 2 ℓ {\displaystyle 2\ell } {\displaystyle 2\ell } as the edge length (see p. 2).
  14. ^ Ball, Keith (2010). "High-dimensional Geometry and Its Probabilistic Analogues". In Gowers, Timothy (ed.). The Princeton Companion to Mathematics. Princeton University Press. p. 671. ISBN 9781400830398.
  15. ^ Geometry: Reteaching Masters. Holt Rinehart & Winston. 2001. p. 74. ISBN 9780030543289.
  16. ^ Jerrard, Richard P.; Wetzel, John E. (2004). "Prince Rupert's rectangles". The American Mathematical Monthly. 111 (1): 22–31. doi:10.2307/4145012. JSTOR 4145012. MR 2026310.
  17. ^ Rickey, V. Frederick (2005). "Dürer's Magic Square, Cardano's Rings, Prince Rupert's Cube, and Other Neat Things" (PDF). Archived from the original (PDF) on 2010-07-05. Notes for “Recreational Mathematics: A Short Course in Honor of the 300th Birthday of Benjamin Franklin,” Mathematical Association of America, Albuquerque, NM, August 2–3, 2005
  18. ^ Gardner, Martin (2001). The Colossal Book of Mathematics: Classic Puzzles, Paradoxes, and Problems: Number Theory, Algebra, Geometry, Probability, Topology, Game Theory, Infinity, and Other Topics of Recreational Mathematics. W. W. Norton & Company. pp. 172–173. ISBN 9780393020236.
  19. ^ Lützen, Jesper (2010). "The Algebra of Geometric Impossibility: Descartes and Montucla on the Impossibility of the Duplication of the Cube and the Trisection of the Angle". Centaurus. 52 (1): 4–37. doi:10.1111/j.1600-0498.2009.00160.x.
  20. ^ Messer, Peter (1986). "Problem 1054" (PDF). Crux Mathematicorum. 12 (10): 284–285 – via Canadian Mathematical Society.
  21. ^ French, Doug (1988). "Reflections on a Cube". Mathematics in School. 17 (4): 30–33. JSTOR 30214515.
  22. ^ Cromwell, Peter R. (1997). Polyhedra. Cambridge University Press. p. 309. ISBN 9780521554329.
  23. ^ Cunningham, Gabe; Pellicer, Daniel (2024). "Finite 3-orbit Polyhedra in Ordinary Space, II". Boletín de la Sociedad Matemática Mexicana. 30 (32) 32. doi:10.1007/s40590-024-00600-z. See p. 276.
  24. ^ Kane, Richard (2001). Reflection Groups and Invariant Theory. Springer. p. 16. ISBN 9780387989792.
  25. ^ Cundy, H. Martyn; Rollett, A.P. (1961). "3.2 Duality". Mathematical Models (2nd ed.). Clarendon Press. pp. 78–79. MR 0124167.
  26. ^ Erickson, Martin (2011). Beautiful Mathematics. Mathematical Association of America. p. 62. ISBN 9781614445098.
  27. ^ a b McLean, K. Robin (1990). "Dungeons, Dragons, and Dice". The Mathematical Gazette. 74 (469): 243–256. doi:10.2307/3619822. JSTOR 3619822. S2CID 195047512. See p. 247.
  28. ^ Grünbaum, Branko (1997). "Isogonal Prismatoids". Discrete & Computational Geometry. 18 (1): 13–52. doi:10.1007/PL00009307.
  29. ^ Senechal, Marjorie (1989). "A Brief Introduction to Tilings". In Jarić, Marko (ed.). Introduction to the Mathematics of Quasicrystals. Academic Press. p. 12.
  30. ^ Walter, Steurer; Deloudi, Sofia (2009). Crystallography of Quasicrystals: Concepts, Methods and Structures. Springer Series in Materials Science. Vol. 126. p. 50. doi:10.1007/978-3-642-01899-2. ISBN 9783642018985.
  31. ^ Masalski, William J. (1977). "Polycubes". The Mathematics Teacher. 70 (1): 46–50. doi:10.5951/MT.70.1.0046. JSTOR 27960702.
  32. ^ Joyner, David (2008). Adventures in Group Theory: Rubik's Cube, Merlin's Machine, and Other Mathematical Toys (2nd ed.). The Johns Hopkins University Press. p. 76. ISBN 9780801890123.
  33. ^ Moore, Kimberly (2018). "Minecraft Comes to Math Class". Mathematics Teaching in the Middle School. 23 (6): 334–341. doi:10.5951/mathteacmiddscho.23.6.0334. JSTOR 10.5951/mathteacmiddscho.23.6.0334.
  34. ^ Reaven, Marci; Zeilten, Steve (2006). Hidden New York: A Guide to Places that Matter. Rutgers University Press. p. 77. ISBN 9780813538907.
  35. ^ Barrow, John D. (1999). Impossibility: The Limits of Science and the Science of Limits. Oxford University Press. p. 14. ISBN 9780195130829.
  36. ^ March, Lionel (1996). "Renaissance Mathematics and Architectural Proportion in Alberti's De re aedificatoria". Architectural Research Quarterly. 2 (1): 54–65. doi:10.1017/S135913550000110X. S2CID 110346888.
  37. ^ Alsina, Claudi; Nelsen, Roger B. (2015). A Mathematical Space Odyssey: Solid Geometry in the 21st Century. Vol. 50. Mathematical Association of America. p. 85. ISBN 9781614442165.
  38. ^ Tisza, Miklós (2001). Physical Metallurgy for Engineers. ASM International. p. 45. ISBN 9781615032419.
  39. ^ Chieh, Chung (2013). "Polyhedra and Crystal Structures". In Senechal, Marjorie (ed.). Shaping Space: Exploring Polyhedra in Nature, Art, and the Geometrical Imagination. Springer. p. 141. doi:10.1007/978-0-387-92714-5_10. ISBN 9780387927138.
  40. ^ Hoffmann, Frank (2020). Introduction to Crystallography. Springer. p. 35. doi:10.1007/978-3-030-35110-6. ISBN 9783030351106.
  41. ^ Kratz, Jens-Volker (2021). Nuclear and Radiochemistry: Fundamentals and Applications. John Wiley & Sons. p. 31. doi:10.1002/9783527831944. ISBN 9783527831944.
  42. ^ Haeckel, E. (1904). Kunstformen der Natur (in German). See here for an online book.
  43. ^ Biegasiewicz, Kyle; Griffiths, Justin; Savage, G. Paul; Tsanakstidis, John; Priefer, Ronny (2015). "Cubane: 50 Years Later". Chemical Reviews. 115 (14): 6719–6745. doi:10.1021/cr500523x. PMID 26102302.
  44. ^ Padmanabhan, Thanu (2015). "The Grand Cube of Theoretical Physics". Sleeping Beauties in Theoretical Physics. Springer. pp. 1–8. ISBN 9783319134420.
  45. ^ Helvajian, Henry; Janson, Siegfried W., eds. (2008). Small Satellites: Past, Present, and Future. Aerospace Press. p. 159. ISBN 9781884989223.
  46. ^ Vollmer, Michael; Möllmann, Klaus-Peter (2011). Infrared Thermal Imaging: Fundamentals, Research and Applications. John Wiley & Sons. pp. 36–38. ISBN 9783527641550.
  47. ^ Sims, Ralph (Oct 1, 1998). "Cobalt Qube Microserver". Linux Journal.
  48. ^ Kov´acs, Gergely; Nagy, Benedek Nagy; Stomfai, Gergely; Turgay, Nes¸et Deni̇z; Vizv´ari, B´ela (2021). "On Chamfer Distances on the Square and Body-Centered CubicGrids: An Operational Research Approach". Mathematical Problems in Engineering: 1–9. doi:10.1155/2021/5582034. hdl:10831/111490.
  49. ^ Chin, Daniel Jie Yuan Chin; Mohamed, Ahmad Sufril Azlan; Shariff, Khairul Anuar; Ishikawa, Kunio (23–25 November 2021). "GPU-Accelerated Enhanced Marching Cubes 33 for Fast 3D Reconstruction of Large Bone Defect CT Images". In Zaman, Halimah Badioze; Smeaton, Alan; Shih, Timothy; Velastin, Sergio; Terutoshi, Tada; Jørgensen, Bo Nørregaard; Aris, Hazleen Aris; Ibrahim, Nazrita Ibrahim (eds.). Advances in Visual Informatics. 7th International Visual Informatics Conference. Kajang, Malaysia. p. 376.
  50. ^ Greene, N (1986). "Environment Mapping and Other Applications of World Projections". IEEE Computer Graphics and Applications. 6 (11): 21–29. Bibcode:1986ICGA....6k..21G. doi:10.1109/MCG.1986.276658. S2CID 11301955.
  51. ^ Kraus, John D.; Fleisch, Daniel A. (1999). Electromagnetics With Applications. Boston: McGraw Hill. p. 324. ISBN 0-07-289969-7. LCCN 98-34935.
  52. ^ Domokos, Gábor; Jerolmack, Douglas J.; Kun, Ferenc; Török, János (2020). "Plato's Cube and the Natural Geometry of Fragmentation". Proceedings of the National Academy of Sciences of the United States of America. 117 (31): 18178–18185. arXiv:1912.04628. Bibcode:2020PNAS..11718178D. doi:10.1073/pnas.2001037117. PMID 32680966.
  53. ^ Heath, Thomas L. (1908). The Thirteen Books of Euclid's Elements (3rd ed.). Cambridge University Press. pp. 262, 478, 480.
  54. ^ Cromwell (1997), p. 55.
  55. ^ Livio, Mario (2003) [2002]. The Golden Ratio: The Story of Phi, the World's Most Astonishing Number (1st trade paperback ed.). Broadway Books. p. 147. ISBN 9780767908160.
  56. ^ Jeon, Kyungsoon (2009). "Mathematics Hiding in the Nets for a CUBE". Teaching Children Mathematics. 15 (7): 394–399. doi:10.5951/TCM.15.7.0394. JSTOR 41199313.
  57. ^ Turney, Peter D. (1984–1985). "Unfolding the Tesseract". Journal of Recreational Mathematics. 17 (1).
  58. ^ Smith, James (2000). Methods of Geometry. John Wiley & Sons. p. 392. ISBN 9781118031032.
  59. ^ Kozachok, Marina (2012). "Perfect Prismatoids and the Conjecture Concerning with Face Numbers of Centrally Symmetric Polytopes". Yaroslavl International Conference "Discrete Geometry" Dedicated to the Centenary of A.D. Alexandrov (Yaroslavl, August 13-18, 2012) (PDF). P.G. Demidov Yaroslavl State University, International B.N. Delaunay Laboratory. pp. 46–49.
  60. ^ Grünbaum, Branko (2003). "13.1 Steinitz's Theorem". Convex Polytopes. Graduate Texts in Mathematics. Vol. 221 (2nd ed.). Springer-Verlag. pp. 235–244. ISBN 0387404090.
  61. ^ Ziegler, Günter M. (1995). "Chapter 4: Steinitz' Theorem for 3-Polytopes". Lectures on Polytopes. Graduate Texts in Mathematics. Vol. 152. Springer-Verlag. pp. 103–126. ISBN 038794365X.
  62. ^ Rudolph, Michael (2022). The Mathematics of Finite Networks: An Introduction to Operator Graph Theory. Cambridge University Press. p. 25. doi:10.1017/9781316466919. ISBN 9781316466919.
  63. ^ Pisanski, Tomaž; Servatius, Brigitte (2013). Configuration from a Graphical Viewpoint. Springer. p. 21. doi:10.1007/978-0-8176-8364-1. ISBN 9780817683634.
  64. ^ Harary, F.; Hayes, J. P.; Wu, H.-J. (1988). "A Survey of the Theory of Hypercube Graphs". Computers & Mathematics with Applications. 15 (4): 277–289. doi:10.1016/0898-1221(88)90213-1. hdl:2027.42/27522.
  65. ^ Chartrand, Gary; Zhang, Ping (2012). A First Course in Graph Theory. Dover Publications. p. 25. ISBN 9780486297309.
  66. ^ Gross, Jonathan L.; Yellen, Yellen (2006). Graph Theory and Its Applications, Second Edition. Taylor & Francis. p. 273. ISBN 9781584885054.
  67. ^ Horvat, Boris; Pisanski, Tomaž (2010). "Products of Unit Distance Graphs". Discrete Mathematics. 310 (12): 1783–1792. doi:10.1016/j.disc.2009.11.035. MR 2610282.
  68. ^ a b Berman, Leah (2014). "Geometric Constructions for Symmetric 6-Configurations". In Connelly, Robert; Weiss, Asia; Whiteley, Walter (eds.). Rigidity and Symmetry. Fields Institute Communications. Vol. 70. Springer. p. 84. doi:10.1007/978-1-4939-0781-6. ISBN 9781493907816.
  69. ^ Aldous, Joan; Wilson, Robin (2000). Graphs and Applications: An Introductory Approach. Springer. ISBN 9781852332594.
  70. ^ Kitaev, Sergey; Lozin, Vadim (2015). Words and Graphs. p. 171. doi:10.1007/978-3-319-25859-1. ISBN 9783319258591.
  71. ^ Hasan, Masud; Hossain, Mohammad M.; López-Ortiz, Alejandro; Nusrat, Sabrina; Quader, Saad A.; Rahman, Nabila (2010). "Some New Equiprojective Polyhedra". arXiv:1009.2252 [cs.CG].
  72. ^ Coxeter, H.S.M. (1973). Regular Polytopes (3rd ed.). New York: Dover Publications. pp. 122–123. See §1.8 Configurations.
  73. ^ Inchbald, Guy (2006). "Facetting Diagrams". The Mathematical Gazette. 90 (518): 253–261. doi:10.1017/S0025557200179653. JSTOR 40378613.
  74. ^ Rajwade, A. R. (2001). Convex Polyhedra with Regularity Conditions and Hilbert's Third Problem. Texts and Readings in Mathematics. Hindustan Book Agency. p. 84–89. doi:10.1007/978-93-86279-06-4. ISBN 9789386279064.
  75. ^ Slobodan, Mišić; Obradović, Marija; Ðukanović, Gordana (2015). "Composite Concave Cupolae as Geometric and Architectural Forms" (PDF). Journal for Geometry and Graphics. 19 (1): 79–91.
  76. ^ Langer, Joel C.; Singer, David A. (2010). "Reflections on the Lemniscate of Bernoulli: The Forty-Eight Faces of a Mathematical Gem". Milan Journal of Mathematics. 78 (2): 643–682. doi:10.1007/s00032-010-0124-5.
  77. ^ Coxeter (1973), p. 71.
  78. ^ Holme, A. (2010). Geometry: Our Cultural Heritage. Springer. doi:10.1007/978-3-642-14441-7. ISBN 9783642144417.
  79. ^ Cromwell (1997), pp. 81–82.
  80. ^ Linti, G. (2013). "Catenated Compounds - Group 13 [Al, Ga, In, Tl]". In Reedijk, J.; Poeppelmmeier, K. (eds.). Comprehensive Inorganic Chemistry II: From Elements to Applications. Newnes. p. 41. ISBN 9780080965291.
  81. ^ Viana, Vera; Xavier, João Pedro; Aires, Ana Paula; Campos, Helena (2019). "Interactive Expansion of Achiral Polyhedra". In Cocchiarella, Luigi (ed.). ICGG 2018 - Proceedings of the 18th International Conference on Geometry and Graphics 40th Anniversary - Milan, Italy, August 3-7, 2018. Advances in Intelligent Systems and Computing. Vol. 809. Springer. p. 1123. doi:10.1007/978-3-319-95588-9. ISBN 9783319955872. See Fig. 6.
  82. ^ Gelişgen, Özcan; Yavuz, Serhat (2019). "Isometry Groups of Chamfered Cube and Chamfered Octahedron Spaces". Mathematical Sciences and Applications E-Notes. 7 (2): 174–182. doi:10.36753/mathenot.542272.
  83. ^ Deza, Antoinea; Michel, Deza; Grishukhin, Viatcheslav (1998). "Fullerenes and Coordination Polyhedra versus Half-cube Embeddings". Discrete Mathematics. 192 (1–3): 41–80. doi:10.1016/S0012-365X(98)00065-X.
  84. ^ Cromwell (1997), p. 70.
  85. ^ Barnes, John (2012). Gems of Geometry (2nd ed.). Springer. p. 82. doi:10.1007/978-3-642-30964-9. ISBN 9783642309649.
  86. ^ Cundy, H. Martyn (1956). "2642. Unitary Construction of Certain Polyhedra". The Mathematical Gazette. 40 (234): 280–282. doi:10.2307/3609622. JSTOR 3609622.
  87. ^ Lunnon, W. F. (1972). "Symmetry of Cubical and General Polyominoes". In Read, Ronald C. (ed.). Graph Theory and Computing. New York: Academic Press. pp. 101–108. ISBN 9781483255125.
  88. ^ Kemp, Martin (1 January 1998). "Dali's Dimensions". Nature. 391 (27): 27. Bibcode:1998Natur.391...27K. doi:10.1038/34063.
  89. ^ Fowler, David (2010). "Mathematics in Science Fiction: Mathematics as Science Fiction". World Literature Today. 84 (3): 48–52. doi:10.1353/wlt.2010.0188. JSTOR 27871086. S2CID 115769478. 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).
  90. ^ 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).
  91. ^ Hall, T. Proctor (1893). "The Projection of Fourfold Figures on a Three-flat". American Journal of Mathematics. 15 (2): 179–189. doi:10.2307/2369565. JSTOR 2369565.
  92. ^ Lagarias, J. C.; Moews, D. (1995). "Polytopes that Fill R n {\displaystyle \mathbb {R} ^{n}} {\displaystyle \mathbb {R} ^{n}} and Scissors Congruence". Discrete & Computational Geometry. 13 (3–4): 573–583. doi:10.1007/BF02574064. MR 1318797.
  93. ^ Erdahl, R. M. (1999). "Zonotopes, Dicings, and Voronoi's Conjecture on Parallelohedra". European Journal of Combinatorics. 20 (6): 527–549. doi:10.1006/eujc.1999.0294. MR 1703597.. Voronoi conjectured that all tilings of higher-dimensional spaces by translates of a single convex polytope are combinatorially equivalent to Voronoi tilings, and Erdahl proves this in the special case of zonotopes. But as he writes (p. 429), Voronoi's conjecture for dimensions at most four was already proven by Delaunay. For the classification of three-dimensional parallelohedra into these five types, see Grünbaum, Branko; Shephard, G. C. (1980). "Tilings with congruent tiles". Bulletin of the American Mathematical Society. New Series. 3 (3): 951–973. doi:10.1090/S0273-0979-1980-14827-2. MR 0585178.
  94. ^ Horváth, Ákos G. (1995). "On Dirichlet–Voronoi Cell, Part I: Classical Problems". Periodica Polytechnica Mechanical Engineering. 39 (1): 25–42.
  95. ^ In higher dimensions, however, there exist parallelopes that are not zonotopes. See e.g. Shephard, G. C. (1974). "Space-filling Zonotopes". Mathematika. 21 (2): 261–269. doi:10.1112/S0025579300008652. MR 0365332.
  96. ^ Coxeter, H. S. M. (1968). The Beauty of Geometry: Twelve Essays. Dover Publications. p. 167. ISBN 9780486409191. See table III.
  97. ^ a b Nelson, Roice; Segerman, Henry (2017). "Visualizing Hyperbolic Honeycombs". Journal of Mathematics and the Arts. 11 (1): 4–39. arXiv:1511.02851. doi:10.1080/17513472.2016.1263789.
  98. ^ Akiyama, Jin; Matsunaga, Kiyoko (2015). "15.3 Hilbert's Third Problem and Dehn Theorem". Treks Into Intuitive Geometry. Springer Tokyo. pp. 382–388. doi:10.1007/978-4-431-55843-9. ISBN 9784431558415. MR 3380801.
  99. ^ Gruber, Peter M. (2007). "Chapter 16: Volume of Polytopes and Hilbert's Third Problem". Convex and Discrete Geometry. Grundlehren der mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]. Vol. 336. Springer, Berlin. pp. 280–291. doi:10.1007/978-3-540-71133-9. ISBN 9783540711322. MR 2335496.
  100. ^ Zeeman, E. C. (July 2002). "On Hilbert's third problem". The Mathematical Gazette. 86 (506): 241–247. doi:10.2307/3621846. JSTOR 3621846.
  101. ^ Skilling, John (1976). "Uniform Compounds of Uniform Polyhedra". Mathematical Proceedings of the Cambridge Philosophical Society. 79 (3): 447–457. Bibcode:1976MPCPS..79..447S. doi:10.1017/S0305004100052440. MR 0397554.
  102. ^ Hart, George (16–20 July 2019). "Max Brücknerʼs Wunderkammer of Paper Polyhedra" (PDF). In Goldstein, Susan; McKenna, Douglas; Fenyvesi, Kristóf (eds.). Bridges 2019 Conference Proceedings. Linz, Austria: Tessellations Publishing, Phoenix, Arizona. ISBN 9781938664304.
  103. ^ a b Yackel, Carolyn (26–30 July 2013). "Marking a Physical Sphere with a Projected Platonic Solid" (PDF). In Kaplan, Craig; Sarhangi, Reza (eds.). Proceedings of Bridges 2009: Mathematics, Music, Art, Architecture, Culture. Banff, Alberta, Canada. pp. 123–130. ISBN 9780966520200.
  104. ^ Popko, Edward S. (2012). Divided Spheres: Geodesics and the Orderly Subdivision of the Sphere. CRC Press. pp. 100–101. ISBN 9781466504295.
  105. ^ Fuller, Buckimster (1975). Synergetics: Explorations in the Geometry of Thinking. MacMillan Publishing. p. 173. ISBN 9780020653202.
  106. ^ Marat, Ton (2022). A Ludic Journey into Geometric Topology. Springer. p. 112. doi:10.1007/978-3-031-07442-4. ISBN 9783031074424.
  107. ^ Bunde, Armin; Havlin, Shlomo (2013). Fractals in Science. Springer. p. 7. ISBN 9783642779534.
  108. ^ Husain, Sakhlaq (2025). "On Jerusalem Square Fractal, Its Construction and Properties". Annals of Communications in Mathematics. 8 (2): 293–298. doi:10.62072/acm.2025.080211. ISSN 2582-0818.
  109. ^ Regueiro, Manuel Diaz; Allegue, Luis Diaz (July 7, 2023). "An Algorithm for Extending Menger-type Fractal Structures" (PDF). Hyperseeing: Proceedings of SMI-SCULPT 2023: Shape Modeling International 2023, Shape Creation Using Layouts, Programs, & Technology (SCULPT) Event: Twenty-second Interdisciplinary Conference of the International Society of the Arts, Mathematics, and Architecture (PDF). pp. 55–62. ISBN 9781387733309.