Search Results for ""

The hypergeometric orthogonal polynomials defined by P_n^((lambda))(x;phi)=((2lambda)_n)/(n!)e^(inphi)_2F_1(-n,lambda+ix;2lambda;1-e^(-2iphi)), (1) where (x)_n is the ...

where _8phi_7 is a q-hypergeometric function.

_8phi_7[a,qa^(1/2),-qa^(1/2),b,c,d,e,q^(-N); a^(1/2),-a^(1/2),(aq)/b,(aq)/c,(aq)/d,(aq)/e,aq^(N+1);q,(aq^(N+2))/(bcde)] ...

The Chu-Vandermonde identity _2F_1(-n,b;c;1)=((c-b)_n)/((c)_n) (1) (for n in Z^+) is a special case of Gauss's hypergeometric theorem _2F_1(a,b;c;1) = ((c-b)_(-a))/((c)_(-a)) ...

A q-analog of the Chu-Vandermonde identity given by where _2phi_1(a,b;c;q,z) is the q-hypergeometric function. The identity can also be written as ...

A q-analog of Gauss's theorem due to Jacobi and Heine, _2phi_1(a,b;c;q,c/(ab))=((c/a;q)_infty(c/b;q)_infty)/((c;q)_infty(c/(ab);q)_infty) (1) for |c/(ab)|<1 (Gordon and ...

A reduction system is called finitely terminating (or Noetherian) if there are no infinite rewriting sequences. This property guarantees that any rewriting algorithm will ...

A system in which words (expressions) of a formal language can be transformed according to a finite set of rewrite rules is called a reduction system. While reduction systems ...

Term rewriting systems are reduction systems in which rewrite rules apply to terms. Terms are built up from variables and constants using function symbols (or operations). ...

Catalan's constant is a constant that commonly appears in estimates of combinatorial functions and in certain classes of sums and definite integrals. It is usually denoted K ...