Related papers: FeynGame

We discuss a progress in calculation of Feynman integrals which has been done with help of the Differential Equation Method and demonstrate the results for a class of two-point two-loop diagrams.

For any given sequence of integers there exists a quantum field theory whose Feynman rules produce that sequence. An example is illustrated for the Stirling numbers. The method employed here offers a new direction in combinatorics and graph…

We study a referential game (a type of signaling game) where two agents communicate with each other via a discrete bottleneck to achieve a common goal. In our referential game, the goal of the speaker is to compose a message or a symbolic…

In this paper, we introduce a graph coloring game called the Edge-Distinguishing Game (EDGe). The edge-distinguishing chromatic number of a graph is used to determine the moves each player can make. We determine which player has a winning…

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…

In this paper, we introduce a new approach for drawing diagrams that have applications in software visualization. Our approach is to use a technique we call confluent drawing for visualizing non-planar diagrams in a planar way. This…

Graphs are used in many disciplines to model the relationships that exist between objects in a complex discrete system. Researchers may wish to compare a network of interest to a "typical" graph from a family (or ensemble) of graphs which…

The article is an overview of the role of graph complexes in the Feynman path integral quantization. The underlying mathematical language is that of PROPs and operads, and their representations. The sum over histories approach, the Feynman…

Feynman rules for the Standard Model including non-linear gauges are derived and implemented in the FeynArts package. The calculations using FeynArts with the new rules show that tree-level amplitudes are gauge invariant and that…

The present paper gives a mathematical, in particular, syntax-independent, formulation of intensionality and dynamics of computation in terms of games and strategies. Specifically, we give a game semantics for a higher-order programming…

We present the notion of separable game with respect to a forward directed hypergraph (FDH-graph), which refines and generalizes that of graphical game. First, we show that there exists a minimal FDH-graph with respect to which a game is…

A flagship application of quantum computers is the simulation of other quantum systems, including quantum field theories. In this article, we show how quantum computers can be employed to naturally calculate Feynman diagrams and their…

Hasse diagrams provide a principled means for visualizing the structure of statistical designs constructed by crossing and nesting of experimental factors. They have long been applied for automated construction of linear models and their…

The method of Symmetries of Feynman Integrals defines for any Feynman diagram a set of partial differential equations. On some locus in parameter space the equations imply that the diagram can be reduced to a linear combination of simpler…

Visual Query Answering (VQA) is of great significance in offering people convenience: one can raise a question for details of objects, or high-level understanding about the scene, over an image. This paper proposes a novel method to address…

We present a novel view on principal component analysis (PCA) as a competitive game in which each approximate eigenvector is controlled by a player whose goal is to maximize their own utility function. We analyze the properties of this PCA…

Game development is a highly technical practice that traditionally requires programming skills. This serves as a barrier to entry for would-be developers or those hoping to use games as part of their creative expression. While there have…

In this work, we consider an extension of graphical models to random graphs, trees, and other objects. To do this, many fundamental concepts for multivariate random variables (e.g., marginal variables, Gibbs distribution, Markov properties)…

We describe the design and implementation of a reasoning engine that facilitates the gamification of loop-invariant discovery. Our reasoning engine enables students, computational agents and regular software engineers with no formal methods…

Graph Neural Networks (GNNs) have achieved significant success across various applications. However, their complex structures and inner workings can be challenging for non-AI experts to understand. To address this issue, this study presents…