通过多体关系计算费曼图
Counting Feynman diagrams via many-body relations
摘要：
我们提出了一个迭代算法来计算费曼图通过多体关系。该算法允许我们计算一般费米子多体问题的精确解在相互作用中的每一阶的图的数量。此外，我们将其应用到不同的镶木地板型近似，并考虑自旋解析图中的哈伯德模型。低阶的结果和渐近性明确讨论了各种顶点函数和不同的两粒子通道。该算法可以很容易地实现和推广到多体关系的不同形式和水平的近似。
英文摘要：
We present an iterative algorithm to count Feynman diagrams via many-body relations. The algorithm allows us to count the number of diagrams of the exact solution for the general fermionic many-body problem at each order in the interaction. Further, we apply it to different parquet-type approximations and consider spin-resolved diagrams in the Hubbard model. Low-order results and asymptotics are explicitly discussed for various vertex functions and different two-particle channels. The algorithm can easily be implemented and generalized to many-body relations of different forms and levels of approximation.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
