数值多项式同伦延拓方法与弦算法
Numerical Polynomial Homotopy Continuation Method and String Vacua
摘要:
从通量紧致化导出的四维有效超引力理论的真空寻找和稳定性分析是弦唯象学的核心问题之一。然而,除了一些简单的玩具模型外,很难通过分析找到所有的真空。最近开发的基于符号计算机代数的算法方法在更现实的模型中可以有很大的帮助。然而,他们遭受严重的算法复杂性,并限于小系统的大小。在这篇文章中,我们回顾了一个数值方法,称为数值多项式同伦延拓(NPHC)方法,首先使用在格点场论领域,通过建设发现\textit{all}的真空已知只有孤立的解决方案。已知NPHC方法没有主要的算法复杂性,并且是\textit{embarrassingly parallelizable},因此其适用性远远超出现有的符号方法。我们首先解决了一个简单的玩具模型作为热身的例子,以证明在工作中的NPHC方法和比较的结果与可用的结果从符号的方法。然后,我们表明,所有的真空更复杂的模型M理论紧的陪集$\frac{SU(3)\times U(1)}{U(1)\times U(1)}$,它具有SU(3)的结构,可以得到的NPHC方法使用台式机在大约一个小时内,这是一个壮举,据报道,这是非常困难的现有的符号方法。最后,我们比较了两种方法之间的各种技术细节。
英文摘要:
Finding vacua for the four dimensional effective theories for supergravity which descend from flux compactifications and analyzing them according to their stability is one of the central problems in string phenomenology. Except for some simple toy models, it is, however, difficult to find all the vacua analytically. Recently developed algorithmic methods based on symbolic computer algebra can be of great help in the more realistic models. However, they suffer from serious algorithmic complexities and are limited to small system sizes. In this article, we review a numerical method called the numerical polynomial homotopy continuation (NPHC) method, first used in the areas of lattice field theories, which by construction finds \textit{all} of the vacua of a given potential that is known to have only isolated solutions. The NPHC method is known to suffer from no major algorithmic complexities and is \textit{embarrassingly parallelizable}, and hence its applicability goes way beyond the existing symbolic methods. We first solve a simple toy model as a warm up example to demonstrate the NPHC method at work and compare the results with the available results from the symbolic methods. We then show that all the vacua of a more complicated model of M theory compactified on the coset $\frac{SU(3)\times U(1)}{U(1)\times U(1)}$, which has an SU(3) structure, can be obtained by the NPHC method using a desktop machine in just about one hour, a feat which was reported to be prohibitively difficult by the existing symbolic methods. Finally, we compare the various technicalities between the two methods.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。