相关论文: Feynman Diagrams via Graphical Calculus
We introduce a new combinatorial method to encode knots and links with applications to knot invariants. Clasp diagrams defined in this paper are combinatorial blueprints for building knot diagrams out of full twists on two strings rather…
A theorem of Kontsevich relates the homology of certain infinite dimensional Lie algebras to graph homology. We formulate this theorem using the language of reversible operads and mated species. All ideas are explained using a pictorial…
In this chapter (Chapter V) we present several results which demonstrate a close connection and useful exchange of ideas between graph theory and knot theory. These disciplines were shown to be related from the time of Tait (if not Listing)…
We present some approaches to the perturbative analysis of the classical and quantum gravity. First we introduce a graphical representation for a global SO(n) tensor $(\pl)^d h_\ab$, which generally appears in the weak field expansion…
We construct a diagrammatic coaction acting on one-loop Feynman graphs and their cuts. The graphs are naturally identified with the corresponding (cut) Feynman integrals in dimensional regularization, whose coefficients of the Laurent…
The diagrammatic coaction encodes the analytic structure of Feynman integrals by mapping any given Feynman diagram into a tensor product of diagrams defined by contractions and cuts of the original diagram. Feynman integrals evaluate to…
This paper derives the Feynman rules for the diagrammatic perturbation expansion of the effective action around an arbitrary solvable problem. The perturbation expansion around a Gaussian theory is well known and composed of one-line…
We provide a direct combinatorial proof of a Feynman graph identity which implies a wide generalization of a formality theorem by Kontsevich. For a Feynman graph $\Gamma$, we associate to each vertex a position $x_v \in \mathbb R$ and to…
"The Spin Foams for People Without the 3d/4d Imagination" could be an alternative title of our work. We derive spin foams from operator spin network diagrams} we introduce. Our diagrams are the spin network analogy of the Feynman diagrams.…
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…
!-graphs provide a means of reasoning about infinite families of string diagrams and have proven useful in manipulation of (co)algebraic structures like Hopf algebras, Frobenius algebras, and compositions thereof. However, they have…
We investigate Feynman graphs and their Feynman rules from the viewpoint of graph complexes. We focus on graph homology and on the appearance of cubical complexes when either reducing internal edges or when removing them by putting them on…
Two criteria for planarity of a Feynman diagram upon its propagators (momentum flows) are presented. Instructive Mathematica programs that solve the problem and examples are provided. A simple geometric argument is used to show that while…
The generating series of the intersection numbers of the stable cohomology classes on moduli spaces of curves satisfies the string equation and a KdV hierarchy. Kontsevich's original proof of this result uses a matrix model and the matrix…
This article contributes to the discussion on the relationship between the Neyman-Rubin and the graphical frameworks for causal inference. We present specific examples of data-generating mechanisms - such as those involving undirected or…
A java-based graphical tool for drawing Feynman diagrams is presented. It differs from similar existing tools in various respects. For example, it is based on models, consisting of particles (lines) and (optionally) vertices, each of which…
Graphical techniques provide a very useful practical device for calculations involving the so-called spin network states, which encode the quantum degrees of freedom of spatial geometry in loop quantum gravity. Graphical calculus of SU(2),…
We consider an algebraic formulation of Quantum Theory and develop a combinatorial model of the Heisenberg-Weyl algebra structure. It is shown that by lifting this structure to the richer algebra of graph operator calculus, we gain a simple…
We describe the combinatorics that arise in summing a double recursion formula for the enumeration of connected Feynman graphs in quantum field theory. In one index the problem is more tractable and yields concise formulas which are…
The diagrammatic coaction underpins the analytic structure of Feynman integrals, their cuts and the differential equations they admit. The coaction maps any diagram into a tensor product of its pinches and cuts. These correspond…