Search Results for ""
1261 - 1270 of 3987 for Lawof Large NumbersSearch Results
A siteswap is a sequence encountered in juggling in which each term is a positive integer, encoded in binary. The transition rule from one term to the next consists of ...
Solid partitions are generalizations of plane partitions. MacMahon (1960) conjectured the generating function for the number of solid partitions was ...
Sorting is the rearrangement of numbers (or other orderable objects) in a list into their correct lexographic order. Alphabetization is therefore a form of sorting. Because ...
A matrix for which horizontal and vertical dimensions are the same (i.e., an n×n matrix). A matrix m may be tested to determine if it is square in Wolfram Language using ...
The distribution of a variable is a description of the relative numbers of times each possible outcome will occur in a number of trials. The function describing the ...
A Steiner system S(t,k,v) is a set X of v points, and a collection of subsets of X of size k (called blocks), such that any t points of X are in exactly one of the blocks. ...
A strongly binary tree is a rooted tree for which the root is adjacent to either zero or two vertices, and all non-root vertices are adjacent to either one or three vertices ...
The total domination number gamma_t of a graph is the size of a smallest total dominating set, where a total dominating set is a set of vertices of the graph such that all ...
A triangle tiling is a tiling of the plane by identical triangles. Any triangle tiles the plane (Wells 1991, p. 208). The total number of triangles (including inverted ones) ...
On July 10, 2003, Eric Weisstein computed the numbers of n×n (0,1)-matrices all of whose eigenvalues are real and positive, obtaining counts for n=1, 2, ... of 1, 3, 25, 543, ...
...
View search results from all Wolfram sites (41452 matches)

