Related papers: A simple algorithm for automatic Feynman diagram g…
We propose a framework for calculating two-loop Feynman diagrams which appear within a renormalizable theory in the general mass case and at finite external momenta. Our approach is a combination of analytical results and of high accuracy…
A novel code construction algorithm is presented to find all the possible code families for code reconfiguration in an OCDMA system. The algorithm is developed through searching all the complete subgraphs of a constructed graph. The…
The free energy of a field theory can be considered as a functional of the free correlation function. As such it obeys a nonlinear functional differential equation which can be turned into a recursion relation. This is solved order by order…
This article describes three Mathematica packages for the automatic calculation of one-loop Feynman diagrams: the diagrams are generated with FeynArts, algebraically simplified with FormCalc, and finally evaluated numerically using the…
Bayesian state and parameter estimation have been automated effectively in a variety of probabilistic programming languages. The process of model comparison on the other hand, which still requires error-prone and time-consuming manual…
We describe the FeynEdit tool for drawing Feynman diagrams. Input and output is done using the LaTeX macros of FeynArts, which also implies that diagrams drawn by FeynArts can be edited with FeynEdit. The LaTeX code can be conveniently…
We present a historiographical review of algorithms and computer codes developed for solving integration-by-parts relations for Feynman integrals. This procedure is one of the key steps in the evaluation of Feynman integrals, since it…
We discuss certain computational methods and analytical techniques that can be used to automatize the various steps involved in the renormalization group analysis of an MSR field theory. The methods rely mainly on the well known packages…
A new method of divergence subtraction in Feynman parametric integrals is presented. The method is suitable for calculating the lepton anomalous magnetic moments (AMM) in quantum electrodynamics (QED). The subtraction procedure eliminates…
Quantum field theory (QFT) for interacting many-electron systems is fundamental to condensed matter physics, yet achieving accurate solutions confronts computational challenges in managing the combinatorial complexity of Feynman diagrams,…
We introduce a frustratingly simple, super efficient and surprisingly effective decoding method, which we call Frustratingly Simple Decoding (FSD), for neural text generation. The idea behind FSD is straightforward: we build an anti-LM…
Defeasible reasoning is the mode of reasoning where conclusions can be overturned by taking into account new evidence. A commonly used method in cognitive science and logic literature is to handcraft argumentation supporting inference…
Minimisation of discrete energies defined over factors is an important problem in computer vision, and a vast number of MAP inference algorithms have been proposed. Different inference algorithms perform better on factor graph models (GMs)…
We introduce a novel, systematic method for the complete symbolic reduction of multi-loop Feynman integrals, leveraging the power of generating functions. The differential equations governing these generating functions naturally yield…
We extend our previous algorithm that generates all labeled graphs with a given graphical degree sequence to generate all labeled triangle-free graphs with a given graphical degree sequence. The algorithm uses various pruning techniques to…
The issue of computing (co)homology generators of a cell complex is gaining a pivotal role in various branches of science. While this issue can be rigorously solved in polynomial time, it is still overly demanding for large scale problems.…
We design a deterministic algorithm that, given $n$ points in a \emph{typical} constant degree regular~graph, queries $O(n)$ distances to output a constant factor approximation to the average distance among those points, thus answering a…
A geometrical approach to the calculation of N-point Feynman diagrams is reviewed. It is shown that the geometrical splitting yields useful connections between Feynman integrals with different momenta and masses. It is demonstrated how…
A method of calculating Feynman diagrams from their small momentum expansion [1] is extended to diagrams with zero mass thresholds. We start from the asymptotic expansion in large masses [2] (applied to the case when all $M_i^2$ are large…
While generative modeling has achieved remarkable success on tasks like natural language-conditioned image generation, enabling model adaptation from example data points remains a relatively underexplored and challenging problem. To this…