# 1 Introduction

## 1 Introduction

In this work we develop the Hopf algebra of renormalization  to progress beyond the rainbow  and chain  approximations for anomalous dimensions.

Summing rainbows: In $`d`$ dimensions, the massless scalar one-loop integral with propagators to the powers $`\alpha ,\beta `$ is

$$G(\alpha ,\beta ;d):=g(\alpha )g(\beta )g(d\alpha \beta );g(\alpha ):=\mathrm{\Gamma }(d/2\alpha )/\mathrm{\Gamma }(\alpha )$$
(1)   
Now consider the interaction $`g\varphi ^{}\sigma \varphi `$, with a neutral scalar particle $`\sigma `$ coupled to a charged scalar $`\varphi `$, in the critical dimension, $`d_c=6`$. To find the anomalous field dimension $`\gamma `$ of $`\varphi `$, in the rainbow approximation of , one solves the consistency condition

$$1=aG(1,1+\gamma ;6)=\frac{a}{\gamma (\gamma 1)(\gamma 2)(\gamma 3)}$$
(2)   
which ensures that the coupling $`a:=g^2/(4\pi )^{d_c/2}`$ cancels the insertion of the anomalous self energy. The perturbative solution of the resulting quartic is easily found:

$$\gamma _{\mathrm{rainbow}}=\frac{3\sqrt{5+4\sqrt{1+a}}}{2}=\frac{a}{6}+11\frac{a^2}{6^3}206\frac{a^3}{6^5}+\mathrm{}$$
(3)   
Resumming chains: At the other extreme, one may easily perform the Borel resummation of chains of self-energy insertions, within a single rainbow. Suppose that the self energy $`p^2\overline{\mathrm{\Sigma }}(a,p^2/\mu ^2)`$ is renormalized in the momentum scheme, and hence vanishes at $`p^2=\mu ^2`$. The renormalized massless propagator is $`\overline{D}=1/(p^2p^2\overline{\mathrm{\Sigma }})`$. Then (3) is the rainbow approximation for $`\overline{\mathrm{\Sigma }}/\mathrm{log}(\mu ^2)`$ at $`p^2=\mu ^2`$. Following the methods of , one finds that the corresponding asymptotic series for chains is Borel resummable:

$$\gamma _{\mathrm{chain}}=6_0^{\mathrm{}}\frac{\mathrm{exp}(6x/a)dx}{(x+1)(x+2)(x+3)}\frac{a}{6}+11\frac{a^2}{6^3}170\frac{a^3}{6^5}+\mathrm{}$$
(4)   
which differs from the rainbow approximation at 3 loops, with 206 in (3) coming from the triple rainbow, while 170 in (4) comes from a chain of two self energies inside a third.

Hopf algebra: We shall progress beyond the rainbow and chain approximations by including all possible nestings and chainings of the one-loop self-energy divergence. In other words, we consider the full Hopf algebra of undecorated rooted trees, established in  and implemented in . Two figures suffice to exhibit the class of diagrams considered, and their divergence structure. The first exhibits a 12-loop example, the second exhibits its divergence structure. Due to the fact that we combine chains and rainbows, we have a full tree structure : the depth of the tree is larger than one, and there can be more than one edge attached to a vertex.

There are 4 notable features of this analysis.

1. We use the coproduct $`\mathrm{\Delta }`$ to combine the antipode $`S`$ and grading operator $`Y`$ in a star product $`SY`$ whose residue delivers the contribution of each rooted tree.
2. We show that the rationality of rainbows  extends to the contribution of every undecorated rooted tree, as had been inferred from examples in .
3. We confirm that a recent analysis  of dimensional regularization applies at both $`d_c=4`$ and $`d_c=6`$, detecting poles of $`\mathrm{\Gamma }`$ functions that occur in even dimensions.
4. We obtain, to 30 loops, highly non-trivial alternating asymptotic series, which we resum, to high precision, by combining Padé  and Borel  methods.

## 2 Hopf-algebra method

Let $`t`$ be an undecorated rooted tree, denoting the divergence structure of a Feynman diagram. Then its coproduct is defined, recursively, by

$$\mathrm{\Delta }(t)=te+idB_+(\mathrm{\Delta }(B_{}(t)))$$
(5)   
where $`e`$ is the empty tree, evaluating to unity, $`id`$ is the identity map, $`B_{}`$ removes the root, giving a product of trees in general, and $`B_+`$ is the inverse of $`B_{}`$, combining products by restoring a common root. The recursion terminates with $`\mathrm{\Delta }(e)=ee`$ and develops a highly non-trivial structure by the operation of the coproduct on products of trees

$$\mathrm{\Delta }\left(_kt_k\right)=_k\mathrm{\Delta }(t_k)$$
(6)   
between each removal and restoration of a root. In Sweedler notation, it takes the form

$$\mathrm{\Delta }(t)=_ka_k^{(1)}a_k^{(2)}=te+et+_k^{}a_k^{(1)}a_k^{(2)}$$
(7)   
with single trees on the right and, in general, products on the left. The prime in the second summation indicates the absence of the empty tree. The field-theoretic role of the coproduct is clear: on the left products of subdivergences are identified; on the right these shrink to points. Subtractions are effected by the antipode, defined by the recursion

$$S(t)=t_k^{}S(a_k^{(1)})a_k^{(2)}$$
(8)   
for a non-empty tree, with $`S(_kt_k)=_kS(t_k)`$ for products and $`S(e)=e`$.

Renormalization involves a twisted antipode, $`S_R`$. Let $`\varphi `$ denote the Feynman map that assigns a dimensionally regularized bare value $`\varphi (t)`$ to the diagram whose divergence structure is labelled by the tree $`t`$. Then we apply the recursive definition 

$$S_R(t)=R\left(\varphi (t)+_k^{}S_R(a_k^{(1)})\varphi (a_k^{(2)})\right)$$
(9)   
with a renormalization operator $`R`$ that sets $`p^2=\mu ^2`$, in both the momentum and MS schemes, and in the MS scheme selects only the poles in $`\epsilon :=(d_cd)/2`$.

We can use the coproduct to combine operators. Suppose that $`O_1`$ and $`O_2`$ operate on trees and their products. Then we define the star product $`O_1O_2`$ by

$$O_1O_2(t)=_kO_1(a_k^{(1)})O_2(a_k^{(2)})$$
(10)   
with ordinary multiplication performed after $`O_1`$ operates on the left and $`O_2`$ on the right of each term in the coproduct. By construction, $`Sid`$ annihilates everything except the empty tree, $`e`$. The presence of $`R`$ makes $`S_R\varphi `$ finite and non-trivial. In particular, the renormalized Green function is simply

$$\mathrm{\Gamma }_R(t)=\underset{\epsilon 0}{lim}S_R\varphi (t)$$
(11)   
whose evaluation was efficiently encoded in , using a few lines of computer algebra.

Here we present a new – and vital – formula for efficiently computing the contribution of an undecorated tree to the anomalous dimension. It is simply

$$\gamma (t)=\underset{\epsilon 0}{lim}\epsilon \varphi (SY(t))$$
(12)   
where $`Y`$ is the grading operator, with $`Y(t)=nt`$, for a tree with $`n`$ nodes. In general, $`Y`$ multiplies a product of trees by its total number of nodes. To see that this works, consider the terms in (11), in the momentum scheme, before taking the limit $`\epsilon 0`$. Each term has a momentum dependence $`\left(p^2\right)^{n(dd_c)/2}`$, where $`n`$ is the number of loops (and hence nodes) of the tree on the right of the term in the Sweedler sum. If we multiply by $`n\epsilon `$, and then let $`\epsilon 0`$, we clearly obtain the derivative w.r.t. $`\mathrm{log}(\mu ^2/p^2)`$. Setting $`p^2=\mu ^2`$ we obtain the contribution to the anomalous dimension. Thus $`R`$ plays no role and we may replace $`S_R(t)`$ by $`lim_{Rid}S_R(t)=\varphi (S(t))`$, where $`S`$ is the canonical antipode. Multiplication by $`n\epsilon `$ is achieved by $`\epsilon \varphi (Y(t))=n\epsilon \varphi (t)`$ on the right of the coproduct, where $`Y`$ acts only on single trees. Hence the abstract operator $`SY`$ delivers the precise combination of products of trees whose bare evaluation as Feynman diagrams is guaranteed to have merely a $`1/\epsilon `$ singularity, with residue equal to the contribution to the anomalous dimension. Thus we entirely separate the combinatorics from the analysis.

## 3 Example

By way of example, we show how the 3-loop expansions of (3,4) result from (12). The combinatorics are now clear. The analysis, at first sight, seems to entail the detailed properties of $`\mathrm{\Gamma }`$ functions. However, appearances can be misleading.

In general, a dimensionally regularized bare value for a $`n`$-loop diagram, corresponding to the undecorated rooted tree $`t`$, is evaluated by the recursion 

$$\varphi (t)=\frac{L(\epsilon ,n\epsilon )}{n\epsilon }\underset{k}{}\varphi (b_k)$$
(13)   
where $`b_k`$ are the branches originating from the root of $`t`$. It terminates with $`\varphi (e)=1`$. For the scalar theory with $`d_c=6`$, the master function is

$$L(\epsilon ,\delta )=\frac{a\delta }{\left(p^2\right)^\epsilon }G(1,1+\delta \epsilon ;62\epsilon )=\frac{a}{\left(p^2\right)^\epsilon }\frac{\mathrm{\Gamma }(1\delta )\mathrm{\Gamma }(1+\delta )\mathrm{\Gamma }(2\epsilon )}{\mathrm{\Gamma }(4\delta \epsilon )\mathrm{\Gamma }(1+\delta \epsilon )}$$
(14)   
Now the wonderful feature of (12) is that it depends only on the derivatives of $`L(\epsilon ,\delta )`$ w.r.t. $`\delta `$ at $`\epsilon =0`$. This reflects the fact that the anomalous dimension, unlike the Green function, is insensitive to the details of the regularization method. Thus we may, with huge savings in computation time, replace the master function by

$$L(0,\delta )=\frac{a}{(\delta 1)(\delta 2)(\delta 3)}=\underset{n0}{}g_n\delta ^n=\frac{a}{6}+11\frac{a\delta }{6^2}85\frac{a\delta ^2}{6^3}+O(\delta ^3)$$
(15)   
which establishes that the contribution of each rooted tree is rational. The residue of the anomalous dimension operator $`SY`$ feels only the rational residues of $`\mathrm{\Gamma }`$ functions; it is blind to the zeta-valued derivatives that contribute to the renormalized Green function.

Now that the analysis has been drastically simplified, we return to the combinatorics. The double rainbow, $`t_2`$, has coproduct $`\mathrm{\Delta }(t_2)=t_2e+et_2+t_1t_1`$ where $`t_1`$ is the single rainbow, with $`\mathrm{\Delta }(t_1)=t_1e+et_1`$. The antipodes are $`S(t_1)=t_1`$ and $`S(t_2)=t_2+t_1^2`$. The star products are $`SY(t_1)=t_1`$ and $`SY(t_2)=2t_2t_1^2`$. Hence the contributions to the anomalous dimensions are the residues of $`L(0,\epsilon )/\epsilon `$ and $`(L(0,2\epsilon )L(0,\epsilon ))L(0,\epsilon )/\epsilon ^2`$, namely $`g_0=a/6`$ and $`g_1g_0=11a^2/6^3`$.

Following this simple example, the reader should find it easy to determine the anomalous dimension contributions of the two rooted trees at 3 loops. For $`t_3`$, the triple rainbow graph, $`SY`$ delivers $`3t_33t_1t_2+t_1^3`$, with residue $`g_2g_0^2+g_1^2g_0=(85+11^2)a^3/6^5`$, in agreement with (3). For the other diagram, $`t_3^{}`$, with a double chain in a single rainbow, it delivers $`3t_3^{}4t_1t_2+t_1^3`$ with residue $`2g_2g_0^2=2\times 85a^3/6^5`$, in agreement with (4). The Borel resummation (4) of chains corresponds to the result $`n!g_ng_0^n`$ for a chain of $`n`$ self energies, inside a single rainbow. Writing the anomalous dimension contribution of the full Hopf algebra as the asymptotic series

$$\gamma _{\mathrm{hopf}}\underset{n>0}{}G_n\frac{(a)^n}{6^{2n1}}$$
(16)   
we find that $`G_3=3\times 85+11^2=376`$.

In this paper, we undertake Padé-Borel resummation of the full Hopf series (16), to 30 loops. We also resum

$$\stackrel{~}{\gamma }_{\mathrm{hopf}}\underset{n>0}{}\stackrel{~}{G}_n\frac{(a)^n}{2^{2n1}}$$
(17)   
for the anomalous dimension of a fermion field with a Yukawa interaction $`g\overline{\psi }\sigma \psi `$, at $`d_c=4`$, whose rainbow approximation

$$\stackrel{~}{\gamma }_{\mathrm{rainbow}}=1\sqrt{1+a}$$
(18)   
was obtained in . At the other extreme, the Borel-resummed chain approximation

$$\stackrel{~}{\gamma }_{\mathrm{chain}}=2_0^{\mathrm{}}\frac{\mathrm{exp}(2x/a)dx}{x+2}$$
(19)   
is easily obtained from the Yukawa generating function, $`\stackrel{~}{L}(0,\delta )=a/(\delta 2)`$.

## 4 Results to 30 loops

At 4 loops, there are 5 undecorated Wick contractions, corresponding to 4 rooted trees, one of which has weight 2. For the scalar theory, at $`d_c=6`$, the tally is

$$G_4=4890+4711+3595+3595+3450=20241=3^2\times 13\times 173$$
(20)   
Already this becomes tedious to compute by hand. Fortunately, the recursions (5,8) of the coproduct and antipode make it sublimely easy to automate the procedure (12).

At $`n`$ loops, the number of relevant Wick contractions is the Catalan number $`C_{n1}`$, where $`C_n:=\frac{1}{n+1}\left(\genfrac{}{}{0pt}{}{2n}{n}\right)`$. At 30 loops, there are $`C_{29}=\mathrm{1\hspace{0.17em}002\hspace{0.17em}242\hspace{0.17em}216\hspace{0.17em}651\hspace{0.17em}368}`$ contractions. Symmetries reduce these to rooted trees, with weights determined recursively by $`W(t)=w(t)_kW(b_k)`$ where $`b_k`$ are the branches obtained by removing the root of $`t`$. The symmetry factor of the root is $`w(t)=(_jn_j)!/_jn_j!`$ where $`n_j`$ is the number of branches of type $`j`$. The generating formula for $`R_n`$, the number of rooted trees with $`n`$ nodes, is  $`_{n>0}R_nx^n=x_{n>0}(1x^n)^{R_n}`$ which expresses the fact that removal of roots from all trees with $`n`$ nodes produces all products of trees with a total of $`n1`$ nodes. This gives $`R_{30}=\mathrm{354\hspace{0.17em}426\hspace{0.17em}847\hspace{0.17em}597}`$. The number of terms produced by applying the BPHZ procedure  to a single tree with $`n`$ nodes is $`2^n`$.

From these enumerations, one finds – with some trepidation – that computation to 30 loops entails $`_{n30}2^nR_n=\mathrm{463\hspace{0.17em}020\hspace{0.17em}146\hspace{0.17em}037\hspace{0.17em}416\hspace{0.17em}130\hspace{0.17em}934}`$ subtractions, each requiring 30 terms in its Laurent expansion, with coefficients involving integers of $`O(10^{60})`$. Brute force would require processing of $`O(10^{24})`$ bits of data, which is far beyond anything contemplated by current computer science. The remedy is clear: recursion of coproduct and antipode, to compute the residues of the anomalous dimension operator $`SY`$.

Each new coproduct or antipode refers to others with fewer loops. By storing these we easily progressed to 13 loops, extending the sequence $`G_n`$ to

$`1,11,376,20241,1427156,121639250,12007003824,1337583507153,`$

$`165328009728652,22404009743110566,3299256277254713760,`$

$`524366465815117346250,89448728780073829991976`$

For $`\stackrel{~}{G}_n`$, in the Yukawa case, we obtained the 13-loop sequence

$`1,1,4,27,248,2830,38232,593859,10401712,202601898`$

$`4342263000,101551822350,2573779506192`$

At this point, recursion of individual trees hit a ceiling imposed by memory limitations.

Beyond 13 loops, we stored only the unique combination of terms that is needed at higher loops, namely the momentum-scheme renormalized self energy. Allocating 750 megabytes of main memory to Reduce 3.7 , the time to reach 30 loops was 8 hours. Of these, more than 2 hours were spent on garbage collection, indicating the combinatoric complexity. Results for the scalar and Yukawa theories are in Tables 1 and 2. They are highly non-trivial. Factorization of $`G_{27}=2^6\times 5\times 103\times 184892457645048836717\times 69943104850621681268329469624581`$ needed significant use of Richard Crandall’s elliptic curve routine , while $`G_{29}/240`$ is a 60-digit integer that is most probably prime.

## 5 Padé-Borel resummation

We combine Padé-approximant  and Borel-transformation  methods. From (4) we obtain the pure chain contribution $`G_{n+1}^{\mathrm{chain}}=(2^n+(2^n1)3^{n+1})n!`$ with, for example, $`G_4^{\mathrm{chain}}=(8+7\times 81)\times 6=3450`$ appearing in (20) as the smallest contribution of the 5 Wick contractions at 4 loops, while the pure rainbow contribution, $`4711`$, is next to largest. This is far removed from the situation at large $`n`$, where the pure rainbow term is factorially smaller than the pure chain term. At large $`n`$, we combine $`C_{n1}4^{n1}/\sqrt{n^3\pi }`$ Wick contractions, some of which are of order $`G_n^{\mathrm{chain}}`$, while some are far smaller. It is thus difficult to anticipate the large-$`n`$ behaviour of $`G_n`$. We adopted an empirical approach, finding that $`S_n:=12^{1n}G_n/\mathrm{\Gamma }(n+2)`$ varies little for $`n[14,30]`$, as shown in the final column of Table 1. In the Yukawa case of Table 2, we found little variation in $`\stackrel{~}{S}_n:=2^{1n}\stackrel{~}{G}_n/\mathrm{\Gamma }(n+1/2)`$.

In the scalar case, at $`d_c=6`$, Padé-Borel resummation may be achieved by the Ansatz

$$\gamma _{\mathrm{hopf}}\frac{a}{12}_0^{\mathrm{}}P(ax/3)e^xx^2𝑑x$$
(21)   
where $`P(y)=1+O(y)`$ is a $`[M\backslash N]`$ Padé approximant, with numerator $`1+_{m=1}^Mc_my^m`$ and denominator $`1+_{n=1}^Nd_ny^n`$, chosen so as to reproduce the first $`M+N+1`$ terms in the asymptotic series (16). We expect $`P(y)`$ to have singularities only in the left half-plane. In particular, a pole near $`y=1`$ is expected, corresponding to the approximate constancy of $`S_n`$ in Table 1. We fitted the first 29 values of $`G_n`$ with a $`[14\backslash 14]`$ Padé approximant $`P(y)`$, finding a pole at $`y0.994`$. The other 13 poles have $`\mathrm{}y<1`$. Moreover there is no zero with $`\mathrm{}y>0`$. The test-value $`G_{30}`$ is reproduced to a precision of $`5\times 10^{16}`$.

In the Yukawa case, at $`d_c=4`$, we made the Ansatz

$$\stackrel{~}{\gamma }_{\mathrm{hopf}}\frac{a}{\sqrt{\pi }}_0^{\mathrm{}}Q(ax/2)e^xx^{1/2}𝑑x;Q(y):=\frac{\stackrel{~}{P}(y)}{1+y}$$
(22)   
suggested by Table 2. Here we put in by hand the suspected pole at $`y=1`$. The $`[14\backslash 14]`$ approximant to $`\stackrel{~}{P}(y)=1+O(y)`$ then has all its 14 poles at $`\mathrm{}y<1`$ and no zero with $`\mathrm{}y>0`$. The test-value $`\stackrel{~}{G}_{30}`$ is reproduced to a reassuring precision of $`4\times 10^{17}`$.

Table 3 compares resummation of the full Hopf results (16,17) with those from the far more restrictive chain and rainbow subsets. To test the precision of resummations (21,22), we used the star product (12) to perform the $`2.6\times 10^{21}`$ BPHZ subtractions that yield the exact 31-loop coefficients

$`G_{31}`$ $`=`$ $`2^6\times 3^3\times 5\times 139\times 2957\times 22279\times 69318820356301\times 9602299922477621`$ (23)   
$`\times 144927172127490232568467`$   
$`\stackrel{~}{G}_{31}`$ $`=`$ $`2^5\times 3^4\times 5\times 71\times 109\times 13224049649\times 473202021103152647613521`$ (24)   
No change in the final digits of Table 3 results from using these. At the prodigious Yukawa coupling $`g=30`$, corresponding to $`a=(30/4\pi )^25.7`$, a $`[15\backslash 15]`$ Padé approximant gives $`\stackrel{~}{\gamma }_{\mathrm{hopf}}1.85202761`$, differing by less than 1 part in $`10^8`$ from the $`[14\backslash 14]`$ result $`\stackrel{~}{\gamma }_{\mathrm{hopf}}1.85202762`$. It appears that resummation of undecorated rooted trees is under very good control, notwithstanding the combinatoric explosion apparent in (23,24).

## 6 Conclusions

As stated in the introduction, we achieved 4 goals. First, we found the Hopf-algebra construct (12) that delivers undecorated contributions to anomalous dimensions. Then we found that these are rational, with the $`\mathrm{\Gamma }`$ functions of (14) contributing only their residues, via (15). Next, we exemplified the analysis of dimensional regularization in , at two different critical dimensions, $`d_c=6`$ and $`d_c=4`$. The residues of a common set (1) of $`\mathrm{\Gamma }`$ functions determine both results. Finally, we obtained highly non-trivial results, from all combinations of rainbows and chains, to 30 loops. A priori, we had no idea how these would compare with the easily determined pure chain contributions. Tables 1 and 2 suggest that at large $`n`$ the full Hopf-algebra results exceed pure chains by factors that scale like $`n^22^n`$ and $`n^{1/2}2^n`$, respectively. Padé approximation gave 15-digit agreement with exact 30-loop results. In Table 3, we compare the Borel resummations (21,22) of the full Hopf algebra with the vastly simpler rainbow approximations (3,18) and the still rather trivial chain approximations (4,19). Even at the very large Yukawa coupling $`g=30`$ we claim 8-digit precision. Apart from large-$`N_f`$ approximations , we know of no other large-coupling analysis of anomalous dimension contributions, at spacetime dimensions $`d4`$, that progresses beyond pure rainbows  or pure chains .

In conclusion: Hopf algebra tames the combinatorics of renormalization, by disentangling the iterative subtraction of primitive subdivergences from the analytical challenge of evaluating dimensionally regularized bare values for Feynman diagrams. Progress with the analytic challenge shall require the expansion of skeleton graphs in the regularization parameter $`D4`$. After that, the Hopf algebra of decorated rooted trees provides the tool to take care of the combinatorial challenge of renormalization in general. Generalizations of the methods here to cases where decorations are different, but still analytically trivial, are conceivable. The results in  are of this form. In the present case, where the combinatoric explosion is ferocious, while the analysis is routine, the automation of renormalization by Hopf algebra is a joy. How else might one resum $`2.6\times 10^{21}`$ BPHZ subtractions at 31 loops and achieve 8-digit precision at very strong coupling?

Acknowledgements: This work was undertaken during the workshop Number Theory and Physics at the ESI in November 1999, where we enjoyed discussions with Pierre Cartier, Werner Nahm, Ivan Todorov and Jean-Bernard Zuber. Past work with Alain Connes, Bob Delbourgo, John Gracey and Andrey Grozin supports the present paper.

Table 1: Scalar coefficients in (16), with $`S_n:=12^{1n}G_n/\mathrm{\Gamma }(n+2)`$

$$\begin{array}{ccc}n\hfill & G_n\hfill & S_n\hfill \\ & & \\ 14\hfill & 16301356287284530869810308\hfill & 0.1165\hfill \\ 15\hfill & 3161258841758986060906197536\hfill & 0.1177\hfill \\ 16\hfill & 650090787950164885954804021185\hfill & 0.1186\hfill \\ 17\hfill & 141326399508139818539694443090940\hfill & 0.1194\hfill \\ 18\hfill & 32389192708918228594003667471390750\hfill & 0.1200\hfill \\ 19\hfill & 7805642594117634874205145727265669184\hfill & 0.1205\hfill \\ 20\hfill & 1973552096478862083584247237907087008846\hfill & 0.1209\hfill \\ 21\hfill & 522399387732959889862436502331522596697560\hfill & 0.1212\hfill \\ 22\hfill & 144486332652501966354908665093390779463113660\hfill & 0.1215\hfill \\ 23\hfill & 41681362292986022786933211385817840822702468640\hfill & 0.1217\hfill \\ 24\hfill & 12520661507532542738174037622803485508817145773050\hfill & 0.1218\hfill \\ 25\hfill & 3910338928202486568787314743084879349561179264255736\hfill & 0.1220\hfill \\ 26\hfill & 1267891158800355844456289086726128521948839015617187260\hfill & 0.1221\hfill \\ 27\hfill & 426237156086127437403654947366849019736474802601497417920\hfill & 0.1221\hfill \\ 28\hfill & 148382376919675149120919349602375065827367635238832722748020\hfill & 0.1222\hfill \\ 29\hfill & 53428133467243180546330391126922442419952183999220340144106320\hfill & 0.1222\hfill \\ 30\hfill & 19876558632009586773182109989526780486481329823560105761256963720\hfill & 0.1222\hfill \end{array}$$

Table 2: Yukawa coefficients in (17), with $`\stackrel{~}{S}_n:=2^{1n}\stackrel{~}{G}_n/\mathrm{\Gamma }(n+1/2)`$

$$\begin{array}{ccc}n\hfill & \stackrel{~}{G}_n\hfill & \stackrel{~}{S}_n\hfill \\ & & \\ 14\hfill & 70282204726396\hfill & 0.3715\hfill \\ 15\hfill & 2057490936366320\hfill & 0.3750\hfill \\ 16\hfill & 64291032462761955\hfill & 0.3780\hfill \\ 17\hfill & 2136017303903513184\hfill & 0.3806\hfill \\ 18\hfill & 75197869250518812754\hfill & 0.3828\hfill \\ 19\hfill & 2796475872605709079512\hfill & 0.3848\hfill \\ 20\hfill & 109549714522464120960474\hfill & 0.3865\hfill \\ 21\hfill & 4509302910783496963256400\hfill & 0.3880\hfill \\ 22\hfill & 194584224274515194731540740\hfill & 0.3894\hfill \\ 23\hfill & 8784041120771057847338352720\hfill & 0.3906\hfill \\ 24\hfill & 414032133398397494698579333710\hfill & 0.3917\hfill \\ 25\hfill & 20340342746544244143487152873888\hfill & 0.3928\hfill \\ 26\hfill & 1039819967521866936447997028508900\hfill & 0.3937\hfill \\ 27\hfill & 55230362672853506023203822058592752\hfill & 0.3946\hfill \\ 28\hfill & 3043750896574866226650924152479935036\hfill & 0.3953\hfill \\ 29\hfill & 173814476864493583374050720641310171808\hfill & 0.3961\hfill \\ 30\hfill & 10272611586206353744425870217572111879288\hfill & 0.3968\hfill \end{array}$$

Table 3: Comparison of chain, rainbow and full Hopf contributions

$$\begin{array}{ccccccc}a\hfill & \gamma _{\mathrm{chain}}\hfill & \gamma _{\mathrm{rainbow}}\hfill & \gamma _{\mathrm{hopf}}\hfill & \stackrel{~}{\gamma }_{\mathrm{chain}}\hfill & \stackrel{~}{\gamma }_{\mathrm{rainbow}}\hfill & \stackrel{~}{\gamma }_{\mathrm{hopf}}\hfill \\ & & & & & & \\ 0.5\hfill & 0.0727579\hfill & 0.0731322\hfill & 0.0742476\hfill & 0.2245593\hfill & 0.2247449\hfill & 0.2278233\hfill \\ 1.0\hfill & 0.1301409\hfill & 0.1322419\hfill & 0.1373080\hfill & 0.4126913\hfill & 0.4142136\hfill & 0.4281423\hfill \\ 1.5\hfill & 0.1773375\hfill & 0.1825988\hfill & 0.1937609\hfill & 0.5765641\hfill & 0.5811388\hfill & 0.6118625\hfill \\ 2.0\hfill & 0.2172313\hfill & 0.2268615\hfill & 0.2455916\hfill & 0.7226572\hfill & 0.7320508\hfill & 0.7837372\hfill \\ 2.5\hfill & 0.2516214\hfill & 0.2665867\hfill & 0.2939133\hfill & 0.8549759\hfill & 0.8708287\hfill & 0.9464649\hfill \\ 3.0\hfill & 0.2817148\hfill & 0.3027756\hfill & 0.3394353\hfill & 0.9762193\hfill & 1.0000000\hfill & 1.1017856\hfill \\ 3.5\hfill & 0.3083635\hfill & 0.3361156\hfill & 0.3826462\hfill & 1.0883141\hfill & 1.1213203\hfill & 1.2509126\hfill \\ 4.0\hfill & 0.3321923\hfill & 0.3671015\hfill & 0.4239016\hfill & 1.1926947\hfill & 1.2360680\hfill & 1.3947383\hfill \\ 4.5\hfill & 0.3536734\hfill & 0.3961033\hfill & 0.4634712\hfill & 1.2904639\hfill & 1.3452079\hfill & 1.5339452\hfill \\ 5.0\hfill & 0.3731724\hfill & 0.4234058\hfill & 0.5015652\hfill & 1.3824908\hfill & 1.4494897\hfill & 1.6690711\hfill \\ 5.5\hfill & 0.3909778\hfill & 0.4492331\hfill & 0.5383523\hfill & 1.4694751\hfill & 1.5495098\hfill & 1.8005504\hfill \\ 6.0\hfill & 0.4073216\hfill & 0.4737658\hfill & 0.5739698\hfill & 1.5519895\hfill & 1.6457513\hfill & 1.9287404\hfill \end{array}$$