Related papers: Nested (inverse) binomial sums and new iterated in…

We define discrete nested sums over integer points for symbols on the real line, which obey stuffle relations whenever they converge. They relate to Chen integrals of symbols via the Euler-MacLaurin formula. Using a suitable holomorphic…

The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…

In many field theoretical models one has to resum two- and four-legged subdiagrams in order to determine their behaviour. In this article we present a novel formalism which does this in a nice way. It is based on the central limit theorem…

Using a binary representation for basis elements of an algebra combined with a framework of multiplier and index functions, a connection has been established between the structure of a large class of algebras and the XOR componentwise…

A novel factorization for the sum of two single-pair matrices is established as product of lower-triangular, tridiagonal, and upper-triangular matrices, leading to semi-closed-form formulas for tridiagonal matrix inversion. Subsequent…

We present a detailed description of the recent idea for a direct decomposition of Feynman integrals onto a basis of master integrals by projections, as well as a direct derivation of the differential equations satisfied by the master…

We introduce the tools of intersection theory to the study of Feynman integrals, which allows for a new way of projecting integrals onto a basis. In order to illustrate this technique, we consider the Baikov representation of maximal cuts…

We give an algorithm to compute the series expansion for the inverse of a given function. The algorithm is extremely easy to implement and gives the first $N$ terms of the series. We show several examples of its application in calculating…

We prove an important property of the binomial transform: it converts multiplication by the discrete variable into a certain difference operator. We also consider the case of dividing by the discrete variable. The properties presented here…

We show that sums over graphs such as appear in the theory of Feynman diagrams can be seen as integrals over discrete groupoids. From this point of view, basic combinatorial formulas of the theory of Feynman diagrams can be interpreted as…

In these proceedings we discuss a representation for modular forms that is more suitable for their application to the calculation of Feynman integrals in the context of iterated integrals and the differential equation method. In particular,…

A modeling methodology and matrix formalism is presented that permits analysis of arbitrarily complex interferometric waveguide systems, including polarization and backreflection effects. Considerable improvement results from separation of…

A new family of polynomials, called cumulant polynomial sequence, and its extensions to the multivariate case is introduced relied on a purely symbolic combinatorial method. The coefficients of these polynomials are cumulants, but depending…

We consider a class of sums over products of Z-sums whose arguments differ by a symbolic integer. Such sums appear, for instance, in the expansion of Gauss hypergeometric functions around integer indices that depend on a symbolic parameter.…

We argue that the Mellin-Barnes representations of Feynman diagrams can be used for obtaining linear systems of homogeneous differential equations for the original Feynman diagrams with arbitrary powers of propagators without recourse to…

We develop a systematic and fully explicit approach to the evaluation of binomial sums involving reciprocals of binomial coefficients based on Beta integral techniques. Starting from a simple integral representation, we provide a derivation…

An algorithm for the systematic analytical approximation of multi-scale Feynman integrals is presented. The algorithm produces algebraic expressions as functions of the kinematical parameters and mass scales appearing in the Feynman…

Nested sampling (NS) is a popular algorithm for Bayesian computation. We investigate statistical errors in NS both analytically and numerically. We show two analytic results. First, we show that the leading terms in Skilling's expression…

In this study, we apply "r" times the binomial transform to the Padovan and Perrin matrix sequences. Also, the Binet formulas, summations, generating functions of these transforms are found using recurrence relations. Finally, we give the…

In this paper, we describe a numerical approach to evaluate Feynman loop integrals. In this approach the key technique is a combination of a numerical integration method and a numerical extrapolation method. Since the computation is carried…