相关论文: FeynEdit - a tool for drawing Feynman diagrams
The FDC is a general-purpose program package for Feynman Diagram Calculation. We outline previous successes in calculations and focus on its recent progress about automatic deduction the Feynman rules for first principle model, especially…
We completely generalize previous results related to the counting of connected Feynman diagrams. We use a generating function approach, which encodes the Wick contraction combinatorics of the respective connected diagrams. Exact solutions…
Details of recent developments of the Feynman diagram analyzer DIANA (DIagram ANAlyser) are presented. Apart from some discussion about QGRAF and new plotting features, we concentrate on a new sophisticated mechanism of momenta mapping.
We provide a pipeline for generating syntax diagrams (also called railroad diagrams) from context free grammars. Syntax diagrams are a graphical representation of a context free language, which we formalize abstractly as a set of mutually…
The computation of Feynman integrals often involves square roots. One way to obtain a solution in terms of multiple polylogarithms is to rationalize these square roots by a suitable variable change. We present a program that can be used to…
We present a method for a recursive graphical construction of Feynman diagrams with their correct multiplicities in quantum electrodynamics. The method is first applied to find all diagrams contributing to the vacuum energy from which all…
We discuss the program EXP used to automate the successive application of asymptotic expansions to Feynman diagrams. We focus on the generation of the relevant subgraphs and the determination of the topologies for the remaining integrals.…
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 describe a tool to create, edit, visualise and compute with interaction nets - a form of graph rewriting systems. The editor, called GraphPaper, allows users to create and edit graphs and their transformation rules using an intuitive…
Convex polyhedral abstractions of logic programs have been found very useful in deriving numeric relationships between program arguments in order to prove program properties and in other areas such as termination and complexity analysis. We…
In this paper, we present a generalization of a syntax-directed editor calculus, which can be used to instantiate a specialized syntax-directed editor for any language, given by some abstract syntax. The editor calculus guarantees the…
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…
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…
The present paper provides a method for finding partial differential equations satisfied by the Feynman integrals for diagrams of various types, using the Griffiths theorem on the reduction of poles of rational differential forms. As an…
In the present review we provide an extensive analysis of the intertwinement between Feynman integrals and cohomology theories in the light of the recent developments. Feynman integrals enter in several perturbative methods for solving non…
Deep convolutional neural network (DCNN) is the state-of-the-art method for image segmentation, which is one of key challenging computer vision tasks. However, DCNN requires a lot of training images with corresponding image masks to get a…
Some problems related to construction of the epsilon-expansion of dimensionally regulated Feynman integrals are discussed. For certain classes of diagrams, an arbitrary term of the epsilon-expansion can be expressed in terms of log-sine…
Graph Neural Networks (GNNs) have proven to excel in predictive modeling tasks where the underlying data is a graph. However, as GNNs are extensively used in human-centered applications, the issue of fairness has arisen. While edge deletion…
The design space of visual tools that aim to help people create schemas for property graphs is explored. Interviews are conducted with experts in the domain of property graphs and data management in general. Through this collaboration, we…
The diagrammatic coaction maps any given Feynman graph into pairs of graphs and cut graphs such that, conjecturally, when these graphs are replaced by the corresponding Feynman integrals one obtains a coaction on the respective functions.…