Combinatorial QFT on graphs: First quantization formalism

  • Ivan Contreras

    Amherst College, Amherst, USA
  • Santosh Kandel

    California State University, Sacramento, USA
  • Pavel Mnev

    University of Notre Dame, Notre Dame, USA; Institute of Mathematics of the Russian Academy of Sciences, St. Petersburg, Russia
  • Konstantin Wernli

    University of Southern Denmark, Odense M, Denmark
Combinatorial QFT on graphs: First quantization formalism cover
Download PDF

A subscription is required to access this article.


We study a combinatorial model of the quantum scalar field with polynomial potential on a graph. In the first quantization formalism, the value of a Feynman graph is given by a sum over maps from the Feynman graph to the spacetime graph (mapping edges to paths). This picture interacts naturally with Atiyah–Segal-like cutting-gluing of spacetime graphs. In particular, one has combinatorial counterparts of the known gluing formulae for Green’s functions and (zeta-regularized) determinants of Laplacians.

Cite this article

Ivan Contreras, Santosh Kandel, Pavel Mnev, Konstantin Wernli, Combinatorial QFT on graphs: First quantization formalism. Ann. Inst. Henri Poincaré Comb. Phys. Interact. (2024), published online first

DOI 10.4171/AIHPD/194