Search Results for ""

Linear programming, sometimes known as linear optimization, is the problem of maximizing or minimizing a linear function over a convex polyhedron specified by linear and ...

Geometry is the study of figures in a space of a given number of dimensions and of a given type. The most common types of geometry are plane geometry (dealing with objects ...

The Heawood graph is a cubic graph on 14 vertices and 21 edges which is the unique (3,6)-cage graph. It is also a Moore graph. It has graph diameter 3, graph radius 3, and ...

Consider the plane quartic curve X defined by x^3y+y^3z+z^3x=0, where homogeneous coordinates have been used here so that z can be considered a parameter (the plot above ...

The compound of a truncated tetrahedron and its dual, the triakis tetrahedron. The compound can be constructed from a truncated octahedron of unit edge length by midpoint ...

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

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

A cube 7-compound can be constructed by combining a cube 6-compound with the original cube used to generate it. It will be implemented in a future version of the Wolfram ...

A number of attractive 10-compounds of the regular dodecahedron can be constructed. The compound illustrated above will be implemented in a future version of the Wolfram ...