Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 99 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 40 tok/s
GPT-5 High 38 tok/s Pro
GPT-4o 101 tok/s
GPT OSS 120B 470 tok/s Pro
Kimi K2 161 tok/s Pro
2000 character limit reached

On-shell Recursion Relations for Tree-level Closed String Amplitudes (2410.15448v2)

Published 20 Oct 2024 in hep-th

Abstract: We derive a general expression for on-shell recursion relations of closed string tree-level amplitudes. Starting with the string amplitudes written in the form of the Koba-Nielsen integral, we apply the BCFW shift to deform them. In contrast to open string amplitudes, where poles are explicitly determined by the integration over vertex positions, we utilize Schwinger's parametrization to handle the pole structure in closed strings. Our analysis reveals that the shifted amplitudes contain $\delta$-function poles, which yield simple poles upon taking residues. This allows us to present a general expression for the on-shell recursion relation for closed strings. Additionally, we offer an alternative method for computing the residue of the shifted amplitudes by factorizing an $n$-point closed string amplitude into two lower-point amplitudes. This is achieved by inserting a completeness relation that includes all possible closed string states in the Fock space. Our results are consistent with those previously obtained.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

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