Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 91 tok/s
Gemini 2.5 Pro 53 tok/s Pro
GPT-5 Medium 29 tok/s
GPT-5 High 26 tok/s Pro
GPT-4o 98 tok/s
GPT OSS 120B 470 tok/s Pro
Kimi K2 216 tok/s Pro
2000 character limit reached

Closed-string amplitude recursions from the Deligne associator (2412.17579v1)

Published 23 Dec 2024 in hep-th, math-ph, math.MP, and math.NT

Abstract: Inspired by earlier results on recursions for open-string tree-level amplitudes, and by a result of Brown and Dupont relating open- and closed-string tree-level amplitudes via single-valued periods, we identify a recursive relation for closed-string tree-level amplitudes. We achieve this by showing that closed-string analogues of Selberg integrals satisfy the Knizhnik-Zamolodchikov equation for a suitable matrix representation of the free Lie algebra on two generators, and by identifying the limits at z=1 and z=0, which are related by the Deligne associator, with N-point and (N-1)-point closed-string amplitudes, respectively.

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.