TOPICS
Search

Search Results for ""


41 - 50 of 371 for Permutation combinationsSearch Results
A set X whose elements can be numbered through from 1 to n, for some positive integer n. The number n is called the cardinal number of the set, and is often denoted |X| or ...
Any symmetric polynomial (respectively, symmetric rational function) can be expressed as a polynomial (respectively, rational function) in the elementary symmetric ...
The free module of rank n over a nonzero unit ring R, usually denoted R^n, is the set of all sequences {a_1,a_2,...,a_n} that can be formed by picking n (not necessarily ...
Let k be a field of finite characteristic p. Then a polynomial P(x) in k[x] is said to be additive iff P(a)+P(b)=P(a+b) for {a,b,a+b} subset k. For example, P(x)=x^2+x+4 is ...
A tree (also called a bicentral tree) having two nodes that are graph centers. The numbers of bicentered trees on n=1, 2, ... nodes are 0, 1, 0, 1, 1, 3, 4, 11, 20, 51, 108 ...
A tree (also called a central tree) having a single node that is a graph center. The numbers of centered trees on n=1, 2, ... nodes are 1, 0, 1, 1, 2, 3, 7, 12, 27, 55, 127, ...
y approx m+sigmaw, (1) where w = (2) where h_1(x) = 1/6He_2(x) (3) h_2(x) = 1/(24)He_3(x) (4) h_(11)(x) = -1/(36)[2He_3(x)+He_1(x)] (5) h_3(x) = 1/(120)He_4(x) (6) h_(12)(x) ...
The group algebra K[G], where K is a field and G a group with the operation *, is the set of all linear combinations of finitely many elements of G with coefficients in K, ...
The Hodge conjecture asserts that, for particularly nice types of spaces called projective algebraic varieties, the pieces called Hodge cycles are actually rational linear ...
The thinnest sequence which contains 1, and whenever it contains x, also contains 2x, 3x+2, and 6x+3: 1, 2, 4, 5, 8, 9, 10, 14, 15, 16, 17, ... (OEIS A005658).
1|2|3|4|5|6|7|8 ... 38 Previous Next

...