Abstract
We present a general algorithmic framework that allows not only to deal with summation problems over summands being rational expressions in indefinite nested sums and products (Karr, 1981), but also over ∂-finite and holonomic summand expressions that are given by a linear recurrence. This approach implies new computer algebra tools implemented in Sigma to solve multi-summation problems efficiently. For instance, the extended Sigma package has been applied successively to provide a computer-assisted proof of Stembridge's TSPP Theorem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
