Search Results for ""
551 - 560 of 854 for Random permutationSearch Results
The five Mathieu groups M_(11), M_(12), M_(22), M_(23), and M_(24) were the first sporadic groups discovered, having been found in 1861 and 1873 by Mathieu. Frobenius showed ...
A permutation problem invented by Cayley. Let the numbers 1, 2, ..., n be written on a set of cards, and shuffle this deck of cards. Now, start counting using the top card. ...
Multiple edges are two or more edges connecting the same two vertices within a multigraph. Multiple edges of degree d_(ij) between vertex i and vertex j correspond to an ...
The continued fraction for ln10 is [0; 1, 2, 3, 1, 6, 3, 1, 1, 2, 1, 1, 1, 1, 3, 10, ...] (OEIS A016730). The Engel expansion is 2, 3, 7, 9, 104, 510, 1413, ... (OEIS ...
The Pauli matrices, also called the Pauli spin matrices, are complex matrices that arise in Pauli's treatment of spin in quantum mechanics. They are defined by sigma_1 = ...
A quintic graph is a graph which is 5-regular. The only quintic graph on n<=7 nodes is the complete graph K_6. Quintic graphs exist only on even numbers of nodes, and the ...
A rooted graph is a graph in which one node is labeled in a special way so as to distinguish it from other nodes. The special node is called the root of the graph. The rooted ...
The scalar triple product of three vectors A, B, and C is denoted [A,B,C] and defined by [A,B,C] = A·(BxC) (1) = B·(CxA) (2) = C·(AxB) (3) = det(ABC) (4) = |A_1 A_2 A_3; B_1 ...
Let c_1, c_2, and c_3 be the circles through the vertices A_2 and A_3, A_1 and A_3, and A_1 and A_2, respectively, which intersect in the first Brocard point Omega. ...
A singular point of an algebraic curve is a point where the curve has "nasty" behavior such as a cusp or a point of self-intersection (when the underlying field K is taken as ...
...
View search results from all Wolfram sites (14845 matches)

