TOPICS
Search

Search Results for ""


191 - 200 of 371 for Permutation combinationsSearch Results
A homework problem proposed in Steffi's math class in January 2003 asked students to prove that no ratio of two unequal numbers obtained by permuting all the digits 1, 2, ...
The asymptotic series for the gamma function is given by (1) (OEIS A001163 and A001164). The coefficient a_n of z^(-n) can given explicitly by ...
A symmetric polynomial on n variables x_1, ..., x_n (also called a totally symmetric polynomial) is a function that is unchanged by any permutation of its variables. In other ...
Transitivity is a result of the symmetry in the group. A group G is called transitive if its group action (understood to be a subgroup of a permutation group on a set Omega) ...
Any square matrix A can be written as a sum A=A_S+A_A, (1) where A_S=1/2(A+A^(T)) (2) is a symmetric matrix known as the symmetric part of A and A_A=1/2(A-A^(T)) (3) is an ...
An antisymmetric (also called alternating) tensor is a tensor which changes sign when two indices are switched. For example, a tensor A^(x_1,...,x_n) such that ...
Let the values of a function f(x) be tabulated at points x_i equally spaced by h=x_(i+1)-x_i, so f_1=f(x_1), f_2=f(x_2), ..., f_5=f(x_5). Then Boole's rule approximating the ...
The bootstrap method is a computer-based method for assigning measures of accuracy to sample estimates (Efron and Tibshirani 1994). This technique allows estimation of the ...
Use the definition of the q-series (a;q)_n=product_(j=0)^(n-1)(1-aq^j) (1) and define [N; M]=((q^(N-M+1);q)_M)/((q;q)_m). (2) Then P. Borwein has conjectured that (1) the ...
Given a permutation {p_1,p_2,...,p_n} of {1,...,n}, the bumping algorithm constructs a standard Young tableau by inserting the p_i one by one into an already constructed ...
1 ... 17|18|19|20|21|22|23 ... 38 Previous Next

...