TOPICS
Search

Search Results for ""


221 - 230 of 371 for Permutation combinationsSearch Results
Let f be an entire function of finite order lambda and {a_j} the zeros of f, listed with multiplicity, then the rank p of f is defined as the least positive integer such that ...
Let n be an integer such that n>=lambda_1, where lambda=(lambda_1,lambda_2,...) is a partition of n=|lambda| if lambda_1>=lambda_2>=...>=0, where lambda_i are a sequence of ...
The solid cut from a horizontal cylinder of length L and radius R by a single plane oriented parallel to the cylinder's axis of symmetry (i.e., a portion of a horizontal ...
For an n×n matrix, let S denote any permutation e_1, e_2, ..., e_n of the set of numbers 1, 2, ..., n, and let chi^((lambda))(S) be the character of the symmetric group ...
In determinant expansion by minors, the minimal number of transpositions of adjacent columns in a square matrix needed to turn the matrix representing a permutation of ...
The (associated) Legendre function of the first kind P_n^m(z) is the solution to the Legendre differential equation which is regular at the origin. For m,n integers and z ...
The limaçon trisectrix is a trisectrix that is a special case of the rose curve with n=1/3 (possibly with translation, rotation, and scaling). It was studied by Archimedes, ...
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 ...
The Livingstone graph is a distance-transitive graph on 266 vertices defined in terms of the Janko group J_1. It has intersection array {11,10,6,1;1,1,5,11}. The Livingstone ...
A lattice L is locally bounded if and only if each of its finitely generated sublattices is bounded. Every locally bounded lattice is locally subbounded, and every locally ...
1 ... 20|21|22|23|24|25|26 ... 38 Previous Next

...