Related papers: Multipoint fishnet Feynman diagrams: sequential sp…
Solutions of the classical $\phi^4$-theory in Minkowski space-time are analyzed in a perturbation expansion in the nonlinearity. Using the language of Feynman diagrams, the solution of the Cauchy problem is expressed in terms of tree…
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.…
A new $n-$ noded polygonal plate element is proposed for the analysis of plate structures comprising of thin and thick members. The formulation is based on the discrete Kirchhoff Mindlin theory. On each side of the polygonal element,…
We develop a graphical calculus of manifold diagrams which generalises string and surface diagrams to arbitrary dimensions. Manifold diagrams are pasting diagrams for $(\infty, n)$-categories that admit a semi-strict composition operation…
The path-following scheme in [Loisel and Maxwell, SIAM J. Matrix Anal. Appl., 39-4 (2018), pp. 1726-1749] is adapted to efficiently calculate the dispersion relation curve for linear surface waves on an arbitrary vertical shear current.…
The simulation of the physical movement of multi-body systems at an atomistic level, with forces calculated from a quantum mechanical description of the electrons, motivates a graph partitioning problem studied in this article. Several…
In this paper, we present splitting algorithms to solve multicomponent transport models with Maxwell-Stefan-diffusion approaches. The multicomponent models are related to transport problems, while we consider plasma processes, in which the…
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…
The method of regions, which provides a systematic approach for computing Feynman integrals involving multiple kinematic scales, proposes that a Feynman integral can be approximated and even reproduced by summing over integrals expanded in…
The Brattelli diagram associated with a given bicolored Dynkin-Coxeter graph of type $A_n$ determines planar fractal sets obtained by infinite dissections of a given triangle. All triangles appearing in the dissection process have angles…
We study several multiscale one-loop five-point families of Feynman integrals. More specifically, we employ the Simplified Differential Equations approach to obtain results in terms of Goncharov polylogarithms of up to transcendental weight…
We present the construction and stochastic summation of rooted-tree diagrams, based on the expansion of a root finding algorithm applied to the Dyson-Schwinger equations (DSEs). The mathematical formulation shows superior convergence…
Work is reported on finite integral representations for 2-loop massive 2-, 3- and 4-point functions, using orthogonal and parallel space variables. It is shown that this can be utilized to cover particles with arbitrary spin (tensor…
It is argued that quantum propagation of D-particles in the limit \alpha'-> 0 can represent the "joining-splitting" processes of Feynman graphs of a certain field theory in the light-cone frame. So basically it provides the possibility to…
We propose a new set of Master Integrals which can be used as a basis for certain multiloop calculations in massless gauge field theories. In these theories we consider three-point Feynman diagrams with arbitrary number of loops. The…
We review in a pedagogical way the method of differential equations for the evaluation of D-dimensionally regulated Feynman integrals. After dealing with the general features of the technique, we discuss its application in the context of…
We present a simple wavefront-like approach for computing multiplicatively weighted Voronoi diagrams of points and straight-line segments in the Euclidean plane. If the input sites may be assumed to be randomly weighted points then the use…
We develop the partitioning technique for quantum discrete systems. The graph consists of several subgraphs: a central graph and several branch graphs, with each branch graph being rooted by an individual node on the central one. We show…
We introduce and study multiple partition structures which are sequences of probability measures on families of Young diagrams subjected to a consistency condition. The multiple partition structures are generalizations of Kingman's…
We describe here an optical device, based on time-delays, for solving the set splitting problem which is well-known NP-complete problem. The device has a graph-like structure and the light is traversing it from a start node to a destination…