Hopf algebras and factorial divergent power series: Algebraic tools for graphical enumeration

Transcription

1 Hopf algebras and factorial divergent power series: Algebraic tools for graphical enumeration Michael Borinsky 1 Humboldt-University Berlin Departments of Physics and Mathematics Workshop on Enumerative Combinatorics, ESI, October Renormalized asymptotic enumeration of Feynman diagrams, Annals of Physics, October 2017 arxiv: borinsky@physik.hu-berlin.de M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 1

2 Overview 1 Motivation 2 Asymptotics of multigraph enumeration 3 Ring of factorially divergent power series 4 Counting subgraph-restricted graphs 5 Conclusions M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 2

3 Motivation Perturbation expansions in quantum field theory may be organized as sums of integrals. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 3

4 Motivation Perturbation expansions in quantum field theory may be organized as sums of integrals. Each integral maybe represented as a graph. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 3

5 Motivation Perturbation expansions in quantum field theory may be organized as sums of integrals. Each integral maybe represented as a graph. Usually these expansions have vanishing radius of convergence. The coefficients behave as f n CA n Γ(n + β) for large n. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 3

6 Motivation Perturbation expansions in quantum field theory may be organized as sums of integrals. Each integral maybe represented as a graph. Usually these expansions have vanishing radius of convergence. The coefficients behave as f n CA n Γ(n + β) for large n. Divergence is believed to be caused by proliferation of graphs. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 3

7 In zero dimensions the integration becomes trivial. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 4

8 In zero dimensions the integration becomes trivial. Observables are generating functions of certain classes of graphs [Hurst, 1952, Cvitanović et al., 1978, Argyres et al., 2001, Molinari and Manini, 2006]. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 4

9 In zero dimensions the integration becomes trivial. Observables are generating functions of certain classes of graphs [Hurst, 1952, Cvitanović et al., 1978, Argyres et al., 2001, Molinari and Manini, 2006]. For instance, the partition function in ϕ 3 theory is formally, ) dx ( Z ϕ3 ( ) = e 1 x2 2 + x3 3!. 2π R M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 4

10 In zero dimensions the integration becomes trivial. Observables are generating functions of certain classes of graphs [Hurst, 1952, Cvitanović et al., 1978, Argyres et al., 2001, Molinari and Manini, 2006]. For instance, the partition function in ϕ 3 theory is formally, ) dx ( Z ϕ3 ( ) = e 1 x2 2 + x3 3!. 2π R Formal expand under the integral sign and integrate over Gaussian term by term, Z ϕ3 ( ) := n=0 n (2n 1)!![x 2n ]e x3 3! M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 4

11 Z ϕ3 is the exponential generating function of 3-valent multigraphs, M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 5

12 Z ϕ3 is the exponential generating function of 3-valent multigraphs, Z ϕ3 ( ) = n=0 n (2n 1)!![x 2n ]e x3 3! = cubic graphs Γ E(Γ) V (Γ) Aut Γ M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 5

13 Z ϕ3 is the exponential generating function of 3-valent multigraphs, Z ϕ3 ( ) = n=0 n (2n 1)!![x 2n ]e x3 3! = cubic graphs Γ The parameter counts the excess of the graph. E(Γ) V (Γ) Aut Γ M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 5

14 Z ϕ3 is the exponential generating function of 3-valent multigraphs, Z ϕ3 ( ) = n=0 n (2n 1)!![x 2n ]e x3 3! = cubic graphs Γ The parameter counts the excess of the graph. E(Γ) V (Γ) Aut Γ Z ϕ3 ( ) = φ ( = ( ) ) where φ(γ) = E(Γ) V (Γ) maps a graph with excess n to n. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 5

15 Arbitrary degree distribution M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 6

16 Arbitrary degree distribution More general with arbitrary degree distribution, Z( ) = n (2n 1)!![x 2n ]e n=0 k 3 λ k k! x k M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 6

17 Arbitrary degree distribution More general with arbitrary degree distribution, Z( ) = n (2n 1)!![x 2n ]e n=0 = graphs Γ k 3 λ k k! x k E(Γ) V (Γ) v V (Γ) λ v Aut Γ where the sum is over all multigraphs Γ and v is the degree of vertex v. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 6

18 Arbitrary degree distribution More general with arbitrary degree distribution, Z( ) = n (2n 1)!![x 2n ]e n=0 = graphs Γ k 3 λ k k! x k E(Γ) V (Γ) v V (Γ) λ v Aut Γ where the sum is over all multigraphs Γ and v is the degree of vertex v. This corresponds to the pairing model of multigraphs [Bender and Canfield, 1978]. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 6

19 We obtain a series of polynomials M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 7

20 We obtain a series of polynomials n (2n 1)!![x 2n ]e n= k λ k k! x k ( = φ ) where φ(γ) = E(Γ) V (Γ) v V (Γ) λ v M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 7

21 We obtain a series of polynomials n (2n 1)!![x 2n ]e n= k λ k k! x k ( = φ ) where φ(γ) = E(Γ) V (Γ) v V (Γ) λ v (( 1 = ) λ ) 8 λ ( λ λ2 3λ λ λ 3λ λ 6 ) 2 + M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 7

22 We obtain a series of polynomials n (2n 1)!![x 2n ]e n= k λ k k! x k ( = φ ) where φ(γ) = E(Γ) V (Γ) v V (Γ) λ v (( 1 = ) λ ) 12 8 λ 4 ( λ λ2 3λ λ λ 3λ ) 48 λ = P n (λ 3, λ 4,...) n n=0 M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 7

23 Example Take the degree distribution λ k = 1 for all k 3. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 8

24 Example Take the degree distribution λ k = 1 for all k 3. Z stir ( ) := n (2n 1)!![x 2n ]e n=0 ( = φ k 3 1 k! xk ) +... where φ(γ) = ( 1) V (Γ) E(Γ) V (Γ) M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 8

25 Example Take the degree distribution λ k = 1 for all k 3. Z stir ( ) := n (2n 1)!![x 2n ]e n=0 ( = φ k 3 1 k! xk ) +... where φ(γ) = ( 1) V (Γ) E(Γ) V (Γ) ( 1 = ( 1) ( 1)2 + 1 ) 8 ( 1) M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 8

26 Example Take the degree distribution λ k = 1 for all k 3. Z stir ( ) := n (2n 1)!![x 2n ]e n=0 ( = φ k 3 1 k! xk ) +... where φ(γ) = ( 1) V (Γ) E(Γ) V (Γ) ( 1 = ( 1) ( 1)2 + 1 ) 8 ( 1) = M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 8

27 Example Take the degree distribution λ k = 1 for all k 3. Z stir ( ) := n (2n 1)!![x 2n ]e n=0 ( = φ k 3 1 k! xk ) +... where φ(γ) = ( 1) V (Γ) E(Γ) V (Γ) ( 1 = ( 1) ( 1)2 + 1 ) 8 ( 1) = = e n=1 B n+1 n(n+1) n M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 8

28 Example Take the degree distribution λ k = 1 for all k 3. Z stir ( ) := n (2n 1)!![x 2n ]e n=0 ( = φ k 3 1 k! xk ) +... where φ(γ) = ( 1) V (Γ) E(Γ) V (Γ) ( 1 = ( 1) ( 1)2 + 1 ) 8 ( 1) = = e Stirling series as a signed sum over multigraphs. n=1 B n+1 n(n+1) n M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 8

29 M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 9

30 Define a functional F : R[[x]] R[[ ]] F : S(x) n (2n 1)!![x 2n ]e n=0 where S(x) = x2 2 + λ k k 3 k! x k. x 2 2 +S(x) M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 9

31 Define a functional F : R[[x]] R[[ ]] F : S(x) n (2n 1)!![x 2n ]e n=0 x 2 2 +S(x) where S(x) = x2 2 + λ k k 3 k! x k. F maps a degree sequence to the corresponding generating function of multigraphs. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 9

32 Expressions as F[S(x)] = n (2n 1)!![x 2n ]e n=0 x 2 2 +S(x) are inconvenient to expand, because of the and the 1 exponent we have to sum over a diagonal. in the M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 10

33 Expressions as F[S(x)] = n (2n 1)!![x 2n ]e n=0 x 2 2 +S(x) are inconvenient to expand, because of the and the 1 exponent we have to sum over a diagonal. in the Theorem This can be expressed without a diagonal summation [MB, 2017]: F[S(x)] = n (2n + 1)!![y 2n+1 ]x(y), n=0 M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 10

34 Expressions as F[S(x)] = n (2n 1)!![x 2n ]e n=0 x 2 2 +S(x) are inconvenient to expand, because of the and the 1 exponent we have to sum over a diagonal. in the Theorem This can be expressed without a diagonal summation [MB, 2017]: F[S(x)] = n (2n + 1)!![y 2n+1 ]x(y), n=0 where x(y) is the (power series) solution of y 2 2 = S(x(y)). M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 10

35 Asymptotics M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 11

36 Asymptotics M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 11

37 Asymptotics Calculate asymptotics of F[S(x)] by singularity analysis of x(y): M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 11

38 Asymptotics Calculate asymptotics of F[S(x)] by singularity analysis of x(y): Locate the dominant singularity of x(y) by analysis of the (generalized) hyperelliptic curve, y 2 2 = S(x). M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 11

39 Asymptotics Calculate asymptotics of F[S(x)] by singularity analysis of x(y): Locate the dominant singularity of x(y) by analysis of the (generalized) hyperelliptic curve, y 2 2 = S(x). The dominant singularity of x(y) coincides with a branch-cut of the local parametrization of the curve. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 11

40 4 2 y x Figure: Example: The curve y 2 2 = x 2 2 x 3 3! associated to Z ϕ3. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 12

41 4 2 y x Figure: Example: The curve y 2 2 = x 2 2 x 3 3! associated to Z ϕ3. x(y) has a (dominant) branch-cut singularity at y = ρ = 2 3, where x(ρ) = τ = 2. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 12

42 M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 13

43 Near the dominant singularity: x(y) τ = d 1 1 y ρ + ( d j 1 y ) j 2 ρ j=2 M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 13

44 Near the dominant singularity: x(y) τ = d 1 1 y ρ + ( d j 1 y ) j 2 ρ j=2 ( ) [y n ]x(y) Cρ n n 3 e k n k k=1 M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 13

45 Near the dominant singularity: x(y) τ = d 1 1 y ρ + ( d j 1 y ) j 2 ρ j=2 ( ) [y n ]x(y) Cρ n n 3 e k n k Therefore, k=1 [ n ]F[S(x)] = (2n + 1)!![y 2n+1 ]x(y) M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 13

46 Near the dominant singularity: x(y) τ = d 1 1 y ρ + ( d j 1 y ) j 2 ρ j=2 ( ) [y n ]x(y) Cρ n n 3 e k n k Therefore, k=1 [ n ]F[S(x)] = (2n + 1)!![y 2n+1 ]x(y) = 2n Γ(n ) [y 2n+1 ]x(y) π M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 13

47 Near the dominant singularity: x(y) τ = d 1 1 y ρ + ( d j 1 y ) j 2 ρ j=2 ( ) [y n ]x(y) Cρ n n 3 e k n k Therefore, k=1 [ n ]F[S(x)] = (2n + 1)!![y 2n+1 ]x(y) = 2n Γ(n ) π [y 2n+1 ]x(y) ( C 2 n ρ 2n Γ(n) 1 + k=1 e k n k ) M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 13

48 Near the dominant singularity: x(y) τ = d 1 1 y ρ + ( d j 1 y ) j 2 ρ j=2 ( ) [y n ]x(y) Cρ n n 3 e k n k Therefore, k=1 [ n ]F[S(x)] = (2n + 1)!![y 2n+1 ]x(y) = 2n Γ(n ) π [y 2n+1 ]x(y) ( C 2 n ρ 2n Γ(n) 1 + What is the value of C and the e k? k=1 e k n k ) M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 13

49 Theorem ([MB, 2017]) Let (x, y) = (τ, ρ) be the location of the dominant branch-cut singularity of y 2 2 = S(x). Then R 1 [ n ]F[S(x)]( ) = c k A (n k) Γ(n k) + O ( A n Γ(n R) ), k=0 M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 14

50 Theorem ([MB, 2017]) Let (x, y) = (τ, ρ) be the location of the dominant branch-cut singularity of y 2 2 = S(x). Then R 1 [ n ]F[S(x)]( ) = c k A (n k) Γ(n k) + O ( A n Γ(n R) ), k=0 where A = S(τ) and c k = 1 2π [ k ]F[S(τ) S(x + τ)]( ). M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 14

51 Theorem ([MB, 2017]) Let (x, y) = (τ, ρ) be the location of the dominant branch-cut singularity of y 2 2 = S(x). Then R 1 [ n ]F[S(x)]( ) = c k A (n k) Γ(n k) + O ( A n Γ(n R) ), k=0 where A = S(τ) and c k = 1 2π [ k ]F[S(τ) S(x + τ)]( ). The asymptotic expansion can be expressed as a generating function of graphs. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 14

52 Example For cubic graphs or equivalently ϕ 3 theory, we are interested in S(x) = x2 2 + x3 3!, M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 15

53 Example For cubic graphs or equivalently ϕ 3 theory, we are interested in S(x) = x2 2 + x3 3!, F [S(x)] ( ) = φ ( ) M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 15

54 Example For cubic graphs or equivalently ϕ 3 theory, we are interested in S(x) = x2 2 + x3 3!, F [S(x)] ( ) = φ ( ) We find τ = 2, A = 2 3 and the coefficients of the asymptotic expansion c k k = F[S(τ) S(τ + x)]( ) = 2π 2π F[ x 2 + x 3 3! ]( ) k=0 = 1 ( π ) M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 15

55 Example For cubic graphs or equivalently ϕ 3 theory, we are interested in S(x) = x2 2 + x3 3!, F [S(x)] ( ) = φ ( ) We find τ = 2, A = 2 3 and the coefficients of the asymptotic expansion c k k = F[S(τ) S(τ + x)]( ) = 2π 2π F[ x 2 + x 3 3! ]( ) k=0 = 1 ( π ) The asymptotic expansion is [ n ]F [S(x)] ( ) = R 1 k=0 c ka n+k Γ(n k) + O(A n+r Γ(n R)). M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 15

56 Ring of factorially divergent power series Power series which have Poincaré asymptotic expansion of the form M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 16

57 Ring of factorially divergent power series Power series which have Poincaré asymptotic expansion of the form R 1 f n = c k A n+k Γ(n k) + O(A n Γ(n R)) R 0, k=0 form a subring of R[[x]] which is closed under composition and inversion of power series [MB, 2016]. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 16

58 Ring of factorially divergent power series Power series which have Poincaré asymptotic expansion of the form R 1 f n = c k A n+k Γ(n k) + O(A n Γ(n R)) R 0, k=0 form a subring of R[[x]] which is closed under composition and inversion of power series [MB, 2016]. For instance, this allows us to calculate the complete asymptotic expansion of constructions such as in closed form. log F [S(x)] ( ) M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 16

59 Renormalization M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 17

60 Renormalization Renormalization Restriction on the allowed bridgeless subgraphs. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 17

61 Renormalization Renormalization Restriction on the allowed bridgeless subgraphs. P is a set of forbidden subgraphs. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 17

62 Renormalization Renormalization Restriction on the allowed bridgeless subgraphs. P is a set of forbidden subgraphs. We wish to have a map { E(Γ) V (Γ) if Γ has no subgraph in P φ P (Γ) = 0 else M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 17

63 Renormalization Renormalization Restriction on the allowed bridgeless subgraphs. P is a set of forbidden subgraphs. We wish to have a map { E(Γ) V (Γ) if Γ has no subgraph in P φ P (Γ) = 0 else which is compatible with our generating function and asymptotic techniques. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 17

64 G is the Q-algebra generated by multigraphs. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 18

65 G is the Q-algebra generated by multigraphs. Split G = G G + such that M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 18

66 G is the Q-algebra generated by multigraphs. Split G = G G + such that G + is the set of graphs without subgraphs in P. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 18

67 G is the Q-algebra generated by multigraphs. Split G = G G + such that G + is the set of graphs without subgraphs in P. G is the set of graphs with subgraphs in P. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 18

68 G is the Q-algebra generated by multigraphs. Split G = G G + such that G + is the set of graphs without subgraphs in P. G is the set of graphs with subgraphs in P. We know a map φ : G R[[ ]]. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 18

69 G is the Q-algebra generated by multigraphs. Split G = G G + such that G + is the set of graphs without subgraphs in P. G is the set of graphs with subgraphs in P. We know a map φ : G R[[ ]]. Construct φ P such that φ P G + = φ and φ P G = 0. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 18

70 G is the Q-algebra generated by multigraphs. Split G = G G + such that G + is the set of graphs without subgraphs in P. G is the set of graphs with subgraphs in P. We know a map φ : G R[[ ]]. Construct φ P such that φ P G + = φ and φ P G = 0. This is a Riemann-Hilbert problem. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 18

71 Hopf algebra of graphs Pick a set of bridgeless graphs P, such that if γ 1 γ 2 then γ 1, γ 2 P iff γ 1, γ 2 /γ 1 P (1) if γ 1, γ 2 P then γ 1 γ 2 P (2) P (3) M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 19

72 Hopf algebra of graphs Pick a set of bridgeless graphs P, such that if γ 1 γ 2 then γ 1, γ 2 P iff γ 1, γ 2 /γ 1 P (1) if γ 1, γ 2 P then γ 1 γ 2 P (2) P (3) H is the Q-algebra of graphs in P. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 19

73 Hopf algebra of graphs Pick a set of bridgeless graphs P, such that if γ 1 γ 2 then γ 1, γ 2 P iff γ 1, γ 2 /γ 1 P (1) if γ 1, γ 2 P then γ 1 γ 2 P (2) P H is the Q-algebra of graphs in P. Define a coaction on G: : G H G Γ γ Γ/γ γ Γ s.t.γ P (3) M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 19

74 Hopf algebra of graphs Pick a set of bridgeless graphs P, such that if γ 1 γ 2 then γ 1, γ 2 P iff γ 1, γ 2 /γ 1 P (1) if γ 1, γ 2 P then γ 1 γ 2 P (2) P H is the Q-algebra of graphs in P. Define a coaction on G: : G H G Γ γ Γ/γ H is a left-comodule over G. γ Γ s.t.γ P (3) M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 19

75 Hopf algebra of graphs Pick a set of bridgeless graphs P, such that if γ 1 γ 2 then γ 1, γ 2 P iff γ 1, γ 2 /γ 1 P (1) if γ 1, γ 2 P then γ 1 γ 2 P (2) P H is the Q-algebra of graphs in P. Define a coaction on G: : G H G Γ γ Γ/γ γ Γ s.t.γ P H is a left-comodule over G. can be set up on H. : H H H. (3) M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 19

76 Hopf algebra of graphs Pick a set of bridgeless graphs P, such that if γ 1 γ 2 then γ 1, γ 2 P iff γ 1, γ 2 /γ 1 P (1) if γ 1, γ 2 P then γ 1 γ 2 P (2) P H is the Q-algebra of graphs in P. Define a coaction on G: : G H G Γ γ Γ/γ γ Γ s.t.γ P H is a left-comodule over G. can be set up on H. : H H H. H is a Hopf algebra Connes and Kreimer [2001]. (3) M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 19

77 Hopf algebra of graphs Pick a set of bridgeless graphs P, such that if γ 1 γ 2 then γ 1, γ 2 P iff γ 1, γ 2 /γ 1 P (1) if γ 1, γ 2 P then γ 1 γ 2 P (2) P H is the Q-algebra of graphs in P. Define a coaction on G: : G H G Γ γ Γ/γ γ Γ s.t.γ P H is a left-comodule over G. can be set up on H. : H H H. H is a Hopf algebra Connes and Kreimer [2001]. (1) implies is coassociative (id ) = ( id). M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 19 (3)

78 M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 20

79 The coaction shall keep information about the number of edges it was connected in the original graph. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 20

80 The coaction shall keep information about the number of edges it was connected in the original graph. The graphs in P have legs or hairs. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 20

81 The coaction shall keep information about the number of edges it was connected in the original graph. The graphs in P have legs or hairs. Example: Suppose,, P, then = γ /γ = γ s.t.γ P where we had to consider the subgraphs,,, the complete and the empty subgraph. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 20

82 Gives us an action on algebra morphisms G R[[ ]]. For ψ : H R[[ ]] and φ : G R[[ ]], ψ φ : G R[[ ]] ψ φ = m (ψ φ) M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 21

83 Gives us an action on algebra morphisms G R[[ ]]. For ψ : H R[[ ]] and φ : G R[[ ]], ψ φ : G R[[ ]] ψ φ = m (ψ φ) and a product of algebra morphisms H R[[ ]]. For ξ : H R[[ ]] and ψ : H R[[ ]], ξ ψ : H R[[ ]] ξ ψ = m (ξ ψ) M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 21

84 Gives us an action on algebra morphisms G R[[ ]]. For ψ : H R[[ ]] and φ : G R[[ ]], ψ φ : G R[[ ]] ψ φ = m (ψ φ) and a product of algebra morphisms H R[[ ]]. For ξ : H R[[ ]] and ψ : H R[[ ]], ξ ψ : H R[[ ]] ξ ψ = m (ξ ψ) Coassociativity of implies associativity of : (ξ ψ) φ = ξ (ψ φ) M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 21

85 The set of all algebra morphisms H R[[ ]] with the -product forms a group. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 22

86 The set of all algebra morphisms H R[[ ]] with the -product forms a group. The identity ɛ : H R[[ ]] maps the empty graph to 1 and all other graphs to 0. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 22

87 The set of all algebra morphisms H R[[ ]] with the -product forms a group. The identity ɛ : H R[[ ]] maps the empty graph to 1 and all other graphs to 0. The inverse of ψ : H R[[ ]] maybe calculated recursively: ψ 1 (Γ) = ψ(γ) γ Γ s.t.γ P ψ 1 (γ)ψ(γ/γ) M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 22

88 The set of all algebra morphisms H R[[ ]] with the -product forms a group. The identity ɛ : H R[[ ]] maps the empty graph to 1 and all other graphs to 0. The inverse of ψ : H R[[ ]] maybe calculated recursively: ψ 1 (Γ) = ψ(γ) γ Γ s.t.γ P ψ 1 (γ)ψ(γ/γ) Corresponds to Moebius-Inversion on the subgraph poset. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 22

89 The set of all algebra morphisms H R[[ ]] with the -product forms a group. The identity ɛ : H R[[ ]] maps the empty graph to 1 and all other graphs to 0. The inverse of ψ : H R[[ ]] maybe calculated recursively: ψ 1 (Γ) = ψ(γ) γ Γ s.t.γ P ψ 1 (γ)ψ(γ/γ) Corresponds to Moebius-Inversion on the subgraph poset. Simplifies on many (physical) cases to a (functional) inversion problem on power series. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 22

90 The set of all algebra morphisms H R[[ ]] with the -product forms a group. The identity ɛ : H R[[ ]] maps the empty graph to 1 and all other graphs to 0. The inverse of ψ : H R[[ ]] maybe calculated recursively: ψ 1 (Γ) = ψ(γ) γ Γ s.t.γ P ψ 1 (γ)ψ(γ/γ) Corresponds to Moebius-Inversion on the subgraph poset. Simplifies on many (physical) cases to a (functional) inversion problem on power series. Solves the Riemann-Hilbert problem: Invert φ : Γ E(Γ) V (Γ) restricted to H. Then { (φ 1 H φ)(γ) = E(Γ) V (Γ) if Γ G + 0 else M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 22

91 The identity van Suijlekom [2007], Yeats [2008], X = graphs Γ where X = graphs Γ v V (Γ) Γ Aut Γ and X ( v ) P X (k) P = Γ Aut Γ. Γ s.t.γ P and Γ has k legs Γ Aut Γ, M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 23

92 The identity van Suijlekom [2007], Yeats [2008], X = graphs Γ where X = graphs Γ v V (Γ) Γ Aut Γ and X ( v ) P X (k) P = Γ Aut Γ. Γ s.t.γ P and Γ has k legs Γ Aut Γ, can be used to make this accessible for asymptotic analysis: φ 1 H φ (X ) = m ( φ 1 H φ) X = ( ) φ 1 H X ( v ) φ(γ) P Aut Γ graphs Γ v V (Γ) M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 23

93 φ 1 H φ (X ) = graphs Γ v V (Γ) ( φ 1 H X ( v ) P ) φ(γ) Aut Γ M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 24

94 φ 1 H φ (X ) = graphs Γ v V (Γ) ( φ 1 H X ( v ) P ) φ(γ) Aut Γ The generating function of all graphs with arbitrary weight for each vertex degree is n (2n 1)!![x 2n ]e n=0 = graphs Γ v V (Γ) λ v k 0 λ k k! x k E(Γ) V (Γ) Aut Γ M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 24

95 φ 1 H φ (X ) = graphs Γ v V (Γ) ( φ 1 H X ( v ) P ) φ(γ) Aut Γ The generating function of all graphs with arbitrary weight for each vertex degree is Therefore, φ 1 H n (2n 1)!![x 2n ]e n=0 = graphs Γ v V (Γ) λ v k 0 φ (X ) = n (2n 1)!![x 2n ]e n=0 λ k k! x k E(Γ) V (Γ) Aut Γ ( k 0 xk k! φ 1 H X (k) P ) M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 24

96 φ 1 H φ (X ) = n (2n 1)!![x 2n ]e n=0 ( k 0 xk k! φ 1 H X (k) P ) M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 25

97 φ 1 H φ (X ) = n (2n 1)!![x 2n ]e n=0 ( k 0 xk k! φ 1 H In quantum field theories we want the set P to be all graphs with a bounded number of legs. X (k) P ) M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 25

98 φ 1 H φ (X ) = n (2n 1)!![x 2n ]e n=0 ( k 0 xk k! φ 1 H In quantum field theories we want the set P to be all graphs with a bounded number of legs. This corresponds to restrictions on the edge-connectivity of the graphs. X (k) P ) M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 25

99 φ 1 H φ (X ) = n (2n 1)!![x 2n ]e n=0 ( k 0 xk k! φ 1 H In quantum field theories we want the set P to be all graphs with a bounded number of legs. This corresponds to restrictions on the edge-connectivity of the graphs. In renormalizable quantum field theories the expressions φ 1 H ( X (k) P ) are relatively easy to expand. X (k) P ) M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 25

100 φ 1 H φ (X ) = n (2n 1)!![x 2n ]e n=0 ( k 0 xk k! φ 1 H In quantum field theories we want the set P to be all graphs with a bounded number of legs. This corresponds to restrictions on the edge-connectivity of the graphs. In renormalizable ( ) quantum field theories the expressions φ 1 H X (k) P are relatively easy to expand. ( ) The generating functions φ 1 H X (k) P are called counterterms in this context. X (k) P ) M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 25

101 φ 1 H φ (X ) = n (2n 1)!![x 2n ]e n=0 ( k 0 xk k! φ 1 H In quantum field theories we want the set P to be all graphs with a bounded number of legs. This corresponds to restrictions on the edge-connectivity of the graphs. In renormalizable quantum field theories the expressions φ 1 H ( X (k) P ) are relatively easy to expand. ( ) are called The generating functions φ 1 H X (k) P counterterms in this context. They are (almost) the generating functions of the number of primitive elements of H: Γ is primitive iff Γ = Γ Γ. X (k) P ) M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 25

102 φ 1 H φ (X ) = n (2n 1)!![x 2n ]e n=0 ( k 0 xk k! φ 1 H In quantum field theories we want the set P to be all graphs with a bounded number of legs. This corresponds to restrictions on the edge-connectivity of the graphs. In renormalizable quantum field theories the expressions φ 1 H ( X (k) P ) are relatively easy to expand. ( ) are called The generating functions φ 1 H X (k) P counterterms in this context. They are (almost) the generating functions of the number of primitive elements of H: Γ is primitive iff Γ = Γ Γ. We can obtain the full asymptotic expansions in these cases. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 25 X (k) P )

103 Examples Expressed as densities over all multigraphs: M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 26

104 Examples Expressed as densities over all multigraphs: In ϕ 3 -theory (i.e. three-valent multigraphs): M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 26

105 Examples Expressed as densities over all multigraphs: In ϕ 3 -theory (i.e. three-valent multigraphs): P(Γ is 2-edge-connected) = e 1 ( n +...). M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 26

106 Examples Expressed as densities over all multigraphs: In ϕ 3 -theory (i.e. three-valent multigraphs): P(Γ is 2-edge-connected) = e 1 ( n +...). P(Γ is cyclically 4-edge-connected) = e ( n + ) M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 26

107 Examples Expressed as densities over all multigraphs: In ϕ 3 -theory (i.e. three-valent multigraphs): P(Γ is 2-edge-connected) = e 1 ( n +...). P(Γ is cyclically 4-edge-connected) = e ( n + ) In ϕ 4 -theory (i.e. four-valent multigraphs): P(Γ is cyclically 6-edge-connected) = e ( n + ). M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 26

108 Examples Expressed as densities over all multigraphs: In ϕ 3 -theory (i.e. three-valent multigraphs): P(Γ is 2-edge-connected) = e 1 ( n +...). P(Γ is cyclically 4-edge-connected) = e ( n + ) In ϕ 4 -theory (i.e. four-valent multigraphs): P(Γ is cyclically 6-edge-connected) = e ( n + ). Arbitrary high order terms can be obtained by iteratively solving implicit equations. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 26

109 Conclusions M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 27

110 Conclusions The zero-dimensional path integral is a convenient tool to enumerate multigraphs by excess. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 27

111 Conclusions The zero-dimensional path integral is a convenient tool to enumerate multigraphs by excess. Asymptotics are easily accessible: The asymptotic expansion also enumerates graphs. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 27

112 Conclusions The zero-dimensional path integral is a convenient tool to enumerate multigraphs by excess. Asymptotics are easily accessible: The asymptotic expansion also enumerates graphs. With Hopf algebra techniques restrictions on the set of enumerated graphs can be imposed. M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 27

113 EN Argyres, AFW van Hameren, RHP Kleiss, and CG Papadopoulos. Zero-dimensional field theory. The European Physical Journal C-Particles and Fields, 19(3): , Edward A Bender and E Rodney Canfield. The asymptotic number of labeled graphs with given degree sequences. Journal of Combinatorial Theory, Series A, 24(3): , A Connes and D Kreimer. Renormalization in quantum field theory and the Riemann Hilbert Problem ii: The β-function, diffeomorphisms and the renormalization group. Communications in Mathematical Physics, 216(1): , P Cvitanović, B Lautrup, and RB Pearson. Number and weights of Feynman diagrams. Physical Review D, 18(6):1939, CA Hurst. The enumeration of graphs in the Feynman-Dyson technique. In Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences, volume 214, pages The Royal Society, MB. Generating asymptotics for factorially divergent sequences. arxiv preprint arxiv: , M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 27

114 MB. Renormalized asymptotic enumeration of feynman diagrams. arxiv preprint arxiv: , LG Molinari and N Manini. Enumeration of many-body skeleton diagrams. The European Physical Journal B-Condensed Matter and Complex Systems, 51(3): , Walter D van Suijlekom. Renormalization of gauge fields: A hopf algebra approach. Communications in Mathematical Physics, 276(3): , Karen Yeats. Growth estimates for dyson-schwinger equations. arxiv preprint arxiv: , M. Borinsky (HU Berlin) Algebraic tools for graphical enumeration 27