Search Results for ""

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

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

The number of nondecreasing lists {a_1,a_2,...,a_n} consisting of n elements 1<=a_i<=k is given by the binomial coefficient N(n,k)=(n+k-1; n-1). For example, there are six ...

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

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 hexecontahedral graph is the Archimedean dual graph which is the skeleton of the pentagonal hexecontahedron. It is implemented in the Wolfram Language as ...

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

The maximum distance between n points in three dimensions can occur no more than 2n-2 times. Also, there exists a fixed number c such that no distance determined by a set of ...