Related papers: Symbolic Expansion of Transcendental Functions
Functional methods can be applied to the quantum effective action to efficiently determine counterterms and matching conditions for effective field theories. We extend the toolbox to two-loop order and beyond and show how to evaluate the…
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…
Super-Hopf algebra structure on the function algebra on the extended quantum symplectic superspace ${\rm SP}_q^{2|1}$ has been defined. The dual Hopf algebra is explicitly constructed.
We report on an implementation within GiNaC to evaluate iterated integrals related to elliptic Feynman integrals numerically to arbitrary precision within the region of convergence of the series expansion of the integrand. The…
Polynomial functions $f : \mathbb{N}_+ \longrightarrow \mathbb{N}_+$ are studied for which sums of arbitrary length $f (1) + f (2) + f (3) + >... + f (n)$, with $n \in \mathbb{N}_+$, can be expressed by polynomial functions $g :…
Holomorphic functions are amazing because their values in an ever so small disk in the complex plane completely determine the function values at arbitrary points in their maximum possible domain. The process of extending such a function…
In probabilistic programming, the inference problem asks to determine a program's posterior distribution conditioned on its "observe" instructions. Inference is challenging, especially when exact rather than approximate results are…
Several asymptotic expansions of parabolic cylinder functions are discussed and error bounds for remainders in the expansions are presented. In particular Poincar{\'e}-type expansions for large values of the argument $z$ and uniform…
In our recent publications we have introduced the incomplete cosine expansion of the sinc function for efficient application in sampling [Abrarov & Quine, Appl. Math. Comput., 258 (2015) 425-435; Abrarov & Quine, J. Math. Research, 7 (2)…
The paper studies machine learning problems where each example is described using a set of Boolean features and where hypotheses are represented by linear threshold elements. One method of increasing the expressiveness of learned hypotheses…
The evaluation of higher-loop Feynman integrals is at the core of the quest to reduce the uncertainty of theoretical predictions and match experimental data from the LHC and future colliders. pySecDec is a program to evaluate such integrals…
We describe a mathematical structure that can give extensional denotational semantics to higher-order probabilistic programs. It is not limited to discrete probabilities, and it is compatible with integration in a way the models that have…
We propose a new symbolic algorithm and a C++ program for generating and calculating supersymmetric Feynman diagrams for ${\cal N}=1$ supersymmetric electrodynamics regularized by higher derivatives in four dimensions. According to standard…
Like its precursor this paper is concerned with the Hopf algebra of noncommutative symmetric functions and its graded dual, the Hopf algebra of quasisymmetric functions. It complements and extends the previous paper but is also…
We consider the group $(\mathcal{G},*)$ of unitized multiplicative functions in the incidence algebra of non-crossing partitions, where ``$*$'' denotes the convolution operation. We introduce a larger group $(\widetilde{\mathcal{G}},*)$ of…
We discuss the function wt(x) defined via the implicit equation wt(x)*tan[wt(x)]=x which appears in certain quantum mechanical and field theoretic applications. We investigate its analytic structure, develop series expansions for both small…
The exponential and Gaussian functions are among the most fundamental and important operations, appearing ubiquitously throughout all areas of science, engineering, and mathematics. Whereas formally, it is well-known that any function may…
A numerical program is presented which facilitates a computation pertaining to the full set of one-gluon loop diagrams (including ghost loop contributions), with M attached external gluon lines in all possible ways. The feasibility of such…
In this paper we present an algorithm to compute all unirational fields of transcendence degree one containing a given finite set of multivariate rational functions. In particular, we provide an algorithm to decompose a multivariate…
Incremental computations attempt to exploit input similarities over time, reusing work that is unaffected by input changes. To maximize this reuse in a general-purpose programming setting, programmers need a mechanism to identify dynamic…