TOPICS
Search

Search Results for ""


141 - 150 of 426 for coefficient of admissionSearch Results
The Wigner 3j-symbols (j_1 j_2 j_3; m_1 m_2 m_3), also known as "3j symbols" (Messiah 1962, p. 1056) or Wigner coefficients (Shore and Menzel 1968, p. 275) are quantities ...
Two patterns T_1 and T_2 belong to the same Wilf class if |S_n(T_1)|=|S_n(T_2)| for all n, where S_n(T) denotes the set of permutations on {1,...,n} that avoid the pattern T. ...
A lattice path from one point to another is p-good if it lies completely below the line y=(p-1)x. (1) Hilton and Pederson (1991) show that the number of p-good paths from (1, ...
sum_(y=0)^m(-1)^(m-y)q^((m-y; 2))[m; y]_q(1-wq^m)/(q-wq^y) ×(1-wq^y)^m(-(1-z)/(1-wq^y);q)_y=(1-z)^mq^((m; 2)), where [n; y]_q is a q-binomial coefficient.
A q-analog of the beta function B(a,b) = int_0^1t^(a-1)(1-t)^(b-1)dt (1) = (Gamma(a)Gamma(b))/(Gamma(a+b)), (2) where Gamma(z) is a gamma function, is given by B_q(a,b) = ...
There are two kinds of Bell polynomials. A Bell polynomial B_n(x), also called an exponential polynomial and denoted phi_n(x) (Bell 1934, Roman 1984, pp. 63-67) is a ...
Roman (1984, p. 26) defines "the" binomial identity as the equation p_n(x+y)=sum_(k=0)^n(n; k)p_k(y)p_(n-k)(x). (1) Iff the sequence p_n(x) satisfies this identity for all y ...
There are several related series that are known as the binomial series. The most general is (x+a)^nu=sum_(k=0)^infty(nu; k)x^ka^(nu-k), (1) where (nu; k) is a binomial ...
A Bland-Altman plot is a data plotting method which simultaneously presents data sets from two different tests in a way that allows for easier determination of whether the ...
The Euler polynomial E_n(x) is given by the Appell sequence with g(t)=1/2(e^t+1), (1) giving the generating function (2e^(xt))/(e^t+1)=sum_(n=0)^inftyE_n(x)(t^n)/(n!). (2) ...
1 ... 12|13|14|15|16|17|18 ... 43 Previous Next

...