Related papers: FeynGame 3.0
In the wake of the growing popularity of machine learning in particle physics, this work finds a new application of geometric deep learning on Feynman diagrams to make accurate and fast matrix element predictions with the potential to be…
The benefits of automating design cycles for Bayesian inference-based algorithms are becoming increasingly recognized by the machine learning community. As a result, interest in probabilistic programming frameworks has much increased over…
We present an application that automatically writes the Helas library corresponding to the Feynman rules of any Lagrangian, renormalizable or not, in quantum field theory. The code, written in Python, takes the Universal FeynRules Output as…
In this talk we discuss mathematical structures associated to Feynman graphs. Feynman graphs are the backbone of calculations in perturbative quantum field theory. The mathematical structures -- apart from being of interest in their own…
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…
We present a user-friendly software for photonic analog quantum computing with an installable MATLAB package and the graphical user interface (GUI) that allows for convenient operation without requiring programming skills. Arbitrary…
Starting from the parametric representation of a Feynman diagram, we obtain it's well defined value in dimensional regularisation by changing the integrals over parameters into contour integrals. That way we eventually arrive at a…
We present a Feynman graph selection tool {\tt grcsel}, which is an interpreter written in C language. In the framework of {\tt GRACE}, it enables us to get a subset of Feynman graphs according to given conditions.
This is a simple mathematical introduction into Feynman diagram technique, which is a standard physical tool to write perturbative expansions of path integrals near a critical point of the action. I start from a rigorous treatment of a…
xloops is a program package that calculates Feynman diagrams by using computer algebra systems. In this paper it is shown which problems to be solved by computer algebra arise during such calculations, and how this problems are handled in…
New algebraic approach to analytical calculations of D-dimensional integrals for multi-loop Feynman diagrams is proposed. We show that the known analytical methods of evaluation of multi-loop Feynman integrals, such as integration by parts…
This paper is an introduction to the language of Feynman Diagrams. We use Reshetikhin-Turaev graphical calculus to define Feynman diagrams and prove that asymptotic expansions of Gaussian integrals can be written as a sum over a suitable…
A C-program DIANA (DIagram ANAlyser) for the automation of Feynman diagram evaluations is presented.
In recent years, there has been increasing interest in automatic facial behavior analysis systems from computing communities such as vision, multimodal interaction, robotics, and affective computing. Building upon the widespread utility of…
We present SmeftFR, a Mathematica package designed to generate the Feynman rules for the Standard Model Effective Field Theory (SMEFT) including the complete set of gauge invariant operators up to dimension~6. Feynman rules are generated…
We introduce GraSPy, a Python library devoted to statistical inference, machine learning, and visualization of random graphs and graph populations. This package provides flexible and easy-to-use algorithms for analyzing and understanding…
Last year we released version 2.0 of the Feynman integral reduction program Kira. In this contribution we first report on changes and new features since then and, secondly, on new features for upcoming releases.
Programming techniques which extend the capabilities of FeynArts and FormCalc are introduced and explained using examples from real applications.
Information about the number of Feynman graphs for a given physical process in a given field theory is especially useful for confirming the result of a Feynman graph generator used in an automatic system of perturbative calculations. A…
The LanHEP program for Feynman rules generation in momentum representation is presented. It reads the Lagrangian written in a compact form, close to the one used in publications. It means that Lagrangian terms can be written with summation…