Search Results for ""
1441 - 1450 of 2033 for Clebsch graphSearch Results
Stern's diatomic series is the sequence 1, 1,2, 1,3,2,3, 1,4,3,5,2,5,3,4, (1) ... (OEIS A002487) which arises in the Calkin-Wilf tree. It is sometimes also known as the fusc ...
The Szilassi polyhedron is a heptahedron that is topologically equivalent to a torus and for which every pair of faces has a polygon edge in common. The Szilassi polyhedron ...
The taxicab metric, also called the Manhattan distance, is the metric of the Euclidean plane defined by g((x_1,y_1),(x_2,y_2))=|x_1-x_2|+|y_1-y_2|, for all points ...
The voter model is a simple mathematical model of opinion formation in which voters are located at the nodes of a network, each voter has an opinion (in the simplest case, 0 ...
A k-subset is a subset of a set on n elements containing exactly k elements. The number of k-subsets on n elements is therefore given by the binomial coefficient (n; k). For ...
Let v be a n-vector whose entries are each 1 (with probability p) or 0 (with probability q=1-p). An s-run is an isolated group of s consecutive 1s. Ignoring the boundaries, ...
Let a chess piece make a tour on an n×n chessboard whose squares are numbered from 1 to n^2 along the path of the chess piece. Then the tour is called a magic tour if the ...
A rooted tree is a tree in which a special ("labeled") node is singled out. This node is called the "root" or (less commonly) "eve" of the tree. Rooted trees are equivalent ...
The "15 puzzle" is a sliding square puzzle commonly (but incorrectly) attributed to Sam Loyd. However, research by Slocum and Sonneveld (2006) has revealed that Sam Loyd did ...
Bridge is a card game played with a normal deck of 52 cards. The number of possible distinct 13-card hands is N=(52; 13)=635013559600, (1) where (n; k) is a binomial ...
...
View search results from all Wolfram sites (12734 matches)

