Primitive asymptotics in ${\varphi }^4$ vector theory

Abstract

A longstanding conjecture in ${\varphi }_4^4$ theory is that primitive graphs dominate the beta function asymptotically at large loop order in the minimal-subtraction scheme. Here, we investigate this issue by exploiting additional combinatorial structure coming from an extension to vectors with $\mathrm{O}(N)$ symmetry. For the 0-dimensional case, we calculate the $N$-dependent generating function of primitive graphs and its asymptotics, including arbitrarily many subleading corrections. We find that the leading asymptotic growth rate becomes visible only above $\approx 25$ loops, while data at lower order is suggestive of a wrong asymptotics. Our results also yield the symmetry-factor weighted sum of 3-connected cubic graphs, and the exact asymptotics of Martin invariants.
For individual Feynman graphs, we give bounds on their degree in $N$ depending on their coradical degree, and construct the primitive graphs of highest degree explicitly. We calculate the 4D primitive beta function numerically up to 17 loops, and find its behaviour to be qualitatively similar to the 0D case. The locations of zeros quickly approach their large-loop asymptotics at negative integer $N$, while the growth rate of the beta function differs from the asymptotic prediction even at 17 loops.