Combinatorial Dyson-Schwinger Equations of Quartic Matrix Field Theory
Alexander Hock, Johannes Thürigen
TL;DR
This work develops a rigorous combinatorial framework for quartic matrix field theory by constructing a Connes–Kreimer Hopf algebra of 4-regular planar ribbon graphs with a single boundary and formulating coupled combinatorial Dyson–Schwinger equations for the 2- and 4-point sectors. A refined grafting operator $B_+^\Gamma$ is introduced to account for graph insertions and overlaps, yielding a precise, renormalizable structure with a subalgebra decomposition controlled by loop order and a Hochschild 1-cocycle property under a key consistency condition. The authors derive an exact renormalized solution for the planar 2-point function in 4D, uncovering a dimensional reduction with effective spectral dimension $D_\lambda=4-2\frac{\arcsin(\lambda\pi)}{\pi}$ and an anomalous dimension $\gamma=-\frac{1}{\pi}\arctan(\lambda\pi)$, illustrating nontrivial, renormalizable behavior in a nonlocal QFT. Overall, the paper clarifies how combinatorial renormalization structures extend to nonlocal matrix field theories, highlights the limits posed by infinite primitives and graph-dependent factors, and points toward incorporating Ward identities and deeper algebraic structures in more realistic QFTs.
Abstract
Matrix field theory is a combinatorially non-local field theory which has recently been found to be a non-trivial but solvable QFT example. To generalize such non-perturbative structures to other models, a more combinatorial understanding of Dyson-Schwinger equations and their solutions is of high interest. To this end we consider combinatorial Dyson-Schwinger equations manifestly relying on the Hopf-algebraic structure of perturbative renormalization. We find that these equations are fully compatible with renormalization, relying only on the superficially divergent diagrams which are planar ribbon graphs, i.e. decompleted dual combinatorial maps. Still, they are of a similar kind as in realistic models of local QFT, featuring in particular an infinite number of primitive diagrams as well as graph-dependent combinatorial factors.
