Assumptions:
TeX:
R_{-a}\!\left(\left[b_{1}, b_{2}, \ldots, b_{n}\right], \left[z_{1}, z_{2}, \ldots, z_{n}\right]\right) = z_{n}^{-a} \sum_{N=0}^{\infty} \frac{\left(a\right)_{N}}{\left(c\right)_{N}} T_{N}\!\left(\left[b_{1}, b_{2}, \ldots, b_{n - 1}\right], \left[1 - \frac{z_{1}}{z_{n}}, 1 - \frac{z_{2}}{z_{n}}, \ldots, 1 - \frac{z_{n - 1}}{z_{n}}\right]\right)\; \text{ where } c = \sum_{k=1}^{n} b_{k} a \in \mathbb{R} \;\mathbin{\operatorname{and}}\; n \in \mathbb{Z}_{\ge 1} \;\mathbin{\operatorname{and}}\; \left(b_{k} \in \mathbb{R} \;\text{ for all } k \in \{1, 2, \ldots, n\}\right) \;\mathbin{\operatorname{and}}\; z_{n} \in \mathbb{C} \setminus \left\{0\right\} \;\mathbin{\operatorname{and}}\; \left(z_{k} \in \mathbb{C} \;\mathbin{\operatorname{and}}\; \left|1 - \frac{z_{k}}{z_{n}}\right| < 1 \;\text{ for all } k \in \{1, 2, \ldots, n - 1\}\right) \;\mathbin{\operatorname{and}}\; \sum_{k=1}^{n} b_{k} > 0 \;\mathbin{\operatorname{and}}\; \left(\operatorname{Re}\!\left(z_{k}\right) > 0 \;\text{ for all } k \in \{1, 2, \ldots, n\}\right)
Definitions:
Fungrim symbol | Notation | Short description |
---|---|---|
CarlsonHypergeometricR | Carlson multivariate hypergeometric function | |
Pow | Power | |
Sum | Sum | |
RisingFactorial | Rising factorial | |
CarlsonHypergeometricT | Term in expansion of Carlson multivariate hypergeometric function | |
Infinity | Positive infinity | |
RR | Real numbers | |
ZZGreaterEqual | Integers greater than or equal to n | |
Range | Integers between given endpoints | |
CC | Complex numbers | |
Abs | Absolute value | |
Re | Real part |
Source code for this entry:
Entry(ID("2443de"), Formula(Where(Equal(CarlsonHypergeometricR(Neg(a), List(b_(k), For(k, 1, n)), List(z_(k), For(k, 1, n))), Mul(Pow(z_(n), Neg(a)), Sum(Mul(Div(RisingFactorial(a, N), RisingFactorial(c, N)), CarlsonHypergeometricT(N, List(b_(k), For(k, 1, Sub(n, 1))), List(Sub(1, Div(z_(k), z_(n))), For(k, 1, Sub(n, 1))))), For(N, 0, Infinity)))), Def(c, Sum(b_(k), For(k, 1, n))))), Variables(a, b_, z_, n), Assumptions(And(Element(a, RR), Element(n, ZZGreaterEqual(1)), All(Element(b_(k), RR), ForElement(k, Range(1, n))), Element(z_(n), SetMinus(CC, Set(0))), All(And(Element(z_(k), CC), Less(Abs(Sub(1, Div(z_(k), z_(n)))), 1)), ForElement(k, Range(1, Sub(n, 1)))), Greater(Sum(b_(k), For(k, 1, n)), 0), All(Greater(Re(z_(k)), 0), ForElement(k, Range(1, n))))))