2000 character limit reached
A Symbolic Summation Approach to Find Optimal Nested Sum Representations
Published 15 Apr 2009 in cs.SC, math.CO, and math.NT | (0904.2323v1)
Abstract: We consider the following problem: Given a nested sum expression, find a sum representation such that the nested depth is minimal. We obtain a symbolic summation framework that solves this problem for sums defined, e.g., over hypergeometric, $q$-hypergeometric or mixed hypergeometric expressions. Recently, our methods have found applications in quantum field theory.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.