Related papers: Symbolic Expansion of Transcendental Functions
The relationship between Feynman diagrams and hypergeometric functions is discussed. Special attention is devoted to existing techniques for the construction of the $\epsilon$-expansion. As an example, we present a detailed discussion of…
Computer algebra systems play an important role in science as they facilitate the development of new theoretical models. The resulting symbolic equations are often implemented in a compiled programming language in order to provide fast and…
The focus of this note is to formulate the algorithms and give the examples used by Fibonacci in Liber Abaci to expand any fraction into a sum of unit fractions. The description in Liber Abaci is all verbal and the examples are numbers…
The availability of computational modeling tools for subatomic physics (Form, FeynArts, FormCalc, and FeynCalc) has made it possible to perform sophisticated calculations in perturbative quantum field theory. We have adapted these packages…
Hyperbolic programming is the problem of computing the infimum of a linear function when restricted to the hyperbolicity cone of a hyperbolic polynomial, a generalization of semidefinite programming. We propose an approach based on symbolic…
We introduce a new Hopf algebra that operates on pairs of finite interval partitions and permutations of equal length. This algebra captures vincular patterns, which involve specifying both the permutation patterns and the consecutive…
Multiple harmonic sums appear in the perturbative computation of various quantities of interest in quantum field theory. In this article we introduce a class of Hopf algebras that describe the structure of such sums, and develop some of…
Descents in permutations or words are defined from the relative position of two consecutive letters. We investigate a statistic involving patterns of k consecutive letters, and show that it leads to Hopf algebras generalizing noncommutative…
We introduce a systematic approach to express generating functions for the enumeration of maps on surfaces of high genus in terms of a single generating function relevant to planar surfaces. Central to this work is the comparison of two…
Group invariants are used in high energy physics to define quantum field theory interactions. In this paper, we are presenting the parallel algebraic computation of special invariants called symplectic and even focusing on one particular…
Higher-order diagrams required for radiative corrections to mixed electroweak and QCD processes at the LHC and anticipated future colliders will require numerically stable representations of the associated Feynman diagrams. The…
Combinatorial Hopf algebras give a linear algebraic structure to infinite families of combinatorial objects, a technique further enriched by the categorification of these structure via the representation theory of families of algebras. This…
In this talk, we are concerned with the formulation and understanding of the combinatorics of time-ordered n-point functions in terms of the Hopf algebra of field operators. Mathematically, this problem can be formulated as one in…
We design a Quasi-Polynomial time deterministic approximation algorithm for computing the integral of a multi-dimensional separable function, supported by some underlying hyper-graph structure, appropriately defined. Equivalently, our…
This paper develops a comprehensive probabilistic setup to compute approximating functions in active subspaces. Constantine et al. proposed the active subspace method in (Constantine et al., 2014) to reduce the dimension of computational…
We obtain the asymptotic expansion for the Gauss hypergeometric function \[F(a-\lambda,b+\lambda;c+i\alpha\lambda;z)\] for $\lambda\rightarrow+\infty$ with $a$, $b$ and $c$ finite parameters by application of the method of steepest…
Theoretical foundations of compositional reasoning about heaps in imperative programming languages are investigated. We introduce a novel concept of compositional symbolic memory and its relevant properties. We utilize these formal…
We develop a combinatorial approach to the quantum permutation algebras, as Hopf images of representations of type $\pi:A_s(n)\to B(H)$. We discuss several general problems, including the commutativity and cocommutativity ones, the…
The idea of using unfolding as a way of computing a program semantics has been applied successfully to logic programs and has shown itself a powerful tool that provides concrete, implementable results, as its outcome is actually source…
We consider a q-analogue of the standard bilinear form on the commutative ring of symmetric functions. The q=-1 case leads to a Z-graded Hopf superalgebra which we call the algebra of odd symmetric functions. In the odd setting we describe…