arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.01773hep-th
收藏

Feynman图、带状图和Eynard-Orantin的拓扑递归

Feynman diagrams, ribbon graphs, and topological recursion of Eynard-Orantin

K. Gopala Krishna, Patrick Labelle, Vasilisa Shramchenko

摘要:

我们考虑两个看似无关的问题,计算的WKB展开的谐振子波函数和计数的费曼图在QED或多体物理的数量,并表明他们的解决方案都编码在一个单一的枚举问题,计算的某些类型的带状图的数量。反过来,这种带状图的数量作为其顶点和边的数量的函数,可以通过将Eynard-Orantin的拓扑递归应用于谐振子的薛定谔方程中编码的代数曲线来递归地确定。我们展示了如何这些带状图的数量可以写下来,在封闭的形式为任何给定的顶点和边的数量。利用这些数,我们得到了具有e条边的N-根带状图的个数公式,它与具有e+1-N圈的2N-点函数的Feynman图的个数公式相同。

英文摘要:

We consider two seemingly unrelated problems, the calculation of the WKB expansion of the harmonic oscillator wave functions and the counting the number of Feynman diagrams in QED or in many-body physics and show that their solutions are both encoded in a single enumerative problem, the calculation of the number of certain types of ribbon graphs. In turn, the numbers of such ribbon graphs as a function of the number of their vertices and edges can be determined recursively through the application of the topological recursion of Eynard-Orantin to the algebraic curve encoded in the Schrödinger equation of the harmonic oscillator. We show how the numbers of these ribbon graphs can be written down in closed form for any given number of vertices and edges. We use these numbers to obtain a formula for the number of N-rooted ribbon graphs with e edges, which is the same as the number of Feynman diagrams for 2N-point function with e+1-N loops.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑