arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1106.1648math-phhep-thmath.MPphysics.comp-ph
收藏

Chern-Simons引力的Dirac矩阵

Dirac Matrices for Chern-Simons Gravity

Fernando Izaurieta, Ricardo Ramírez, Eduardo Rodríguez

摘要:

庞加莱、德西特或反德西特代数的真正规范理论可以通过陈-西蒙斯形式在(2n-1)维时空中构造,产生一个不同于广义相对论但与它有许多相同性质的引力理论,例如度规的二阶场方程。拉格朗日量的特殊形式由相关代数下的秩为n的对称张量不变量确定。实际上,这个不变张量的计算可以归结为计算2n维时空中n个Dirac Gamma矩阵的对称化积的迹。虽然原则上很简单,但这种计算在实践中可能会变得非常繁琐。对于足够大的n,现有的计算机代数软件包需要非常长的时间来产生答案,或者在用完所有可用内存后明显失败。本文证明了2n个Gamma矩阵的对称化积的迹的一般公式可以写成n的整数分块s上的一个和,每一项都乘以一个数值系数α s。然后,我们给出了一个通用算法,该算法将α系数计算为线性方程组的解,该线性方程组是通过对具有随机数值项的不同张量集合B^{ab}计算通用公式而生成的。不同系数之间的递归关系被证明是持有,并用于第二个,“最小”算法,大大加快了计算。最小算法的迭代在典型的台式计算机上保持在1分钟以下,最多n=25,这很容易覆盖迹公式的所有可预见的应用。

英文摘要:

A genuine gauge theory for the Poincaré, de Sitter or anti-de Sitter algebras can be constructed in (2n-1)-dimensional spacetime by means of the Chern-Simons form, yielding a gravitational theory that differs from General Relativity but shares many of its properties, such as second order field equations for the metric. The particular form of the Lagrangian is determined by a rank n, symmetric tensor invariant under the relevant algebra. In practice, the calculation of this invariant tensor can be reduced to the computation of the trace of the symmetrized product of n Dirac Gamma matrices Γ_{ab} in 2n-dimensional spacetime. While straightforward in principle, this calculation can become extremely cumbersome in practice. For large enough n, existing computer algebra packages take an inordinate long time to produce the answer or plainly fail having used up all available memory. In this talk we show that the general formula for the trace of the symmetrized product of 2n Gamma matrices Γ_{ab} can be written as a certain sum over the integer partitions s of n, with every term being multiplied by a numerical coefficient α_{s}. We then give a general algorithm that computes the α-coefficients as the solution of a linear system of equations generated by evaluating the general formula for different sets of tensors B^{ab} with random numerical entries. A recurrence relation between different coefficients is shown to hold and is used in a second, "minimal" algorithm to greatly speed up the computations. Runtime of the minimal algorithm stays below 1 min on a typical desktop computer for up to n=25, which easily covers all foreseeable applications of the trace formula.

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

↑