· 2014· Preprint
Iterated Binomial Sums and their Associated Iterated Integrals
- 132citations
- 2014year
Short summary
New classes of iterated generalized harmonic sums, weighted by binomial coefficients, emerge in 3-loop Feynman diagram calculations and extend known special functions.
AI-generated from the title and abstract; the full text is not read.
Key points
- Introduces iterated generalized harmonic sums weighted by binomial coefficients.
- These sums appear in 3-loop Feynman diagram calculations, extending known special functions.
- Associated iterated integrals involve square-root valued alphabets.
- Limiting values of sums and integrals generate new mathematical constants.
AI-generated from the title and abstract; the full text is not read.
Abstract
We consider finite iterated generalized harmonic sums weighted by the binomial $\binom{2k}{k}$ in numerators and denominators. A large class of these functions emerges in the calculation of massive Feynman diagrams with local operator insertions starting at 3-loop order in the coupling constant and extends the classes of the nested harmonic, generalized harmonic and cyclotomic sums. The binomially weighted sums are associated by the Mellin transform to iterated integrals over square-root valued alphabets. The values of the sums for $N \rightarrow \infty$ and the iterated integrals at $x=1$ lead to new constants, extending the set of special numbers given by the multiple zeta values, the cyclotomic zeta values and special constants which emerge in the limit $N \rightarrow \infty$ of generalized harmonic sums. We develop algorithms to obtain the Mellin representations of these sums in a systematic way. They are of importance for the derivation of the asymptotic expansion of these sums and their analytic continuation to $N \in \mathbb{C}$. The associated convolution relations are derived for real parameters and can therefore be used in a wider context, as e.g. for multi-scale processes. We also derive algorithms to transform iterated integrals over root-valued alphabets into binomial sums. Using generating functions we study a few aspects of infinite (inverse) binomial sums.
The authors' abstract, as published at the source., 2014 · DOI ↗
Continue with a free account
Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.
Continue free on the webSign in with Google or Apple; no card needed. You come back to this paper.
On your phone:
Field: Algebra and Number Theory
Algebra and Number TheoryMathematics