Papers
Topics
Authors
Recent
Search
2000 character limit reached

On Multi-step BCFW Recursion Relations

Published 23 Apr 2015 in hep-th | (1504.06306v2)

Abstract: In this paper, we extensively investigate the new algorithm known as the multi-step BCFW recursion relations. Many interesting mathematical properties are found and understanding these aspects, one can find a systematic way to complete the calculation of amplitude after finite, definite steps and get the correct answer, without recourse to any specific knowledge from field theories, besides mass dimension and helicities. This process consists of the pole concentration and inconsistency elimination. Terms that survive inconsistency elimination cannot be determined by the new algorithm. They include polynomials and their generalizations, which turn out to be useful objects to be explored. Afterwards, we apply it to the Standard Model plus gravity to illustrate its power and limitation. Ensuring its workability, we also tentatively discuss how to improve its efficiency by reducing the steps.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (3)

Collections

Sign up for free to add this paper to one or more collections.