Search Results for ""

Let generalized hypergeometric function _pF_q[alpha_1,alpha_2,...,alpha_p; beta_1,beta_2,...,beta_q;z] (1) have p=q+1. Then the generalized hypergeometric function is said to ...

Given a hypergeometric or generalized hypergeometric function _pF_q(a_1,...,a_p;b_1,...,b_q;z), the corresponding regularized hypergeometric function is defined by where ...

where _3F_2(a,b,c;d,e;z) is a generalized hypergeometric function and Gamma(z) is the gamma function (Bailey 1935, p. 16; Koepf 1998, p. 32).

A generalized hypergeometric function _pF_q[alpha_1,alpha_2,...,alpha_p; beta_1,beta_2,...,beta_q;z] is said to be well-poised if p=q+1 and ...

A graph G is distance transitive if its automorphism group is transitive on pairs of vertices at each pairwise distance in the graph. Distance-transitivity is a ...

_3F_2[n,-x,-y; x+n+1,y+n+1] =Gamma(x+n+1)Gamma(y+n+1)Gamma(1/2n+1)Gamma(x+y+1/2n+1) ×Gamma(n+1)Gamma(x+y+n+1)Gamma(x+1/2n+1)Gamma(y+1/2n+1), (1) where _3F_2(a,b,c;d,e;z) is a ...

Thomae's theorem, also called Thomae's transformation, is the generalized hypergeometric function identity (1) where Gamma(z) is the gamma function, _3F_2(a,b,c;e,f;z) is a ...

A graph G is said to be locally X, where X is a graph (or class of graphs), when for every vertex v, the graph induced on G by the set of adjacent vertices of V (sometimes ...

An algorithm used to recursively construct a set of objects from the smallest possible constituent parts. Given a set of k integers (a_1, a_2, ..., a_k) with a_1<a_2<...<a_k, ...

A convex planar domain in which the minimal generalized diameter is >1 always contains a circle of radius 1/3.