Search Results for ""
221 - 230 of 854 for Random permutationSearch Results
Connecting the centers of touching spheres in a three-dimensional Apollonian gasket by edges given a graph known as the Apollonian network. This process is illustrated above ...
Assume that n numbered pancakes are stacked, and that a spatula can be used to reverse the order of the top k pancakes for 2<=k<=n. Then the pancake sorting problem asks how ...
A die (plural "dice") is a solid with markings on each of its faces. The faces are usually all the same shape, making Platonic solids and Archimedean duals the obvious ...
A shuffle of a deck of cards obtained by successively exchanging the cards in position 1, 2, ..., n with cards in randomly chosen positions. For 4<=n<=17, the most frequent ...
Integrals over the unit square arising in geometric probability are int_0^1int_0^1sqrt(x^2+y^2)dxdy=1/3[sqrt(2)+sinh^(-1)(1)] int_0^1int_0^1sqrt((x-1/2)^2+(y-1/2)^2)dxdy ...
An event is a certain subset of a probability space. Events are therefore collections of outcomes on which probabilities have been assigned. Events are sometimes assumed to ...
The Young tableau (plural, "tableaux") of a Ferrers diagram is obtained by placing the numbers 1, ..., n in the n boxes of the diagram. A "standard" Young tableau is a Young ...
A linear extension of a partially ordered set P is a permutation of the elements p_1, p_2, ... of P such that p_i<p_j implies i<j. For example, the linear extensions of the ...
Consider a star graph S_(n+1) consisting of a central hub vertex and n spokes, but instead of placing a single point at the end of each spoke, place k points along it (in ...
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 ...
...
View search results from all Wolfram sites (14845 matches)

