Search Results for ""

There are a number of attractive polyhedron compounds consisting of 30 octahedra. This compound will be implemented in a future version of the Wolfram Language as ...

There are a number of attractive polyhedron compounds consisting of 35 octahedra. This compound will be implemented in a future version of the Wolfram Language as ...

There are a number of attractive polyhedron compounds consisting of six octahedra. The two illustrated above can be constructed as the duals of cube 6-compounds. These ...

There are a number of attractive polyhedron compounds consisting of seven octahedra. The compound illustrated above can be constructed as the dual of cube 7-compound. The ...

The number of "arrangements" in an ordering of n items is given by either a combination (order is ignored) or a permutation (order is significant). An ordering (or order) is ...

An Ore graph is a graph that satisfies Ore's theorem, i.e., a graph G for which the sums of the degrees of nonadjacent vertices is greater than or equal to the number of ...

A permutation of n distinct, ordered items in which none of the items is in its original ordered position is known as a derangement. If some, but not necessarily all, of the ...

The number of partitions of n with k or fewer addends, or equivalently, into partitions with no element greater than k. This function is denoted q(n,k) or q_k(n). (Note that ...

The pentagonal icositetrahedral graph is the Archimedean dual graph which is the skeleton of the pentagonal icositetrahedron. It is implemented in the Wolfram Language as ...

Let G be a Lie group and let rho be a group representation of G on C^n (for some natural number n), which is continuous in the sense that the function G×C^n->C^n defined by ...