TOPICS
Search

Search Results for ""


1491 - 1500 of 13134 for Extremal graph theorySearch Results
The Machin-like formula 1/4pi=cot^(-1)2+cot^(-1)5+cot^(-1)8.
The Suzuki group is the sporadic group Suz of order |Suz| = 448345497600 (1) = 2^(13)·3^7·5^2·7·11·13. (2) It is implemented in the Wolfram Language as SuzukiGroupSuz[].
A relation R on a set S is symmetric provided that for every x and y in S we have xRy iff yRx. The symmetric relations on n nodes are isomorphic with the rooted graphs on n ...
A relation on a totally ordered set.
A unimodal sequence is a finite sequence that first increases and then decreases. A sequence {s_1,s_2,...,s_n} is unimodal if there exists a t such that s_1<=s_2<=...<=s_t ...
A knot which is not a tame knot.
In celestial mechanics, the fixed path a planet traces as it moves around the sun is called an orbit. When a group G acts on a set X (this process is called a group action), ...
An error-correcting code is an algorithm for expressing a sequence of numbers such that any errors which are introduced can be detected and corrected (within certain ...
A Calkin-Wilf tree is a special type of binary tree obtained by starting with the fraction 1/1 and iteratively adding a/(a+b) and (a+b)/b below each fraction a/b. The ...
A special type of binary tree obtained by starting with the fractions 0/1 and 1/0 and iteratively inserting (m+m^')/(n+n^') between each two adjacent fractions m/n and ...
1 ... 147|148|149|150|151|152|153 ... 1314 Previous Next

...