Related papers: Combinatorial QFT on graphs: first quantization fo…
We introduce Compositional Quantum Field Theory (CQFT) as an axiomatic model of Quantum Field Theory, based on the principles of locality and compositionality. Our model is a refinement of the axioms of General Boundary Quantum Field…
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…
The quantum field theories (QFT) constructed in [1,2] include phenomenology of interest. The constructions approximate: scattering by $1/r$ and Yukawa potentials in non-relativistic approximations; and the first contributing order of the…
Graph theory is important in information theory. We introduce a quantization process on graphs and apply the quantized graphs in quantum information. The quon language provides a mathematical theory to study such quantized graphs in a…
Quantum graphs are commonly used as models of complex quantum systems, for example molecules, networks of wires, and states of condensed matter. We consider quantum statistics for indistinguishable spinless particles on a graph,…
Symplectic quantization is a functional approach to quantum field theory that allows sampling of quantum fluctuations directly in Minkowski space time by means of a Hamiltonian dynamics in an intrinsic time $\tau$ which samples a…
Quantum graphs were introduced to model free electrons in organic molecules using a self-adjoint Hamiltonian on a network of intervals. A second graph quantization describes wave propagation on a graph by specifying scattering matrices at…
Using the Cartan formulation of General Relativity, we construct a well defined lattice-regularized theory capable to describe large non-perturbative quantum fluctuations of the frame field (or the metric) and of the spin connection. To…
To any graph with external half-edges and internal masses, we associate canonical integrals which depend non-trivially on particle masses and momenta, and are always finite. They are generalised Feynman integrals which satisfy graphical…
In [1, 2, 3] the Corolla Polynomial $ \mathcal C (\Gamma) \in \mathbb C [a_{h_1}, \ldots, a_{h_{\left \vert \Gamma^{[1/2]} \right \vert}}] $ was introduced as a graph polynomial in half-edge variables $ \left \{ a_h \right \} _{h \in…
We investigate combinatorial and algebraic aspects of the interplay between renormalization and monodromies for Feynman amplitudes. We clarify how extraction of subgraphs from a Feynman graph interacts with putting edges onshell or with…
We construct a bosonic quantum field on a general quantum graph. Consistency of the construction leads to the calculation of the total scattering matrix of the graph. This matrix is equivalent to the one already proposed using generalized…
We define formal geometric quantisation for proper Hamiltonian actions by possibly noncompact groups on possibly noncompact, prequantised symplectic manifolds, generalising work of Weitsman and Paradan. We study the functorial properties of…
This is the first in a series of papers on an attempt to understand quantum field theory mathematically. In this paper we shall introduce and study BV QFT algebra and BV QFT as the proto-algebraic model of quantum field theory by exploiting…
We give a general expression for the normally ordered form of a function F(w(a,a*)) where w is a function of boson annihilation and creation operators satisfying [a,a*]=1. The expectation value of this expression in a coherent state becomes…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
The coordinate-free formulation of canonical quantization, achieved by a flat-space Brownian motion regularization of phase-space path integrals, is extended to a special class of closed first-class constrained systems that is broad enough…
A representation of the perturbation series of a general functional measure is given in terms of generalized Feynman graphs and -rules. The graphical calculus is applied to certain functional measures of L\'evy type. A graphical notion of…
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…
We introduce graph potentials, which are Laurent polynomials associated to (colored) trivalent graphs. We show that the birational type of the graph potential only depends on the homotopy type of the colored graph, and use this to define a…