The corolla polynomial: a graph polynomial on half-edges

Similar documents
PoS(LL2016)035. Cutkosky Rules from Outer Space. Dirk Kreimer Humboldt Univ.

SECTION A STUDENT MATERIAL. Part 1. What and Why.?

Pre-Lie algebras, rooted trees and related algebraic structures

where the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b

Section 4.4. Green s Theorem

CIT 596 Theory of Computation 1. Graphs and Digraphs

CS 491G Combinatorial Optimization Lecture Notes

Mid-Term Examination - Spring 2014 Mathematical Programming with Applications to Economics Total Score: 45; Time: 3 hours

Particle Physics. Michaelmas Term 2011 Prof Mark Thomson. Handout 3 : Interaction by Particle Exchange and QED. Recap

Tutorial Worksheet. 1. Find all solutions to the linear system by following the given steps. x + 2y + 3z = 2 2x + 3y + z = 4.

Counting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs

Can one hear the shape of a drum?

1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides.

Math 32B Discussion Session Week 8 Notes February 28 and March 2, f(b) f(a) = f (t)dt (1)

Graph States EPIT Mehdi Mhalla (Calgary, Canada) Simon Perdrix (Grenoble, France)

CHENG Chun Chor Litwin The Hong Kong Institute of Education

A Study on the Properties of Rational Triangles

Arrow s Impossibility Theorem

April 8, 2017 Math 9. Geometry. Solving vector problems. Problem. Prove that if vectors and satisfy, then.

Lecture 1 - Introduction and Basic Facts about PDEs

CS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6

Unit 4. Combinational Circuits

Project 6: Minigoals Towards Simplifying and Rewriting Expressions

SOLUTIONS TO ASSIGNMENT NO The given nonrecursive signal processing structure is shown as

First Midterm Examination

Algorithms & Data Structures Homework 8 HS 18 Exercise Class (Room & TA): Submitted by: Peer Feedback by: Points:

Section 1.3 Triangles

( ) { } [ ] { } [ ) { } ( ] { }

NON-DETERMINISTIC FSA

MAT 403 NOTES 4. f + f =

Petri Nets. Rebecca Albrecht. Seminar: Automata Theory Chair of Software Engeneering

Technische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution

Lecture Notes No. 10

Electromagnetism Notes, NYU Spring 2018

A study of ghost gluon vertices in MAG: Feynman rules

Nondeterministic Automata vs Deterministic Automata

A Lower Bound for the Length of a Partial Transversal in a Latin Square, Revised Version

(a) A partition P of [a, b] is a finite subset of [a, b] containing a and b. If Q is another partition and P Q, then Q is a refinement of P.

are coplanar. ˆ ˆ ˆ and iˆ

Graph Theory. Simple Graph G = (V, E). V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)}

arxiv: v1 [math.ca] 21 Aug 2018

Linear Algebra Introduction

ILLUSTRATING THE EXTENSION OF A SPECIAL PROPERTY OF CUBIC POLYNOMIALS TO NTH DEGREE POLYNOMIALS

Greedoid polynomial, chip-firing, and G-parking function for directed graphs. Connections in Discrete Mathematics

The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS

Part 4. Integration (with Proofs)

TOPIC: LINEAR ALGEBRA MATRICES

ON LEFT(RIGHT) SEMI-REGULAR AND g-reguar po-semigroups. Sang Keun Lee

Hyers-Ulam stability of Pielou logistic difference equation

Behavior Composition in the Presence of Failure

Solutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite!

QUADRATIC EQUATION. Contents

Intermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths

First Midterm Examination

Logic Synthesis and Verification

Bisimulation, Games & Hennessy Milner logic

Matrices SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics (c) 1. Definition of a Matrix

Part I: Study the theorem statement.

On Implicative and Strong Implicative Filters of Lattice Wajsberg Algebras

Algorithm Design and Analysis

y1 y2 DEMUX a b x1 x2 x3 x4 NETWORK s1 s2 z1 z2

CS 573 Automata Theory and Formal Languages

Strong Bisimulation. Overview. References. Actions Labeled transition system Transition semantics Simulation Bisimulation

Global alignment. Genome Rearrangements Finding preserved genes. Lecture 18

AP Calculus BC Chapter 8: Integration Techniques, L Hopital s Rule and Improper Integrals

Symmetrical Components 1

Random subgroups of a free group

Finite State Automata and Determinisation

Two Triads of Congruent Circles from Reflections

Algorithm Design and Analysis

Necessary and sucient conditions for some two. Abstract. Further we show that the necessary conditions for the existence of an OD(44 s 1 s 2 )

18.06 Problem Set 4 Due Wednesday, Oct. 11, 2006 at 4:00 p.m. in 2-106

New Expansion and Infinite Series

LESSON 11: TRIANGLE FORMULAE

Learning Objectives of Module 2 (Algebra and Calculus) Notes:

Prefix-Free Regular-Expression Matching

LIP. Laboratoire de l Informatique du Parallélisme. Ecole Normale Supérieure de Lyon

Arrow s Impossibility Theorem

1. For each of the following theorems, give a two or three sentence sketch of how the proof goes or why it is not true.

Introduction to Olympiad Inequalities

6.5 Improper integrals

Factorising FACTORISING.

Activities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions

Lecture 6: Coding theory

Lecture Summaries for Multivariable Integral Calculus M52B

Numbers and indices. 1.1 Fractions. GCSE C Example 1. Handy hint. Key point

Nondeterministic Finite Automata

T b a(f) [f ] +. P b a(f) = Conclude that if f is in AC then it is the difference of two monotone absolutely continuous functions.

Solutions to Assignment 1

] dx (3) = [15x] 2 0

1 From NFA to regular expression

GM1 Consolidation Worksheet

PAIR OF LINEAR EQUATIONS IN TWO VARIABLES

Co-ordinated s-convex Function in the First Sense with Some Hadamard-Type Inequalities

Lecture 08: Feb. 08, 2019

Converting Regular Expressions to Discrete Finite Automata: A Tutorial

In right-angled triangles the square on the side subtending the right angle is equal to the squares on the sides containing the right angle.

4.4 Areas, Integrals and Antiderivatives

Computational Biology Lecture 18: Genome rearrangements, finding maximal matches Saad Mneimneh

MA10207B: ANALYSIS SECOND SEMESTER OUTLINE NOTES

Transcription:

: grph polynomil on hlf-edges Depts. of Physis nd Mthemtis Humoldt University, Berlin E-mil: kreimer@physik.hu-erlin.de The study of Feynmn rules is muh filitted y the two Symnzik polynomils, homogeneous polynomils sed on edge vriles for given Feynmn grph. We review here the role of reently disovered third grph polynomil sed on hlf-edges whih filittes the trnsition from slr to guge theory mplitudes: the oroll polynomil. We review in prtiulr the use of grph homology in the onstrution of this polynomil. Loops nd Legs in Quntum Field Theory (LL2018) 29 April 2018-04 My 2018 St. Gor, Germny Speker. Thnks to Johnnes Blümlein nd Peter Mrqurd for orgnizing our workshop. Copyright owned y the uthor(s) under the terms of the Cretive Commons Attriution-NonCommeril-NoDerivtives 4.0 Interntionl Liense (CC BY-NC-ND 4.0). https://pos.siss.it/

1. Introdution The omputtion of guge theory suffers the enormous numer of integrls one is onfronted with. This results from the ft tht the numer of Feynmn grphs ontriuting to given mplitude is muh igger thn in slr field theory, nd from the ft tht the spin struture of the Feynmn rules gives muh more omplited tensoril struture. Hene, the redution to mster integrls is muh more umersome undertking. Here we report on reent progress onneting the integrnd for onneted mplitude in non-elin guge theory to the mplitude for slr onneted 3-regulr mplitude: ll verties re ui. 2. Slr vs Guge Theory mplitudes The strting point is the mplitude for Feynmn grph in slr ui theory whih is given (in D=4 dimensions sy) through the two grph- or Symnzik-polynomils Φ Γ,ψ Γ, where ( ) Φ Γ = φ Γ + A e m 2 e ψ Γ, e E Γ nd ψ Γ,φ Γ re the lssi first nd seond grph polynomils: ψ Γ = spnningtrees T e T A e, φ Γ = Q(T 1 ) Q(T 2 ) A e, spnningtwo trees T 1 T 2 e T 1 T 2 with Q(T i ) the sum of the externl moment tthed to verties of T i. There exists then oroll differentil D Γ suh tht the Feynmn integrnd I Γ for onneted 3-regulr grphs Γ, Φ Γ I Γ = e ψ Γ ψγ 2, gives rise, when summed over onneted 3-regulr grphs Γ to the totl guge theory mplitude, using D Γ I Γ. For n exmple onsider the onneted one-loop tringle grphs. The slr grphs re, + 1

whilst in the guge theory se we hve more: + + + + + + + + + + + We hve internl qurk- nd ghost-loops, nd 4-vlent gluon verties. If we reple first ll edges in the 3-regulr slr se y guge-oson edges there re two steps remining: to either shrink internl oson edges to generte 4-vlent oson verties, or else to reple internl guge-oson loops y ghost or fermion loops. It is remrkle tht in this proess, the rnks of the utomorphism groups of grphs ply long (mening tht symmetry ftors ply long). This is due to n underlying doule omplex of two grph homologies sed on either shrinking edges or mrking losed yles in the grph [2]. Both homologies n e implemented using new grph polynomil on hlf-edges, the oroll polynomil [1]. 3. Grph Homology Let e e n edge onneting two 3-gluon verties in grph Γ, χ+ e e the opertor whih shrinks edge e, extend χ+ e to zero when ting etween ny other two verties. Let S, with S 2 = 0, e the orresponding grph homology opertor. Then, for guge theory mplitude r: Let 0x; jgl e the sum of ll 3-regulr onneted grphs, with j ghost loops, nd with externl legs determined y r nd loop numer n, weighted y olour nd symmetry, let /x, jgl e the sme llowing for 3- nd 4-vlent verties. We hve i) : e χ + 0 x; jgl = /x; jgl, ii) : Se χ + 0x; jgl = 0. This theorem shows we n generte ll 4-vlent ouplings y grph homology s studied in Vogtmnn s pper [4] sed on study of grph homology initited y Kontsevih. Let δ C + e the opertor whih mrks yle C through 3-vlent verties nd unmrked edges, extend 2

δ+ C to zero on ny other yle. Let T, with T 2 = 0, e the orresponding yle homology opertor. Then: Let jx;0gl e the sum of ll onneted grphs with j 4-verties ontriuting to mplitude r nd loop numer n nd no ghost loops, weighted y olour nd symmetry, jx;/gl e the sme llowing for ny possile numer of ghost loops. We hve i) : e δ + jx;0gl = jx;/gl, ii) : Te δ + jx;0gl = 0. This theorem ensures tht we n insert ghost loops (or fermion loops for tht mtter) using yle homology on grphs. This homology ws introdued in [2]. These two opertions re omptile [2, 5]: i) We hve [S,T]=0 (S+T) 2 = 0 nd Te δ ++χ + 0x;0gl = 0, Seδ ++χ + 0x;0gl = 0. ii) Together, they generte the whole guge theory mplitude from 3-regulr grphs: e δ ++χ + 0x;0gl = /x;/gl =:., the series over ll grphs ontriuting to physil mplitude, eh grph weighted y its symmetry ftor, is the only non-trivil element in the iomplex of yle- nd grph-homology [2, 5]. This indeed is BRST homology grph-theoretilly. To interprete BRST homology y grph homologies is n pproh very muh in line with n erly nlysis of QCD provided for exmple in Predrg Cvitnovi s leture notes [6]. 4. The oroll polynomil nd differentil The next step is to use the ove strutures to find n effiient trnsition from slr to guge theory mplitudes. This is filitted y the oroll polynomil given in [1] whose definition we follow: It is polynomil sed on hlf-edge vriles v, j ssigned to ny hlf-edge (v, j) determined y vertex v nd n edge j of grph Γ. We hve For vertex v V let n(v) e the set of edges inident to v (internl or externl). For vertex v V let D v = j n(v) v, j. Let C e the set of ll yles of Γ (yles, not iruits). This is finite set. 3

For C yle nd v vertex in V, sine Γ is 3-regulr, there is unique edge of Γ inident to v nd not in C, let v C e this edge. For i 0 let C i = C 1,C 2,...C i C C j pirwise disjoint (( i v,vc j=1 v C j ) ) D v v C 1 C 2 C i Then C= ( 1) j C j j 0 C = C Γ is the oroll polynomil. Hving this polynomil t our disposl, we n reple ny of its hlf-edges y differentil opertor. This defines oroll differentil whih ts on the slr integrnd. It ts on uxiliry externl moment ξ e (whih re set to the physil moment only fter the tion) whih we supplement in the slr integrnd for eh internl edge e. D g (h) := 1 2 gµ h+ µ h ( ε h+ 1 A e(h+ ) ξ(h + ) µh ε h 1 A e(h ) ), ξ(h ) µh for ny hlf-edge h. Here, hlf-edge h determines t 3-regulr vertex two other hlf-edges h +,h using tht we n orient eh oroll y theorem in [4] muh used in [2] (whih in tun determines the signs ε h± ), nd eh suh hlf-edge furthermore determines n edge e = e(h) to whih it elongs. e(h ) h e(h) h h+ e(h+) Doule differentils wrt the sme hlf edge generte the Feynmn rules for 4-vlent vertex vi Cuhy s residue formul: differentiting twie, the Leiniz rule ensures the emergene of poles with residues whih re the ontriutions of grpgs with 4-vlent gluon verties [2]. 5. Results Finlly, we get the Feynmn integrnds in the unrenormlized nd renormlized se for guge theory mplitude r from 3-regulr onneted grphs of slr fields. The full Yng Mills mplitude Ū Γ for grph Γ n e otined y ting with oroll differentil opertor on the slr integrnd U Γ ({ξ e }) for Γ, setting the edge moment ξ e = 0 fterwrds. 4

Moreover, Ū Γ gives rise to differentil form JŪΓ Γ nd there exists vetor H Γ suh tht the unrenormlized Feynmn integrnd for the sum of ll Feynmn grphs ontriuting to the onneted k-loop mplitude r is Φ(X r,k )= Γ =k,res(γ)=r olour(γ) sym(γ) JŪΓ Γ, H Γ The renormlized nlogue is given y writing Ū R Γ insted of Ū Γ [2]. This ws ll generlized to the full Stndrd Model y Dvid Prinz [3], showing tht even spontneous symmetry reking respets the struture of grph homologies nd n e pprohed y the oroll polynomil, with suitle doptions for the mtter nd ghost ontent of tht model. 6. Outer Spe Struture of Guge Theory There re growing signs tht the prmetri pproh to Feynmn digrms hs deep onnetion to the struture of Outer Spe [8, 9], in prtiulr when investigting monodromies of mplitudes. For the se of guge theories where verties of vlene higher thn four vnish, this genertes rther interesting Outer Spes where ells orresponding to o-dimension two hypersurfes re missing. A simple exmple is the one-loop tringle grph. The o-dimension one edges re oundries populted y grph with one three-vlent nd one four-vlent vertex (unions like in the figure). The zero-dimensionl o-dimension two ells re points deorted y tdpoles whih would hve foridden 5-vlent vertex. This is to e removed. + + + Note tht when suh Outer Spes with missing ells dopted to guge theories hve een onstruted, Green Funtion is n integrl over the whole suh Outer Spe - pieewise liner sum of integrls [10] over the volume of ll ells of the still llowed odimensions. 7. Outlook The two Kirhhoff polynomils re distinguished s unique polynomils on edge vriles hving reusive ontrtion deletion properties. 5

The oroll polynomil is similrly distinguished mongst hlf-edge polynomils hving reursive hlf-edge deletion properties [1]. This llows to onstrut the renormlized integrnd for onneted mplitude in guge theory from the slr mplitudes for onneted 3-regulr grphs [2]. Dvid Prinz hs generlized this pproh to mplitudes to the full SM [3]. Mrel Golz is turning this into very effiient lgorithm for QED mplitudes [7]. Wht is the oroll polynomil for spin 2 osons nd hene for quntum gvity? Cn we omine the redution to mster integrls (Lport s lgorithm) with this trnsition to guge theory? Referenes [1] D. Kreimer, K. Yets: Properties of the oroll polynomil of 3-regulr grph, El.J.Com.20, Issue 1 (2013) Pper no.p41 (rxiv:1207.5460 [mth.co]). [2] D. Kreimer, M. Srs, W.D. vn Suijlekom: Quntiztion of guge fields, grph polynomils nd grph homology, Annls Phys.336 (2013) 180-222 (rxiv:1208.6477 [hep-th]). [3] D. Prinz: The Coroll Polynomil for spontneously roken Guge Theories, Mth.Phys.Anl.Geom.19 (2016) no.3, 18 (rxiv:1603.03321 [mth-ph]). [4] J. Connt, K. Vogtmnn: On theorem of Kontsevih, Alger.Geom.Topol.3 (2003) 1167-1224 (rxiv:mth/0208169v2 [mth.qa]). [5] André Knispel, Comintoril BRST homology nd grph differentils, mster thesis, Humoldt U.2017, http://hu.erlin/kreimer /wp-ontent/uplods/knispel.pdf. [6] P. Cvitnović, Field Theory,ChosBook.org/FieldTheory, Niels Bohr Institute (Copenhgen 2004). [7] M. Golz, New grph polynomils in prmetri QED Feynmn integrls, Annls Phys. 385 (2017) 328 doi:10.1016/j.op.2017.08.010 [rxiv:1703.05134 [mth-ph]], Contrtion of Dir mtries vi hord digrms, rxiv:1710.05164 [mth-ph], nd in preprtion. [8] S. Bloh, D. Kreimer, Cutkosky Rules nd Outer Spe, rxiv:1512.01705 [hep-th]. [9] D. Kreimer, Cutkosky Rules from Outer Spe, PoS LL 2016 (2016) 035 doi:10.22323/1.260.0035 [rxiv:1607.04861 [hep-th]]. [10] M. Berghoff, Feynmn mplitudes on moduli spes of grphs, rxiv:1709.00545 [mth-ph]. 6