Related papers: Combinatorial QFT on graphs: first quantization fo…
In quantum field theory the path integral is usually formulated in the wave picture, i.e., as a sum over field evolutions. This path integral is difficult to define rigorously because of analytic problems whose resolution may ultimately…
This paper will describe how combinatorial interpretations can help us understand the algebraic structure of two aspects of perturbative quantum field theory, namely analytic Dyson-Schwinger equations and periods of scalar Feynman graphs.…
The Feynman rules assign to every graph an integral which can be written as a function of a scaling parameter L. Assuming L for the process under consideration is very small, so that contributions to the renormalizaton group are small, we…
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…
Perturbative quantum field theory usually uses second quantisation and Feynman diagrams. The worldline formalism provides an alternative approach based on first quantised particle path integrals, similar in spirit to string perturbation…
We discuss how basic notions of graph theory and associated graph polynomials define questions for algebraic geometry, with an emphasis given to an analysis of the structure of Feynman rules as determined by those graph polynomials as well…
The paper deals with some spectral properties of (mostly infinite) quantum and combinatorial graphs. Quantum graphs have been intensively studied lately due to their numerous applications to mesoscopic physics, nanotechnology, optics, and…
In this talk we discuss mathematical structures associated to Feynman graphs. Feynman graphs are the backbone of calculations in perturbative quantum field theory. The mathematical structures -- apart from being of interest in their own…
Quantum physics has revealed many interesting formal properties associated with the algebra of two operators, A and B, satisfying the partial commutation relation AB-BA=1. This study surveys the relationships between classical combinatorial…
The paper puts together some loosely connected observations, old and new, on the concept of a quantum field and on the properties of Feynman amplitudes. We recall, in particular, the role of (exceptional) elementary induced representations…
Quantum gauge theory in the connection representation uses functions of holonomies as configuration observables. Physical observables (gauge and diffeomorphism invariant) are represented in the Hilbert space of physical states; physical…
We introduce the combinatorial notion of a $q$-fatorization graph intended as a tool to study and express results related to the classification of prime simple modules for quantum affine algebras. These are directed graphs equipped with…
Although symmetry methods and analysis are a necessary ingredient in every physicist's toolkit, rather less use has been made of combinatorial methods. One exception is in the realm of Statistical Physics, where the calculation of the…
In this article we are introducing combinatorial spectra of graphs, this is a generalization of $H$-Hamiltonian spectra. The main motivation was to made from $H$-Hamiltonian spectra an operation and develop some algebra in this field. An…
We review the combinatorial structure of perturbative quantum field theory with emphasis given to the decomposition of graphs into primitive ones. The consequences in terms of unique factorization of Dyson--Schwinger equations into Euler…
In perturbative QED, the approximation is improved by summing more Feynman graphs; in non-perturbative QCD, by refining the lattice. Here we observe that in quantum gravity the two procedures may well be the same. We outline the…
In recent years enormous progress has been made in perturbative quantum field theory by applying methods of algebraic geometry to parametric Feynman integrals for scalar theories. The transition to gauge theories is complicated not only by…
In this short review we first recall combinatorial or ($0-$dimensional) quantum field theory (QFT). We then give the main idea of a standard QFT method, called the intermediate field method, and we review how to apply this method to a…
The general normal ordering problem for boson strings is a combinatorial problem. In this note we restrict ourselves to single-mode boson monomials. This problem leads to elegant generalisations of well-known combinatorial numbers, such as…
A finite discrete graph is turned into a quantum (metric) graph once a finite length is assigned to each edge and the one-dimensional Laplacian is taken to be the operator. We study the dependence of the spectral gap (the first positive…