arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0911.1962hep-ph
收藏

有效的虚拟校正的着色计算

Efficient Color-Dressed Calculation of Virtual Corrections

Walter Giele, Zoltan Kunszt, Jan Winter

摘要:

随着广义么正性和参数积分技术的出现,构造一个通用的次主导阶蒙特卡罗方法变得可行。这样的发生器将需要处理QCD颜色的振幅。我们扩展的概念的颜色装饰一个循环的振幅,从而在制定一个明确的算法解决方案,用于计算任意散射过程在下一个领先的顺序。所得到的算法是指数的复杂性,即虚拟修正的数值计算时间的增长由一个常数乘法因子的外部部分子的数量增加。为了研究该方法的性质,我们计算了$n$ -胶子散射的虚修正。

英文摘要:

With the advent of generalized unitarity and parametric integration techniques, the construction of a generic Next-to-Leading Order Monte Carlo becomes feasible. Such a generator will entail the treatment of QCD color in the amplitudes. We extend the concept of color dressing to one-loop amplitudes, resulting in the formulation of an explicit algorithmic solution for the calculation of arbitrary scattering processes at Next-to-Leading order. The resulting algorithm is of exponential complexity, that is the numerical evaluation time of the virtual corrections grows by a constant multiplicative factor as the number of external partons is increased. To study the properties of the method, we calculate the virtual corrections to $n$-gluon scattering.

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

↑