Search Results for ""

A cube 30-compound can be constructed from the vertices of the first dodecahedron 6-compound. It will be implemented in a future version of the Wolfram Language as ...

A cube 35-compound can be constructed as the dual of the octahedron 35-compound. It will be implemented in a future version of the Wolfram Language as ...

There are a number of attractive polyhedron compounds involving four cubes, several of which are illustrated above. The first (left figures), also known as Bakos' compound, ...

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 ...

The n-hypercube graph, also called the n-cube graph and commonly denoted Q_n or 2^n, is the graph whose vertices are the 2^k symbols epsilon_1, ..., epsilon_n where ...

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)) ...

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 ...