Some variations of the reduction of one-loop Feynman tensor integrals

Physics – High Energy Physics – High Energy Physics - Phenomenology

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

8 pages, 1figure, 1 table, submitted to PoS(ACAT2010)074

Scientific paper

We present a new algorithm for the reduction of one-loop \emph{tensor} Feynman integrals with $n\leq 4$ external legs to \emph{scalar} Feynman integrals $I_n^D$ with $n=3,4$ legs in $D$ dimensions, where $D=d+2l$ with integer $l \geq 0$ and generic dimension $d=4-2\epsilon$, thus avoiding the appearance of inverse Gram determinants $()_4$. As long as $()_4\neq 0$, the integrals $I_{3,4}^D$ with $D>d$ may be further expressed by the usual dimensionally regularized scalar functions $I_{2,3,4}^d$. The integrals $I_{4}^D$ are known at $()_4 \equiv 0$, so that we may extend the numerics to small, non-vanishing $()_4$ by applying a dimensional recurrence relation. A numerical example is worked out. Together with a recursive reduction of 6- and 5-point functions, derived earlier, the calculational scheme allows a stabilized reduction of $n$-point functions with $n\leq 6$ at arbitrary phase space points. The algorithm is worked out explicitely for tensors of rank $R\leq n$.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Some variations of the reduction of one-loop Feynman tensor integrals 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 Some variations of the reduction of one-loop Feynman tensor integrals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some variations of the reduction of one-loop Feynman tensor integrals will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-513921

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.