A Zassenhaus-type algorithm solves the Bogoliubov recursion

Details A Zassenhaus-type algorithm solves the Bogoliubov recursion A Zassenhaus-type algorithm solves the Bogoliubov recursion

2007-10-26

arxiv.org/abs/0710.5134v2

Physics

Mathematical Physics

11 pages, improved version, to appear in Lie Theory and Its Applicatons in Physics VII ed. V.K. Dobrev et al., Heron Press, So

Scientific paper

This paper introduces a new Lie-theoretic approach to the computation of counterterms in perturbative renormalization. Contrary to the usual approach, the devised version of the Bogoliubov recursion does not follow a linear induction on the number of loops. It is well-behaved with respect to the Connes-Kreimer approach: that is, the recursion takes place inside the group of Hopf algebra characters with values in regularized Feynman amplitudes. (Paradigmatically, we use dimensional regularization in the minimal subtraction scheme, although our procedure is generalizable to other schemes.) The new method is related to Zassenhaus' approach to the Baker-Campbell-Hausdorff formula for computing products of exponentials. The decomposition of counterterms is parametrized by a family of Lie idempotents known as the Zassenhaus idempotents. It is shown, inter alia, that the corresponding Feynman rules generate the same algebra as the graded components of the Connes-Kreimer beta-function. This further extends previous work of ours (together with Jose M. Gracia-Bondia) on the connection between Lie idempotents and renormalization procedures, where we constructed the Connes-Kreimer beta-function by means of the classical Dynkin idempotent.

Affiliated with

Also associated with

No associations

Rating

A Zassenhaus-type algorithm solves the Bogoliubov recursion does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Zassenhaus-type algorithm solves the Bogoliubov recursion, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Zassenhaus-type algorithm solves the Bogoliubov recursion will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-192017