TOPICS
Search

Search Results for ""


51 - 60 of 371 for Permutation combinationsSearch Results
An ordering for the Cartesian product × of any two sets A and B with order relations <A and <B, respectively, such that if (a_1,b_1) and (a_2,b_2) both belong to A×B, then ...
In 1979, Conway and Norton discovered an unexpected intimate connection between the monster group M and the j-function. The Fourier expansion of j(tau) is given by (1) (OEIS ...
Given a commutative unit ring R and a filtration F:... subset= I_2 subset= I_1 subset= I_0=R (1) of ideals of R, the Rees ring of R with respect to F is R_+(F)=I_0 direct sum ...
Given rods of length 1, 2, ..., n, how many distinct triangles T(n) can be made? Lengths for which l_i>=l_j+l_k (1) obviously do not give triangles, but all other ...
A truth table is a two-dimensional array with n+1 columns. The first n columns correspond to the possible values of n inputs, and the last column to the operation being ...
A game played with two heaps of counters in which a player may take any number from either heap or the same number from both. The player taking the last counter wins. The rth ...
In general, an arrangement of objects is simply a grouping of them. The number of "arrangements" of n items is given either by a combination (order is ignored) or permutation ...
Every finite group of order n can be represented as a permutation group on n letters, as first proved by Cayley in 1878 (Rotman 1995).
A subset tau in S_n of a permutation {1,...,n} is said to contain alpha in S_k if there exist 1<=i_1<...<i_k<=n such that tau=(tau_i,...,tau_k) is order isomorphic to ...
Let A, B, and C be three polar vectors, and define V_(ijk) = |A_i B_i C_i; A_j B_j C_j; A_k B_k C_k| (1) = det[A B C], (2) where det is the determinant. The V_(ijk) is a ...
1 ... 3|4|5|6|7|8|9 ... 38 Previous Next

...