Knots and Numbers inϕ4Theory to 7 Loops and Beyond

We evaluate all the primitive divergences contributing to the 7-loop β-function ofɸ4theory, i.e. all 59 diagrams that are free of subdivergences and hence give scheme-independent contributions. Guided by the association of diagrams with knots, we obtain analytical results for 56 diagrams. The remaining three diagrams, associated with the knots10124,10139, and10152, are evaluated numerically, to 10 sf. Only one satellite knot with 11 crossings is encountered and the transcendental number associated with it is found. Thus we achieve an analytical result for the 6-loop contributions, and a numerical result at 7 loops that is accurate to one part in1011. The series of ‘zig-zag’ counterterms,$\left\{ {6{\rm{\zeta }}_{\rm{3}} ,\,20{\rm{\zeta }}_{\rm{5}} ,\,\frac{{441}}{8}{\rm{\zeta }}_{\rm{7}} ,\,168{\rm{\zeta }}_{\rm{9}} ,\,...} \right\}$, previously known forn=3, 4, 5, 6loops, is evaluated to 10 loops, corresponding to 17 crossings, revealing that then-loop zig-zag term is$4C_{n - 1} \sum\nolimits_{p \succ 0} {\frac{{\left( { - 1} \right)^{pn - n} }}{{p^{2n - 3} }}} $, where$C_n = \frac{1}{{n + 1}}\left({\begin{array}{*{20}c} {2n} \\ n \\\end{array}} \right)$are the Catalan numbers, familiar in knot theory. The investigations reported here entailed intensive use of REDUCE, to generateO(104)lines of code for multiple precision FORTRAN computations, enabled by Bailey’s MPFUN routines, running forO(103)CPUhours on DecAlpha machines.