Search Results for ""

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

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

A number of attractive 6-compounds of the regular dodecahedron can be constructed. The first (left figures) can be obtained by combining six dodecahedra, each rotated by 1/10 ...

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

For a graph G and a subset S of the vertex set V(G), denote by N_G[S] the set of vertices in G which are in S or adjacent to a vertex in S. If N_G[S]=V(G), then S is said to ...

A doublecross graph is a graph with graph crossing number 2. The numbers of doublecross simple graphs on n=1 nodes are 0, 0, 0, 0, 0, 1, 39, ..., and the numbers of connected ...

A knot K is an n-embeddable knot if it can be placed on a genus n standard embedded surface without crossings, but K cannot be placed on any standardly embedded surface of ...

A theorem sometimes called "Euclid's first theorem" or Euclid's principle states that if p is a prime and p|ab, then p|a or p|b (where | means divides). A corollary is that ...

Let U(P,Q) and V(P,Q) be Lucas sequences generated by P and Q, and define D=P^2-4Q. (1) Then {U_((n-(D/n))/2)=0 (mod n) when (Q/n)=1; V_((n-(D/n))/2)=D (mod n) when (Q/n)=-1, ...

An experiment E(S,F,P) is defined (Papoulis 1984, p. 30) as a mathematical object consisting of the following elements. 1. A set S (the probability space) of elements. 2. A ...