SumTools[Hypergeometric]
RegularGammaForm
construct the regular Gamma-function representation of a hypergeometric term
Calling Sequence
Parameters
Description
Examples
RegularGammaForm(H, n)
H
-
hypergeometric term of n
n
variable
Let H be a hypergeometric term of n, R be the certificate of H, and n0 be an integer such that R has neither a pole nor a zero for all n0≤n. The RegularGammaForm(H,n) calling sequence returns the multiplicative decomposition of the form Hn0∏k=n0n−1Rk where the product is expressed in terms of a product of the Gamma function of the form Γn−c where c is a constant and their reciprocals.
withSumToolsHypergeometric:
H≔Product123k2+6k+42k+34k+5k+14k+3k4k−12k−14k−32k+5k+23k2+1,k=1..n−1
H≔∏k=1n−13k2+6k+42k+34k+5k+14k+32k4k−12k−14k−32k+5k+23k2+1
RegularGammaFormH,n
64π12nΓn+1−I33Γn+1+I33Γn+32Γn+54Γn+1Γn+342nΓnΓn−14Γn−12Γn−34Γn+52Γn+2Γn−I33Γn+I33
Compare the number of Gamma-function values returned from RegularGammaForm with that of any one of the four efficient representations of the input hypergeometric term Hn:
EfficientRepresentation1H,n
64π14nn2+13nn−14n+12n+14n−12n−34Γn+52Γn+2
EfficientRepresentation2H,n
64π14nn2+13n−14n+14n−34n+32n+1ΓnΓn−12
EfficientRepresentation3H,n
64π14nn−14n2+13n+14n−34nn+32Γn−12Γn+2
EfficientRepresentation4H,n
See Also
SumTools[Hypergeometric][EfficientRepresentation]
SumTools[Hypergeometric][MultiplicativeDecomposition]
SumTools[Hypergeometric][RationalCanonicalForm]
SumTools[Hypergeometric][SumDecomposition]
Download Help Document