arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.15679hep-thmath.CO
收藏

平面矩阵与Feynman图阵列:更高k的极点

Planar Matrices and Arrays of Feynman Diagrams: Poles for Higher $k$

Alfredo Guevara, Yong Zhang

AI总结:

本文推广Feynman图引入平面阵列以计算k>2的双伴随振幅,通过将其底层多面体表征为Flag Complex,提出仅基于极点知识的振幅计算方法,并利用阵列加法操作证明了组合对偶性猜想。

摘要:

树图的平面阵列作为Feynman图的推广被引入,使得能够计算k>2的双伴随振幅m^{(k)}_n。在这项后续工作中,我们从这种阵列的角度研究m^{(k)}_n的极点。对于一般的k,我们将底层的多面体表征为Flag Complex,并提出了一种仅基于极点知识的振幅计算方法,其极点数量远少于完整阵列的数量。作为例子,我们首先以广义Feynman图的形式提供了(k,n)=(3,7),(3,8),(4,8)和(4,9)情况下的所有极点。然后,我们实现了一种简单的相容性判据以及阵列间的加法操作,并恢复了最近针对这些情况提出的完整集合/阵列。在此过程中,我们实现了硬和软运动学极限,提供了运动学空间中的极点与其组合阵列之间的映射。我们使用该操作给出了阵列在(k,n)和(n-k,n)之间先前猜想的一种组合对偶性的证明。我们还概述了与超单纯形Δ_{k,n}的边界映射以及热带Grassmannian Tr(k,n)中射线的关系。

英文摘要:

Planar arrays of tree diagrams were introduced as a generalization of Feynman diagrams that enables the computation biadjoint amplitudes $m^{(k)}_n$ for $k>2$ . In this follow-up work we investigate the poles of $m^{(k)}_n$ from the perspective of such arrays. For general $k$ we characterize the underlying polytope as a Flag Complex and propose a computation of the amplitude based solely on the knowledge of poles, which number is drastically less than the number of full arrays. As an example we first provide all the poles for the cases $(k,n)=(3,7),(3,8),(4,8)$ and $(4,9)$ in terms of their generalized Feynman diagrams. We then implement a simple compatibility criteria together with an addition operation between arrays, and recover the full collections/arrays recently presented for such cases. Along the way we implement hard and soft kinematical limits, which provide a map between poles in kinematic space and their combinatoric arrays. We use the operation to give a proof of a previously conjectured combinatorial duality for arrays in $(k,n)$ and $(n-k,n)$. We also outline the relation to boundary maps of the hypersimplex $Δ_{k,n}$ and rays in the tropical Grassmannian $\textrm{Tr}(k,n)$.

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

↑