construct the minimal additive decomposition of a hypergeometric term
SumDecomposition(T, n, k, newT, opts)
hypergeometric term of n
(optional) name; the index variable to use in the output
(optional) name; will be assigned an equivalent expression for T
(optional) equation(s) of the form keyword=value; possible keywords are minimize or maxiterations
The following optional arguments can be used if T is a rational function of n.
minimize=v, where v is either a numeric value between 0 and 1 or one of "numerator", "sum denominator", "combined", "left", "right".
If v="sum denominator", then the degree g of the denominator of T1 will be minimized.
If v="numerator", then the degree e of the numerator of T2 will be minimized.
If v="combined", then then the sum of the degrees g+e will be minimized.
If v is a numeric constant between 0 and 1, then the weighted sum of the degrees v⁢g+1−v⁢e will be minimized.
Note that small values of v may lead to time-consuming search; the option maxiterations (see below) can be used to restrict it.
If v="left", then the remainder of the result will be aligned such that gcd⁡denom⁡T1,denom⁡T2n=n+k|denom⁡T2n=n+k=1 for all integers k<0.
If v="right", then the remainder of the result will be aligned such that gcd⁡denom⁡T1,denom⁡T2n=n+k|denom⁡T2n=n+k=1 for all integers 0≤k.
This option can be used to restrict the number of iterations performed by the command when the option minimize=v is used with a small positive numeric value v. The default value is 10000.
The SumDecomposition(T, n, k) command constructs two hypergeometric terms T1 and T2 such that T⁡n=T1⁡n+1−T1⁡n+T2⁡n and the certificate E⁡T2T2=T2⁡n+1T2⁡n has a rational normal form z,r,s,u,v with v of minimal degree.
The output from SumDecomposition is a list of two elements T1,T2. Both are represented in the form
for some integer 0≤n0. The form shown above is called a multiplicative decomposition of the hypergeometric term T⁡n.
If the third optional argument k is not specified, the first unused name in the sequence k,k0,k1,k2,... is used.
If the fourth optional argument newT is specified, it will be assigned an expression in terms of inert Products of the same form as for Ti above that is equivalent to T.
If T is a rational function of n, then T1 and T2 will be rational functions as well, and the denominator of T2 is of smallest possible degree. In that case, T1 and T2 are not unique, however, and you can use the minimize=v option to impose some additional conditions on T1 and T2 (see below).
Note: If you set infolevel[SumDecomposition] to 3, Maple prints diagnostics.
T ≔ n2−2⁢n−1⁢2nn+1⁢n2⁢n+3!
Set the infolevel to 3.
infolevelSumDecomposition ≔ 3:
SumDecomposition: "calling dterm"
SumDecomposition: "construct the RCF_1 for the certificate of T"
SumDecomposition: "construct a regular description of T"
SumDecomposition: "calling dcert"
SumDecomposition: "using factorization method"
SumDecomposition: "construct a regular description of T1"
SumDecomposition: "construct a regular description of T2"
SumDecomposition: "T2 is not summable"
SumDecomposition: "An attempt to control the degree of the numerator"
SumDecomposition: "construct a triple that regularly describes T2"
T ≔ n3⁢2n
infolevelSumDecomposition ≔ 0:
The above result shows that the input hypergeometric term T is summable.
T ≔ −2⁢925+190⁢n+19⁢n2+606⁢n3+72⁢n5+435⁢n4+3⁢n6n+5⁢n2+12⁢n+37⁢n3+2⁢n−1⁢n
T ≔ 1n−1−3⁢n2+1n3+nn+12
Abramov, S.A. "Indefinite Sums of Rational Functions." Proceedings ISSAC'95, pp. 303-308. 1995.
Abramov, S.A., and Petkovsek, M. "Minimal Decomposition of Indefinite Hypergeometric Sums." Proceedings ISSAC'2001, pp. 7-14. 2001.
Abramov, S.A., and Petkovsek, M. "Rational Normal Forms and Minimal Decompositions of Hypergeometric Terms." Journal of Symbolic Computation. Vol. 33 No. 5. (2002): 521-543.
Polyakov, S.P. "Symbolic Additive Decomposition of Rational Functions." Programming and Computer Software, Vol. 31 No. 2. (2005): 60-64.
Polyakov, S.P. "Indefinite Summation of Rational Functions with Additional Minimization of the Summable Part." Programming and Computer Software 34 No. 2, (2008): 95-100.
Download Help Document