English
Related papers

Related papers: FeynGame

200 papers

In this paper we show how Feynman diagrams, which are used as a tool to implement perturbation theory in quantum field theory, can be very useful also in classical mechanics, provided we introduce also at the classical level concepts like…

High Energy Physics - Theory · Physics 2009-11-11 R. Penco , D. Mauro

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…

High Energy Physics - Theory · Physics 2009-10-31 Hagen Kleinert , Axel Pelster , Boris Kastening , M. Bachmann

In many problems that involve multiple decision making agents, optimal choices for each agent depend on the choices of others. Differential game theory provides a principled formalism for expressing these coupled interactions and recent…

Multiagent Systems · Computer Science 2020-04-07 Lasse Peters , Zachary N. Sunberg

It is shown how strictly four-dimensional integration by parts combined with differential renormalization and its infrared analogue can be applied for calculation of Feynman diagrams.

High Energy Physics - Theory · Physics 2009-10-30 V. A. Smirnov

A connection between one-loop $N$-point Feynman diagrams and certain geometrical quantities in non-Euclidean geometry is discussed. A geometrical way to calculate the corresponding Feynman integrals is considered. (This paper contains a…

High Energy Physics - Theory · Physics 2011-03-17 A. I. Davydychev , R. Delbourgo

We develop methods to formally describe and compare games, in order to probe questions of game structure and design, and as a stepping stone to predicting player behavior from design patterns. We define a grammar-like formalism to describe…

Logic in Computer Science · Computer Science 2021-01-05 Paul Riggins , David McPherson

We define the Sign Game as a two-player game played on a simple undirected mathematical graph $G$. The players alternate turns, assigning vertices of $G$ either $1$ or $-1$, and edges take on the value of the product of their endvertices.…

Combinatorics · Mathematics 2025-11-12 Liz Blum , Lily Brustkern , Rosetta Hawkins , Neil R. Nicholson , Ranjan Rohatgi

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…

Computational Physics · Physics 2022-11-29 Harrison Mitchell , Alexander Norcliffe , Pietro Liò

We present a general way of defining various reduction games on \omega\ which "represent" corresponding topologically defined classes of functions. In particular, we will show how to construct games for piecewise defined functions, for…

Logic · Mathematics 2011-12-01 Luca Motto Ros

The numbers game is a one-player game played on a finite simple graph with certain "amplitudes" assigned to its edges and with an initial assignment of real numbers to its nodes. The moves of the game successively transform the numbers at…

Combinatorics · Mathematics 2008-10-31 Robert G. Donnelly

Triangle Feynman diagrams can be considered as describing form factors of states bound by a zero-range interaction. These form factors are calculated for scalar particles and compared to point-form and non-relativistic results. By examining…

Nuclear Theory · Physics 2009-11-07 B. Desplanques , L. Theußl , S. Noguera

Graph grammars extend the theory of formal languages in order to model distributed parallelism in theoretical computer science. We show here that to certain classes of context-free and context-sensitive graph grammars one can associate a…

Formal Languages and Automata Theory · Computer Science 2015-03-02 Matilde Marcolli , Alexander Port

A graph is a data structure composed of dots (i.e. vertices) and lines (i.e. edges). The dots and lines of a graph can be organized into intricate arrangements. The ability for a graph to denote objects and their relationships to one…

Data Structures and Algorithms · Computer Science 2010-09-07 Marko A. Rodriguez , Peter Neubauer

The near threshold expansion of Feynman diagrams is derived from their configuration space representation, by performing all x integrations. The general scalar Feynman diagram is considered, with an arbitrary number of external momenta, an…

High Energy Physics - Phenomenology · Physics 2007-05-23 E. Mendels

We argue that the Mellin-Barnes representations of Feynman diagrams can be used for obtaining linear systems of homogeneous differential equations for the original Feynman diagrams with arbitrary powers of propagators without recourse to…

High Energy Physics - Theory · Physics 2015-06-05 Mikhail Yu. Kalmykov , Bernd A. Kniehl

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…

High Energy Physics - Phenomenology · Physics 2009-11-10 Jian-Xiong Wang

The aim of XLOOPS is to calculate one-particle irreducible Feynman diagrams with one or two closed loops for arbitrary processes in the Standard model of particles and related theories. Up to now this aim is realized for all one-loop…

High Energy Physics - Phenomenology · Physics 2009-10-30 L. Brücher , J. Franzkowski , D. Kreimer

LevelScheme is a scientific figure preparation system for Mathematica. The main emphasis is upon the construction of level schemes, or level energy diagrams, as used in nuclear, atomic, molecular, and hadronic physics. LevelScheme also…

Computational Physics · Physics 2007-05-23 M. A. Caprio

We present a new interface called FeynHelpers that connects FeynCalc, a Mathematica package for symbolic semi-automatic evaluation of Feynman diagrams and calculations in quantum field theory (QFT) to Package-X and FIRE. The former provides…

Computational Physics · Physics 2018-01-30 Vladyslav Shtabovenko

We present an approach to the solution of decision problems formulated as influence diagrams. This approach involves a special triangulation of the underlying graph, the construction of a junction tree with special properties, and a message…

Artificial Intelligence · Computer Science 2013-02-28 Frank Jensen , Finn Verner Jensen , Soren L. Dittmer
‹ Prev 1 3 4 5 6 7 10 Next ›