arXiv subjects

Carsten Schneider

Publications and source records attributed to Carsten Schneider.

At least 55 records · Page 3Linked to original sources

arXiv2016

A toolbox to solve coupled systems of differential and difference equations

We present algorithms to solve coupled systems of linear differential equations, arising in the calculation of massive Feynman diagrams with local operator insertions at 3-loop order, which do {\it not} request special choices of bases. Here we assume that the desired solution has a power series representation and we seek for the coefficients in closed form. In particular, if the coefficients depend on a small parameter $\ep$ (the dimensional parameter), we assume that the coefficients themselves can be expanded in formal Laurent series w.r.t.\ $\ep$ and we try to compute the first terms in closed form. More precisely, we have a decision algorithm which solves the following problem: if the terms can be represented by an indefinite nested hypergeometric sum expression (covering as special cases the harmonic sums, cyclotomic sums, generalized harmonic sums or nested binomial sums), then we can calculate them. If the algorithm fails, we obtain a proof that the terms cannot be represented by the class of indefinite nested hypergeometric sum expressions. Internally, this problem is reduced by holonomic closure properties to solving a coupled system of linear difference equations. The underlying method in this setting relies on decoupling algorithms, difference ring algorithms and recurrence solving. We demonstrate by a concrete example how this algorithm can be applied with the new Mathematica package \texttt{SolveCoupledSystem} which is based on the packages \texttt{Sigma}, \texttt{HarmonicSums} and \texttt{OreSys}. In all applications the representation in $x$-space is obtained as an iterated integral representation over general alphabets, generalizing Poincaré iterated integrals.

cs.SC↗

arXiv2015

A Difference Ring Theory for Symbolic Summation

A summation framework is developed that enhances Karr's difference field approach. It covers not only indefinite nested sums and products in terms of transcendental extensions, but it can treat, e.g., nested products defined over roots of unity. The theory of the so-called $RΠΣ^*$-extensions is supplemented by algorithms that support the construction of such difference rings automatically and that assist in the task to tackle symbolic summation problems. Algorithms are presented that solve parameterized telescoping equations, and more generally parameterized first-order difference equations, in the given difference ring. As a consequence, one obtains algorithms for the summation paradigms of telescoping and Zeilberger's creative telescoping. With this difference ring theory one obtains a rigorous summation machinery that has been applied to numerous challenging problems coming, e.g., from combinatorics and particle physics.

cs.SC↗

arXiv2015

A streamlined difference ring theory: Indefinite nested sums, the alternating sign and the parameterized telescoping problem

We present an algebraic framework to represent indefinite nested sums over hypergeometric expressions in difference rings. In order to accomplish this task, parts of Karr's difference field theory have been extended to a ring theory in which also the alternating sign can be expressed. The underlying machinery relies on algorithms that compute all solutions of a given parameterized telescoping equation. As a consequence, we can solve the telescoping and creative telescoping problem in such difference rings.

cs.SC↗

arXiv2014

Non-planar Feynman integrals, Mellin-Barnes representations, multiple sums

The construction of Mellin-Barnes (MB) representations for non-planar Feynman diagrams and the summation of multiple series derived from general MB representations are discussed. A basic version of a new package AMBREv.3.0 is supplemented. The ultimate goal of this project is the automatic evaluation of MB representations for multiloop scalar and tensor Feynman integrals through infinite sums, preferably with analytic solutions. We shortly describe a strategy of further algebraic summation.

hep-ph↗

arXiv2014

Nested (inverse) binomial sums and new iterated integrals for massive Feynman diagrams

Nested sums containing binomial coefficients occur in the computation of massive operator matrix elements. Their associated iterated integrals lead to alphabets including radicals, for which we determined a suitable basis. We discuss algorithms for converting between sum and integral representations, mainly relying on the Mellin transform. To aid the conversion we worked out dedicated rewrite rules, based on which also some general patterns emerging in the process can be obtained.

hep-th↗

arXiv2014

Recent Symbolic Summation Methods to Solve Coupled Systems of Differential and Difference Equations

We outline a new algorithm to solve coupled systems of differential equations in one continuous variable $x$ (resp. coupled difference equations in one discrete variable $N$) depending on a small parameter $ε$: given such a system and given sufficiently many initial values, we can determine the first coefficients of the Laurent-series solutions in $ε$ if they are expressible in terms of indefinite nested sums and products. This systematic approach is based on symbolic summation algorithms in the context of difference rings/fields and uncoupling algorithms. The proposed method gives rise to new interesting applications in connection with integration by parts (IBP) methods. As an illustrative example, we will demonstrate how one can calculate the $ε$-expansion of a ladder graph with 6 massive fermion lines.

cs.SC↗

arXiv2014

Calculating Massive 3-loop Graphs for Operator Matrix Elements by the Method of Hyperlogarithms

We calculate convergent 3-loop Feynman diagrams containing a single massive loop equipped with twist $τ=2$ local operator insertions corresponding to spin $N$. They contribute to the massive operator matrix elements in QCD describing the massive Wilson coefficients for deep-inelastic scattering at large virtualities. Diagrams of this kind can be computed using an extended version to the method of hyperlogarithms, originally being designed for massless Feynman diagrams without operators. The method is applied to Benz- and $V$-type graphs, belonging to the genuine 3-loop topologies. In case of the $V$-type graphs with five massive propagators new types of nested sums and iterated integrals emerge. The sums are given in terms of finite binomially and inverse binomially weighted generalized cyclotomic sums, while the 1-dimensionally iterated integrals are based on a set of $\sim 30$ square-root valued letters. We also derive the asymptotic representations of the nested sums and present the solution for $N \in \mathbb{C}$. Integrals with a power-like divergence in $N$--space $\propto a^N, a \in \mathbb{R}, a > 1,$ for large values of $N$ emerge. They still possess a representation in $x$--space, which is given in terms of root-valued iterated integrals in the present case. The method of hyperlogarithms is also used to calculate higher moments for crossed box graphs with different operator insertions.

hep-ph↗

arXiv2013

Fast Algorithms for Refined Parameterized Telescoping in Difference Fields

Parameterized telescoping (including telescoping and creative telescoping) and refined versions of it play a central role in the research area of symbolic summation. Karr introduced 1981 $ΠΣ$-fields, a general class of difference fields, that enables one to consider this problem for indefinite nested sums and products covering as special cases, e.g., the ($q$--)hypergeometric case and their mixed versions. This survey article presents the available algorithms in the framework of $ΠΣ$-extensions and elaborates new results concerning efficiency.

cs.SC↗

arXiv2013

Modern Summation Methods for Loop Integrals in Quantum Field Theory: The Packages Sigma, EvaluateMultiSums and SumProduction

A large class of Feynman integrals, like e.g., two-point parameter integrals with at most one mass and containing local operator insertions, can be transformed to multi-sums over hypergeometric expressions. In this survey article we present a difference field approach for symbolic summation that enables one to simplify such definite nested sums to indefinite nested sums. In particular, the simplification is given -if possible- in terms of harmonic sums, generalized harmonic sums, cyclotomic harmonic sums or binomial sums. Special emphasis is put on the developed packages Sigma, EvaluateMultiSums and SumProduction that assist in the task to perform these simplifications completely automatically for huge input expressions.

cs.SC↗

arXiv2013

Computer-Assisted Proofs of Some Identities for Bessel Functions of Fractional Order

We employ computer algebra algorithms to prove a collection of identities involving Bessel functions with half-integer orders and other special functions. These identities appear in the famous Handbook of Mathematical Functions, as well as in its successor, the DLMF, but their proofs were lost. We use generating functions and symbolic summation techniques to produce new proofs for them.

cs.SC↗

arXiv2013

Massive 3-loop Ladder Diagrams for Quarkonic Local Operator Matrix Elements

3-loop diagrams of the ladder-type, which emerge for local quarkonic twist-2 operator matrix elements, are computed directly for general values of the Mellin variable $N$ using Appell-function representations and applying modern summation technologies provided by the package {\sf Sigma} and the method of hyperlogarithms. In some of the diagrams generalized harmonic sums with $ξ\in \{1,1/2,2\}$ emerge beyond the usual nested harmonic sums. As the asymptotic representation of the corresponding integrals shows, the generalized sums conspire giving well behaved expressions for large values of $N$. These diagrams contribute to the 3-loop heavy flavor Wilson coefficients of the structure functions in deep-inelastic scattering in the region $Q^2 \gg m^2$.

hep-ph↗

arXiv2013

Simplifying Multiple Sums in Difference Fields

In this survey article we present difference field algorithms for symbolic summation. Special emphasize is put on new aspects in how the summation problems are rephrased in terms of difference fields, how the problems are solved there, and how the derived results in the given difference field can be reinterpreted as solutions of the input problem. The algorithms are illustrated with the Mathematica package \SigmaP\ by discovering and proving new harmonic number identities extending those from (Paule and Schneider, 2003). In addition, the newly developed package \texttt{EvaluateMultiSums} is introduced that combines the presented tools. In this way, large scale summation problems for the evaluation of Feynman diagrams in QCD (Quantum ChromoDynamics) can be solved completely automatically.

cs.SC↗

arXiv2013

Analytic and Algorithmic Aspects of Generalized Harmonic Sums and Polylogarithms

In recent three--loop calculations of massive Feynman integrals within Quantum Chromodynamics (QCD) and, e.g., in recent combinatorial problems the so-called generalized harmonic sums (in short $S$-sums) arise. They are characterized by rational (or real) numerator weights also different from $\pm 1$. In this article we explore the algorithmic and analytic properties of these sums systematically. We work out the Mellin and inverse Mellin transform which connects the sums under consideration with the associated Poincaré iterated integrals, also called generalized harmonic polylogarithms. In this regard, we obtain explicit analytic continuations by means of asymptotic expansions of the $S$-sums which started to occur frequently in current QCD calculations. In addition, we derive algebraic and structural relations, like differentiation w.r.t. the external summation index and different multi-argument relations, for the compactification of $S$-sum expressions. Finally, we calculate algebraic relations for infinite $S$-sums, or equivalently for generalized harmonic polylogarithms evaluated at special values. The corresponding algorithms and relations are encoded in the computer algebra package {\tt HarmonicSums}.

math-ph↗

arXiv2012

A Symbolic Summation Approach to Feynman Integral Calculus

Given a Feynman parameter integral, depending on a single discrete variable $N$ and a real parameter $ε$, we discuss a new algorithmic framework to compute the first coefficients of its Laurent series expansion in $ε$. In a first step, the integrals are expressed by hypergeometric multi-sums by means of symbolic transformations. Given this sum format, we develop new summation tools to extract the first coefficients of its series expansion whenever they are expressible in terms of indefinite nested product-sum expressions. In particular, we enhance the known multi-sum algorithms to derive recurrences for sums with complicated boundary conditions, and we present new algorithms to find formal Laurent series solutions of a given recurrence relation.

cs.SC↗

arXiv2012

The $O(α_s^3 n_f T_F^2 C_{A,F})$} Contributions to the Gluonic Massive Operator Matrix Elements

The $O(α_s^3 n_f T_F^2 C_{A,F})$ terms to the massive gluonic operator matrix elements are calculated for general values of the Mellin variable $N$. These twist-2 matrix elements occur as transition functions in the variable flavor number scheme at NNLO. The calculation uses sum-representations in generalized hypergeometric series turning into harmonic sums. The analytic continuation to complex values of $N$ is provided.

hep-ph↗

arXiv2011

Harmonic Sums and Polylogarithms Generated by Cyclotomic Polynomials

The computation of Feynman integrals in massive higher order perturbative calculations in renormalizable Quantum Field Theories requires extensions of multiply nested harmonic sums, which can be generated as real representations by Mellin transforms of Poincaré--iterated integrals including denominators of higher cyclotomic polynomials. We derive the cyclotomic harmonic polylogarithms and harmonic sums and study their algebraic and structural relations. The analytic continuation of cyclotomic harmonic sums to complex values of $N$ is performed using analytic representations. We also consider special values of the cyclotomic harmonic polylogarithms at argument $x=1$, resp., for the cyclotomic harmonic sums at $N \rightarrow \infty$, which are related to colored multiple zeta values, deriving various of their relations, based on the stuffle and shuffle algebras and three multiple argument relations. We also consider infinite generalized nested harmonic sums at roots of unity which are related to the infinite cyclotomic harmonic sums. Basis representations are derived for weight {\sf w = 1,2} sums up to cyclotomy {\sf l = 20}.

math-ph↗

arXiv2011

A Refined Denominator Bounding Algorithm for Multivariate Linear Difference Equations

We continue to investigate which polynomials can possibly occur as factors in the denominators of rational solutions of a given partial linear difference equation. In an earlier article we had introduced the distinction between periodic and aperiodic factors in the denominator, and we gave an algorithm for predicting the aperiodic ones. Now we extend this technique towards the periodic case and present a refined algorithm which also finds most of the periodic factors.

cs.SC↗

arXiv2010

Partial Denominator Bounds for Partial Linear Difference Equations

We investigate which polynomials can possibly occur as factors in the denominators of rational solutions of a given partial linear difference equation (PLDE). Two kinds of polynomials are to be distinguished, we call them /periodic/ and /aperiodic/. The main result is a generalization of a well-known denominator bounding technique for univariate equations to PLDEs. This generalization is able to find all the aperiodic factors of the denominators for a given PLDE.

cs.SC↗