A Symbolic Summation Approach to Find Optimal Nested Sum Representations

Simple item page
dc.creatorSchneider, Carsten
dc.date2009-04-15
dc.date.accessioned2026-07-07T13:04:14Z
dc.date.available2026-07-07T13:04:14Z
dc.descriptionWe 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.
dc.descriptionTo appear in Clay Mathematics Proceedings
dc.identifierhttps://arxiv.org/abs/0904.2323
dc.identifierhttp://arxiv.org/abs/0904.2323
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/227094
dc.subjectSymbolic Computation
dc.subjectCombinatorics
dc.subjectNumber Theory
dc.titleA Symbolic Summation Approach to Find Optimal Nested Sum Representations
dc.typetext

Files

Collections

arXiv