A Symbolic Summation Approach to Find Optimal Nested Sum Representations
Symbolic Computation
2009-04-16 v1 Combinatorics
Number Theory
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, -hypergeometric or mixed hypergeometric expressions. Recently, our methods have found applications in quantum field theory.
Cite
@article{arxiv.0904.2323,
title = {A Symbolic Summation Approach to Find Optimal Nested Sum Representations},
author = {Carsten Schneider},
journal= {arXiv preprint arXiv:0904.2323},
year = {2009}
}
Comments
To appear in Clay Mathematics Proceedings