Search Results for ""

There are a number of attractive cube 25-compounds. One can be constructed from the vertices of the second dodecahedron 6-compound (or second tetrahedron 50-compound) and ...

A number of attractive cube 10-compounds can be constructed. The first can be obtained by beginning with an initial cube and rotating it by an angle theta=sin^(-1)(sqrt(3/8)) ...

A number of attractive cube 6-compounds can be constructed. A first (left figures) is obtained by combining six cubes, each rotated by 1/6 of a turn about the line joining ...

The term cube is used in topology to denote the Cartesian product of any (finite or infinite) number of copies of the closed interval [0,1] equipped with the product topology ...

There are a number of attractive polyhedron compounds consisting of five cubes. The first of these (left figures) consists of the arrangement of five cubes in the polyhedron ...

Cube duplication, also called the Delian problem, is one of the geometric problems of antiquity which asks, given the length of an edge of a cube, that a second cube be ...

Attractive compounds can be constructed from the cube 3-compounds and their octahedron 3-compound duals. One is illustrated above. This compound will be implemented in a ...

The cube-octahedron compound is a polyhedron compound composed of a cube and its dual polyhedron, the octahedron. It is implemented in the Wolfram Language as ...

The 12-vertex graph consisting of a cube in which two opposite faces (say, top and bottom) have edges drawn across them which connect the centers of opposite sides of the ...

Let Y_n denote the graph with vertex set V(X_n), where X_n is the n-hypercube and two vertices are adjacent in Y_n iff they are at distance 1<=d<=2 in X_n. Y_n is not ...